Approximation Algorithms and Heuristics for Classical Planning

Automated planning has been an active area of research in theoretical computer science and Artificial Intelligence (AI) for over 40 years. Planning is the study of general purpose algorithms that accept as input an initial state, a set of desired goal states, and a planning domain model that describes how actions can transform the state. The problem is to find a sequence of actions that transforms the initial state into one of the goal states. Planning is widely applicable, and has been used in such diverse application domains as spacecraft control [MNPW98], planetary rover operations [BJMR05], automated nursing aides [MP02], image processing [GPNV03], computer security [BGHH05] and automated manufacturing [RDF05]. Planning is also the subject of continued and lively ongoing research. In this chapter, we will present an overview of how approximations and related techniques are used in automated planning. We focus on classical planning problems, where states are conjunctions of propositions, all state information is known to the planner, and all action outcomes are deterministic. Classical planning is nonetheless a large problem class that generalizes many combinatorial problems including bin-packing ∗Universities Space Research Association †The authors gratefully acknowledge Sailesh Ramakrishnan, Ronen Brafman and Michael Freed for reviewing our early drafts

[1]  Jussi Rintanen,et al.  Satisfiability Planning with Constraints on the Number of Actions , 2005, ICAPS.

[2]  Stefan Edelkamp,et al.  Symbolic Pattern Databases in Heuristic Search Planning , 2002, AIPS.

[3]  Bart Selman,et al.  Encoding Plans in Propositional Logic , 1996, KR.

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

[5]  Biplav Srivastava,et al.  RealPlan: Decoupling Causal and Resource Reasoning in Planning , 2000, AAAI/IAAI.

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

[7]  Keith Golden,et al.  Automating the Processing of Earth Observation Data , 2003 .

[8]  Tom Bylander.  A Linear Programming Heuristic for Optimal Planning , 1997, AAAI/IAAI.

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

[10]  David E. Smith,et al.  Temporal Planning with Mutual Exclusion Reasoning , 1999, IJCAI.

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

[12]  Craig A. Knoblock,et al.  Planning by Rewriting , 2001, J. Artif. Intell. Res..

[13]  Rob Sherwood,et al.  The autonomous sciencecraft experiment onboard the EO-1 spacecraft , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[14]  Subbarao Kambhampati,et al.  Improving Temporal Flexibility of Position Constrained Metric Temporal Plans , 2003, ICAPS.

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

[16]  Malte Helmert,et al.  A Planning Heuristic Based on Causal Graph Analysis , 2004, ICAPS.

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

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

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

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

[21]  Fahiem Bacchus,et al.  Generalizing GraphPlan by Formulating Planning as a CSP , 2003, IJCAI.

[22]  David E. Smith.  Choosing Objectives in Over-Subscription Planning , 2004, ICAPS.

[23]  Paolo Traverso,et al.  Automated planning - theory and practice , 2004 .

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

[25]  Ari K. Jónsson,et al.  Activity Planning for the Mars Exploration Rovers , 2005, ICAPS.

[26]  David E. Smith,et al.  Bridging the gap between planning and scheduling , 2000, The Knowledge Engineering Review.

[27]  Yixin Chen,et al.  Subgoal Partitioning and Global Search for Solving Temporal Planning Problems in Mixed Space , 2004, Int. J. Artif. Intell. Tools.

[28]  Subbarao Kambhampati,et al.  Planning Graph Heuristics for Selecting Objectives in Over-subscription Planning Problems , 2005, ICAPS.

[29]  P. Pandurang Nayak,et al.  Remote Agent: To Boldly Go Where No AI System Has Gone Before , 1998, Artif. Intell..

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

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

[32]  Wheeler Ruml,et al.  On-line Planning and Scheduling for High-speed Manufacturing , 2005, ICAPS.

[33]  Malte Helmert,et al.  Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length , 1999, ECP.

[34]  Ivan Serina,et al.  Planning Through Stochastic Local Search and Temporal Action Graphs in LPG , 2003, J. Artif. Intell. Res..

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

[36]  Jörg Hoffmann,et al.  Ordered Landmarks in Planning , 2004, J. Artif. Intell. Res..

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

[38]  Christer Bäckström.  Computational Aspects of Reordering Plans , 1998, J. Artif. Intell. Res..

[39]  Martha E. Pollack,et al.  A Plan-Based Personalized Cognitive Orthotic , 2002, AIPS.

[40]  Jana Koehler,et al.  Planning under Resource Constraints , 1998, ECAI.

[41]  Jörg Hoffmann,et al.  The Metric-FF Planning System: Translating ''Ignoring Delete Lists'' to Numeric State Variables , 2003, J. Artif. Intell. Res..

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

[43]  Mark S. Boddy,et al.  Course of Action Generation for Cyber Security Using Classical Planning , 2005, ICAPS.