State-Space Traversal Techniques for Planning

Foreword These notes are based on the AI planning lectures at the Albert-Ludwigs-Universität Freiburg. I would like to thank all the students who have participated in the planning course and given comments, pointed out errors, and suggested other improvements, including Slawomir Grzonka,

[1]  Marco Pistore,et al.  Weak, strong, and strong cyclic planning via symbolic model checking , 2003, Artif. Intell..

[2]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  Jesse Hoey,et al.  SPUDD: Stochastic Planning using Decision Diagrams , 1999, UAI.

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

[5]  Piergiorgio Bertoli,et al.  Planning in Nondeterministic Domains under Partial Observability via Symbolic Model Checking , 2001, IJCAI.

[6]  A. Prasad Sistla,et al.  Symmetry and model checking , 1996, Formal Methods Syst. Des..

[7]  Antti Valmari,et al.  Stubborn sets for reduced state space generation , 1991, Applications and Theory of Petri Nets.

[8]  Jussi Rintanen,et al.  Conditional Planning in the Discrete Belief Space , 2005, IJCAI.

[9]  Alberto Martelli,et al.  Additive AND/OR Graphs , 1973, IJCAI.

[10]  Blai Bonet,et al.  Labeled RTDP: Improving the Convergence of Real-Time Dynamic Programming , 2003, ICAPS.

[11]  Edmund M. Clarke,et al.  Symbolic model checking for sequential circuit verification , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

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

[14]  Hector J. Levesque,et al.  Generating Hard Satisfiability Problems , 1996, Artif. Intell..

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

[16]  Subbarao Kambhampati,et al.  Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search , 2002, Artif. Intell..

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

[18]  David E. Smith,et al.  Conditional Effects in Graphplan , 1998, AIPS.

[19]  Jussi Rintanen,et al.  Complexity of Planning with Partial Observability , 2004, ICAPS.

[20]  Earl D. Sacerdoti,et al.  Planning in a Hierarchy of Abstraction Spaces , 1974, IJCAI.

[21]  Stanley J. Rosenschein,et al.  Plan Synthesis: A Logical Perspective , 1981, IJCAI.

[22]  Leslie Pack Kaelbling,et al.  Planning and Acting in Partially Observable Stochastic Domains , 1998, Artif. Intell..

[23]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[24]  Judea Pearl,et al.  Heuristics : intelligent search strategies for computer problem solving , 1984 .

[25]  Enrico Macii,et al.  Algebric Decision Diagrams and Their Applications , 1997, ICCAD '93.

[26]  C. Cordell Green,et al.  Application of Theorem Proving to Problem Solving , 1969, IJCAI.

[27]  Jussi Rintanen,et al.  Constructing Conditional Plans by a Theorem-Prover , 1999, J. Artif. Intell. Res..

[28]  George W. Ernst,et al.  GPS : a case study in generality and problem solving , 1971 .

[29]  Robert K. Brayton,et al.  Partial-Order Reduction in Symbolic State Space Exploration , 1997, CAV.

[30]  Enrico Macii,et al.  Algebraic decision diagrams and their applications , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[31]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

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

[33]  Patrice Godefroid.  Using Partial Orders to Improve Automatic Verification Methods , 1990, CAV.

[34]  Drew McDermott,et al.  Using Regression-Match Graphs to Control Search in Planning , 1999, Artif. Intell..

[35]  James A. Hendler,et al.  Readings in Planning , 1994 .

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

[37]  Anders R. Kristensen,et al.  Dynamic programming and Markov decision processes , 1996 .

[38]  Edward J. Sondik,et al.  The Optimal Control of Partially Observable Markov Processes over a Finite Horizon , 1973, Oper. Res..

[39]  Andrew G. Barto,et al.  Learning to Act Using Real-Time Dynamic Programming , 1995, Artif. Intell..

[40]  Albert R. Meyer,et al.  The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space , 1972, SWAT.

[41]  T. Dean,et al.  Planning under uncertainty: structural assumptions and computational leverage , 1996 .

[42]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[43]  Blai Bonet,et al.  Planning with Incomplete Information as Heuristic Search in Belief Space , 2000, AIPS.

[44]  David A. McAllester,et al.  Systematic Nonlinear Planning , 1991, AAAI.

[45]  Armando Tacchella,et al.  SAT-based planning in complex domains: Concurrency, constraints and nondeterminism , 2003, Artif. Intell..

[46]  Alberto Martelli,et al.  Optimizing decision trees through heuristically guided search , 1978, CACM.

[47]  Tom Bylander,et al.  The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..

[48]  Willem P. de Roever,et al.  A Calculus for Recursive Program Schemes , 1972, ICALP.

[49]  Ilkka Niemelä,et al.  Planning as satisfiability: parallel plans and algorithms for plan search , 2006, Artif. Intell..

[50]  Masahiro Fujita,et al.  Multi-Terminal Binary Decision Diagrams: An Efficient Data Structure for Matrix Representation , 1997, Formal Methods Syst. Des..

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

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

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

[54]  José L. Balcázar,et al.  The Complexity of Graph Problems fore Succinctly Represented Graphs , 1989, WG.

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

[56]  V. S. Subrahmanian,et al.  Complexity, Decidability and Undecidability Results for Domain-Independent Planning , 1995, Artif. Intell..

[57]  Bernhard Nebel,et al.  COMPLEXITY RESULTS FOR SAS+ PLANNING , 1995, Comput. Intell..

[58]  P. H. Starke,et al.  Reachability analysis of Petri nets using symmetries , 1991 .

[59]  Randal E. Bryant,et al.  Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.

[60]  Earl D. Sacerdoti,et al.  The Nonlinear Nature of Plans , 1975, IJCAI.

[61]  Edmund M. Clarke,et al.  Efficient generation of counterexamples and witnesses in symbolic model checking , 1995, DAC '95.

[62]  Anne Condon,et al.  On the undecidability of probabilistic planning and related stochastic optimization problems , 2003, Artif. Intell..

[63]  Jussi Rintanen,et al.  Distance Estimates for Planning in the Discrete Belief Space , 2004, AAAI.

[64]  Richard E. Korf,et al.  Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..

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

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

[67]  Daniel Bryce,et al.  Heuristic Guidance Measures for Conformant Planning , 2004, ICAPS.

[68]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[69]  Patrik Haslum,et al.  Admissible Heuristics for Optimal Planning , 2000, AIPS.

[70]  Shlomo Zilberstein,et al.  LAO*: A heuristic search algorithm that finds solutions with loops , 2001, Artif. Intell..

[71]  Lenhart K. Schubert,et al.  Inferring State Constraints for Domain-Independent Planning , 1998, AAAI/IAAI.

[72]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

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