Perspectives on artificial intelligence planning

Planning is a key area in Artificial Intelligence. In its general form, planning is concerned with the automatic synthesis of action strategies (plans) from a description of actions, sensors, and goals. Planning thus contrasts with two other approaches to intelligent behavior: the programming approach, where action strategies are defined by hand, and the learning approach, where action strategies are inferred from experience. Different assumptions about the nature of actions, sensors, and costs lead to various forms of planning: planning with complete information and deterministic actions (classical planning), planning with non-deterministic actions and sensing, planning with temporal and concurrent actions, etc. Most work so far has been devoted to classical planning, where significant changes have taken place in the last few years. On the methodological side, the area has become more empirical, on the technical side, approaches based on heuristic or constrained-based search have become common.In this paper, I try to provide a coherent picture of Planning in AI, making emphasis on the mathematical models that underlie various forms of planning and the ideas that have been found most useful computationally.

[1]  Héctor Geffner Functional Strips , 2001 .

[2]  Daniel S. Weld An Introduction to Least Commitment Planning , 1994, AI Mag..

[3]  E. Feigenbaum,et al.  Computers and Thought , 1963 .

[4]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

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

[6]  Alfredo Milani,et al.  DPPlan: An Algorithm for Fast Solutions Extraction from a Planning Graph , 2000, AIPS.

[7]  Edwin P. D. Pednault,et al.  ADL: Exploring the Middle Ground Between STRIPS and the Situation Calculus , 1989, KR.

[8]  David E. Wilkins,et al.  A Call for Knowledge-Based Planning , 2001, AI Mag..

[9]  Hector Geffner,et al.  Heuristic Planning with Time and Resources , 2014 .

[10]  Richard E. Korf,et al.  Recent Progress in the Design and Analysis of Admissible Heuristic Functions , 2000, AAAI/IAAI.

[11]  E. Sandewall Features and fluents (vol. 1): the representation of knowledge about dynamical systems , 1995 .

[12]  Enrico Giunchiglia,et al.  Planning as Satisfiability in Nondeterministic Domains , 2000, AAAI/IAAI.

[13]  Peter J. Stuckey,et al.  Programming with Constraints: An Introduction , 1998 .

[14]  Drew McDermott,et al.  The 1998 AI Planning Systems Competition , 2000, AI Mag..

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

[16]  Jonathan Schaeffer,et al.  Pattern Databases , 1998, Comput. Intell..

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

[18]  Nicola Muscettola,et al.  Planning in Interplanetary Space: Theory and Practice , 2000, AIPS.

[19]  Patrik Haslum,et al.  Extending TALplanner with Concurrency and Resources , 2000, ECAI.

[20]  Richard E. Korf,et al.  Finding Optimal Solutions to Rubik's Cube Using Pattern Databases , 1997, AAAI/IAAI.

[21]  Richard E. Korf,et al.  Real-Time Heuristic Search , 1990, Artif. Intell..

[22]  Fahiem Bacchus,et al.  Planning with Resources and Concurrency: A Forward Chaining Approach , 2001, IJCAI.

[23]  Allen Newell,et al.  GPS, a program that simulates human thought , 1995 .

[24]  Andrea Lodi,et al.  Soving TSP with Time Windows with Constraints , 1999, ICLP.

[25]  Eugene Fink,et al.  Formalizing the PRODIGY planning algorithm , 1996 .

[26]  Austin Tate,et al.  O-Plan: The open Planning Architecture , 1991, Artif. Intell..

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

[28]  G. Nemhauser,et al.  Integer Programming , 2020 .

[29]  Stephen P. Boyd,et al.  Branch and Bound Methods , 1987 .

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

[31]  David E. Wilkins,et al.  Practical planning - extending the classical AI planning paradigm , 1989, Morgan Kaufmann series in representation and reasoning.

[32]  J. Christopher Beck,et al.  This Is a Publication of The American Association for Artificial Intelligence , 2022 .

[33]  Bernhard Nebel Compilation Schemes: A Theoretical Tool for Assessing the Expressive Power of Planning Formalisms , 1999, KI.

[34]  Blai Bonet,et al.  A Robust and Fast Action Selection Mechanism for Planning , 1997, AAAI/IAAI.

[35]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

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

[37]  Fahiem Bacchus,et al.  Using temporal logics to express search control knowledge for planning , 2000, Artif. Intell..

[38]  Hector J. Levesque,et al.  GOLOG: A Logic Programming Language for Dynamic Domains , 1997, J. Log. Program..

[39]  Drew McDermott,et al.  A Heuristic Estimator for Means-Ends Analysis in Planning , 1996, AIPS.

[40]  Brian W. Kernighan,et al.  AMPL: A Modeling Language for Mathematical Programming , 1993 .

[41]  David E. Smith,et al.  Conformant Graphplan , 1998, AAAI/IAAI.

[42]  Sean R Eddy,et al.  What is dynamic programming? , 2004, Nature Biotechnology.

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

[44]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[45]  Pascal Van Hentenryck Improved CLP Scheduling with Task Intervals , 1994 .

[46]  Leslie Pack Kaelbling,et al.  Planning With Deadlines in Stochastic Domains , 1993, AAAI.

[47]  Erik Sandewall Features and fluents : representation of knowledge about dynamical systems , 1994 .

[48]  Dana S. Nau,et al.  On the Use of Integer Programming Models in AI Planning , 1999, IJCAI.

[49]  Nicholas Kushmerick,et al.  An Algorithm for Probabilistic Planning , 1995, Artif. Intell..

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

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

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

[53]  Maria Fox,et al.  PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains , 2003, J. Artif. Intell. Res..

[54]  Alfredo Milani,et al.  New directions in AI planning , 1996 .

[55]  Subbarao Kambhampati,et al.  Solving Planning-Graph by Compiling It into CSP , 2000, AIPS.

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

[57]  Karl Johan Åström,et al.  Optimal control of Markov processes with incomplete state information , 1965 .

[58]  E. Balas,et al.  Branch and Bound Methods for the Traveling Salesman Problem , 1983 .

[59]  Allen Newell,et al.  Human Problem Solving. , 1973 .

[60]  Fahiem Bacchus,et al.  AIPS 2000 Planning Competition: The Fifth International Conference on Artificial Intelligence Planning and Scheduling Systems , 2001 .

[61]  Maria Fox,et al.  Automatic Synthesis and Use of Generic Types in Planning , 2000, AIPS.

[62]  Pascal Van Hentenryck The OPL optimization programming language , 1999 .

[63]  Reid G. Simmons,et al.  Real-Time Search in Non-Deterministic Domains , 1995, IJCAI.

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

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

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

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

[68]  Danny De Schreye Solving TSP with Time Windows with Constraints , 1999 .

[69]  Jonathan Schaeffer,et al.  Domain-Dependent Single-Agent Search Enhancements , 1999, IJCAI.

[70]  Blai Bonet,et al.  Planning as Heuristic Search: New Results , 1999, ECP.

[71]  Michael Gelfond,et al.  Representing Action and Change by Logic Programs , 1993, J. Log. Program..

[72]  Robert C. Holte,et al.  A Space-Time Tradeoff for Memory-Based Heuristics , 1999, AAAI/IAAI.

[73]  Daniel S. Weld,et al.  UCPOP: A Sound, Complete, Partial Order Planner for ADL , 1992, KR.

[74]  Paolo Traverso,et al.  Strong Cyclic Planning Revisited , 1999, ECP.

[75]  Piergiorgio Bertoli,et al.  Improving Heuristics for Planning as Search in Belief Space , 2002, AIPS.

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

[77]  Richard E. Korf,et al.  Linear-Space Best-First Search , 1993, Artif. Intell..

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

[79]  Subbarao Kambhampati,et al.  Reviving Partial Order Planning , 2001, IJCAI.