Matches in SemOpenAlex for { <https://semopenalex.org/work/W2949884098> ?p ?o ?g. }
Showing items 1 to 69 of
69
with 100 items per page.
- W2949884098 abstract "Since 1992 a popular and appealing technique for solving planning problems has been to use a general purpose solution procedure for Boolean SAT(isfiability) problems. In this setting, a fixed horizon instance of the problem is encoded as a formula in propositional logic. A SAT procedure then computes a satisfying valuation for that formula, or otherwise proves it unsatisfiable. Here, the SAT encoding is constructive in the usual sense that there is a one-to-one correspondence between plans –i.e., solutions to the planning problem– and satisfying valuations of the formula.One of the biggest drawbacks of this approach is the enormous sized formulae generated bythe proposed encodings. In this thesis we mitigate that problem by developing, implementing,and evaluating a novel encoding that uses the techniques of splitting and factoring to develop a compact encoding that is amenable to state-of-the-art SAT procedures. Overall, our approach is the most scalable, and our representation the most compact amongst optimal planning procedures.We then examine planning with numeric quantities, and in particular optimal planning withaction costs. SAT-based procedures have previously been proposed in this setting for the fixed horizon case, where there is a given limit on plan length, however a key challenge has been to develop a SAT-based procedure that can achieve horizon-independent optimal solutions – i.e., the least costly plan irrespective of length. Meeting that challenge, in this thesis we develop a novel horizon-independent optimal procedure that poses partially weighted MaxSAT problems to our own cost-optimising conflict-driven clause learning (CDCL) procedure. We perform a detailed empirical evaluation of our approach, detailing the types of problem structures where it dominates.Finally, we take the insights gleaned for the classical propositional planning case, and developa number of encodings of problems that are described using control-knowledge. That control knowledge expresses domain-dependent constraints which: (1) constrain the space of admissible plans, and (2) allow the compact specification of constraints on plans that cannot be naturally or efficiently specified in classical propositional planning. Specifically, in this thesis we develop encodings for planning using temporal logic based constraints, procedural knowledge written in a language based on ConGolog, and Hierarchical Task Network based constraints. Our compilations use the technique of splitting to achieve relatively compact encodings compared to existing compilations. In contrast to similar work in the field of answer set planning, our compilations admit plans in the parallel format, a feature that is crucial for the performance of SAT-based planning." @default.
- W2949884098 created "2019-06-27" @default.
- W2949884098 creator A5009674362 @default.
- W2949884098 date "2012-01-01" @default.
- W2949884098 modified "2023-09-24" @default.
- W2949884098 title "Advancing planning-as-satisfiability" @default.
- W2949884098 hasPublicationYear "2012" @default.
- W2949884098 type Work @default.
- W2949884098 sameAs 2949884098 @default.
- W2949884098 citedByCount "2" @default.
- W2949884098 countsByYear W29498840982014 @default.
- W2949884098 countsByYear W29498840982015 @default.
- W2949884098 crossrefType "dissertation" @default.
- W2949884098 hasAuthorship W2949884098A5009674362 @default.
- W2949884098 hasConcept C10138342 @default.
- W2949884098 hasConcept C111797529 @default.
- W2949884098 hasConcept C11413529 @default.
- W2949884098 hasConcept C118615104 @default.
- W2949884098 hasConcept C126255220 @default.
- W2949884098 hasConcept C162324750 @default.
- W2949884098 hasConcept C168773769 @default.
- W2949884098 hasConcept C177225278 @default.
- W2949884098 hasConcept C187455244 @default.
- W2949884098 hasConcept C28761237 @default.
- W2949884098 hasConcept C33923547 @default.
- W2949884098 hasConcept C41008148 @default.
- W2949884098 hasConcept C6943359 @default.
- W2949884098 hasConcept C69562738 @default.
- W2949884098 hasConceptScore W2949884098C10138342 @default.
- W2949884098 hasConceptScore W2949884098C111797529 @default.
- W2949884098 hasConceptScore W2949884098C11413529 @default.
- W2949884098 hasConceptScore W2949884098C118615104 @default.
- W2949884098 hasConceptScore W2949884098C126255220 @default.
- W2949884098 hasConceptScore W2949884098C162324750 @default.
- W2949884098 hasConceptScore W2949884098C168773769 @default.
- W2949884098 hasConceptScore W2949884098C177225278 @default.
- W2949884098 hasConceptScore W2949884098C187455244 @default.
- W2949884098 hasConceptScore W2949884098C28761237 @default.
- W2949884098 hasConceptScore W2949884098C33923547 @default.
- W2949884098 hasConceptScore W2949884098C41008148 @default.
- W2949884098 hasConceptScore W2949884098C6943359 @default.
- W2949884098 hasConceptScore W2949884098C69562738 @default.
- W2949884098 hasLocation W29498840981 @default.
- W2949884098 hasOpenAccess W2949884098 @default.
- W2949884098 hasPrimaryLocation W29498840981 @default.
- W2949884098 hasRelatedWork W1024086269 @default.
- W2949884098 hasRelatedWork W1502433320 @default.
- W2949884098 hasRelatedWork W1589146543 @default.
- W2949884098 hasRelatedWork W1994451575 @default.
- W2949884098 hasRelatedWork W2114785958 @default.
- W2949884098 hasRelatedWork W2130743314 @default.
- W2949884098 hasRelatedWork W2236863302 @default.
- W2949884098 hasRelatedWork W2243871733 @default.
- W2949884098 hasRelatedWork W2398045853 @default.
- W2949884098 hasRelatedWork W2399326884 @default.
- W2949884098 hasRelatedWork W2404889224 @default.
- W2949884098 hasRelatedWork W2502059287 @default.
- W2949884098 hasRelatedWork W2573805868 @default.
- W2949884098 hasRelatedWork W2740290912 @default.
- W2949884098 hasRelatedWork W2888317738 @default.
- W2949884098 hasRelatedWork W2895244445 @default.
- W2949884098 hasRelatedWork W2904811519 @default.
- W2949884098 hasRelatedWork W2948024043 @default.
- W2949884098 hasRelatedWork W3120872138 @default.
- W2949884098 hasRelatedWork W900043438 @default.
- W2949884098 isParatext "false" @default.
- W2949884098 isRetracted "false" @default.
- W2949884098 magId "2949884098" @default.
- W2949884098 workType "dissertation" @default.