Planning as satisfiability: parallel plans and algorithms for plan search

We address two aspects of constructing plans efficiently by means of satisfiability testing: efficient encoding of the problem of existence of plans of a given number t of time points in the propositional logic and strategies for finding plans, given these formulae for different values of t. For the first problem we consider three semantics for plans with parallel operator application in order to make the search for plans more efficient. The standard semantics requires that parallel operators are independent and can therefore be executed in any order. We consider a more relaxed definition of parallel plans which was first proposed by Dimopoulos et al., as well as a normal form for parallel plans that requires every operator to be executed as early as possible. We formalize the semantics of parallel plans emerging in this setting and present translations of these semantics into the propositional logic. The sizes of the translations are asymptotically optimal. Each of the semantics is constructed in such a way that there is a plan following the semantics exactly when there is a sequential plan, and moreover, the existence of a parallel plan implies the existence of a sequential plan with as many operators as in the parallel one. For the second problem we consider strategies based on testing the satisfiability of several formulae representing plans of n time steps for several values of n concurrently by several processes. We show that big efficiency gains can be obtained in comparison to the standard strategy of sequentially testing the satisfiability of formulae for an increasing number of time steps.

[1]  Tom Bylander,et al.  A Probabilistic Analysis of Propositional STRIPS Planning , 1996, Artif. Intell..

[2]  Kenneth L. McMillan,et al.  Interpolation and SAT-Based Model Checking , 2003, CAV.

[3]  Tatsuhiro Tsuchiya,et al.  SAT-Based Verification of Safe Petri Nets , 2004, ATVA.

[4]  Anna Philippou,et al.  Tools and Algorithms for the Construction and Analysis of Systems , 2018, Lecture Notes in Computer Science.

[5]  Keijo Heljanko,et al.  Bounded Reachability Checking with Process Semantics , 2001, CONCUR.

[6]  Craig A. Knoblock,et al.  PDDL-the planning domain definition language , 1998 .

[7]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[8]  Ilkka Niemelä,et al.  Parallel Encodings of Classical Planning as Satisfiability , 2004, JELIA.

[9]  Wolfgang Ertel,et al.  Optimal parallelization of Las Vegas algorithms , 1993, Forschungsberichte, TU Munich.

[10]  Mary Sheeran,et al.  Checking Safety Properties Using Induction and a SAT-Solver , 2000, FMCAD.

[11]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[12]  Karem A. Sakallah,et al.  Computing Vertex Eccentricity in Exponentially Large Graphs: QBF Formulation and Solution , 2003, SAT.

[13]  Peter van Beek,et al.  CPlan: A Constraint Programming Approach to Planning , 1999, AAAI/IAAI.

[14]  Jussi Rintanen.  Evaluation Strategies for Planning as Satisfiability , 2004, ECAI.

[15]  M. Kenward,et al.  An Introduction to the Bootstrap , 2007 .

[16]  Raymond R. Devillers,et al.  Sequential and Concurrent Behaviour in Petri Net Theory , 1987, Theor. Comput. Sci..

[17]  Blai Bonet,et al.  Planning as heuristic search , 2001, Artif. Intell..

[18]  Bart Selman,et al.  Unifying SAT-based and Graph-based Planning , 1999, IJCAI.

[19]  Bart Selman,et al.  Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.

[20]  Katsumi Inoue,et al.  Effective SAT Planning by Speculative Computation , 2002, Australian Joint Conference on Artificial Intelligence.

[21]  Henry A. Kautz,et al.  State-space Planning by Integer Optimization , 1999, AAAI/IAAI.

[22]  Daniel S. Weld,et al.  The LPSAT Engine & Its Application to Resource Planning , 1999, IJCAI.

[23]  Jussi Rintanen.  Phase Transitions in Classical Planning: An Experimental Study , 2004, ICAPS.

[24]  Michael D. Ernst,et al.  Automatic SAT-Compilation of Planning Problems , 1997, IJCAI.

[25]  Timo Latvala,et al.  Incremental and Complete Bounded Model Checking for Full PLTL , 2005, CAV.

[26]  Subbarao Kambhampati,et al.  Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP , 2001, Artif. Intell..

[27]  Henry Kautz,et al.  Pushing the envelope: planning , 1996 .

[28]  Armin Biere,et al.  Symbolic Model Checking without BDDs , 1999, TACAS.

[29]  Bart Selman,et al.  Planning as Satisfiability , 1992, ECAI.

[30]  Maciej Koutny,et al.  Merged processes: a new condensed representation of Petri net behaviour , 2006, Acta Informatica.

[31]  Jussi Rintanen,et al.  A Planning Algorithm not based on Directional Search , 1998, KR.

[32]  Bernhard Nebel,et al.  The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..

[33]  Jussi Rintanen,et al.  State-Space Traversal Techniques for Planning , 2005 .

[34]  Maciej Koutny,et al.  Merged Processes - A New Condensed Representation of Petri Net Behaviour , 2005, CONCUR.

[35]  Niklas Sörensson,et al.  Temporal induction by incremental SAT solving , 2003, BMC@CAV.

[36]  Bernhard Nebel,et al.  Encoding Planning Problems in Nonmonotonic Logic Programs , 1997, ECP.

[37]  Avrim Blum,et al.  Fast Planning Through Planning Graph Analysis , 1995, IJCAI.

[38]  Vincent Vidal,et al.  Least commitment in Graphplan , 2001, Artif. Intell..

[39]  Robert Tibshirani,et al.  Bootstrap Methods for Standard Errors, Confidence Intervals, and Other Measures of Statistical Accuracy , 1986 .

[40]  Daniel S. Weld.  Recent Advances in AI Planning , 1999, AI Mag..

[41]  Yves Métivier,et al.  Partial Commutation and Traces , 1997, Handbook of Formal Languages.

[42]  S. T. Buckland,et al.  An Introduction to the Bootstrap. , 1994 .

[43]  Bart Selman,et al.  Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems , 2000, Journal of Automated Reasoning.

[44]  Emmanuel Zarpas.  Simple Yet Efficient Improvements of SAT Based Bounded Model Checking , 2004, FMCAD.