The Role of Macros in Tractable Planning

This paper presents several new tractability results for planning based on macros. We describe an algorithm that optimally solves planning problems in a class that we call inverted tree reducible, and is provably tractable for several subclasses of this class. By using macros to store partial plans that recur frequently in the solution, the algorithm is polynomial in time and space even for exponentially long plans. We generalize the inverted tree reducible class in several ways and describe modifications of the algorithm to deal with these new classes. Theoretical results are validated in experiments.

[1]  Richard E. Korf,et al.  Planning as Search: A Quantitative Approach , 1987, Artif. Intell..

[2]  Steven Minton,et al.  Selectively Generalizing Plans for Problem-Solving , 1985, IJCAI.

[3]  John Levine,et al.  Learning Macro-Actions for Arbitrary Planners and Domains , 2007, ICAPS.

[4]  Eyal Amir,et al.  Factored planning , 2003, IJCAI 2003.

[5]  Craig A. Knoblock.  Automatically Generating Abstractions for Planning , 1994, Artif. Intell..

[6]  Ronen I. Brafman,et al.  Factored Planning: How, When, and When Not , 2006, AAAI.

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

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

[9]  Anders Jonsson.  The Role of Macros in Tractable Planning over Causal Graphs , 2007, IJCAI.

[10]  Anders Jonsson,et al.  Planning over Chain Causal Graphs for Variables with Domains of Size 5 Is NP-Hard , 2009, J. Artif. Intell. Res..

[11]  Carmel Domshlak,et al.  Structural Patterns Heuristics via Fork Decomposition , 2008, ICAPS.

[12]  Anders Jonsson,et al.  The Complexity of Planning Problems With Simple Causal Graphs , 2008, J. Artif. Intell. Res..

[13]  Malte Helmert,et al.  The Fast Downward Planning System , 2006, J. Artif. Intell. Res..

[14]  Hubie Chen,et al.  Act Local, Think Global: Width Notions for Tractable Planning , 2007, ICAPS.

[15]  Carmel Domshlak,et al.  New Islands of Tractability of Cost-Optimal Planning , 2008, J. Artif. Intell. Res..

[16]  Ronen I. Brafman,et al.  Strucutre and Complexitiy in Planning with Unary Operators , 2000, PuK.

[17]  Vincent Vidal,et al.  A Lookahead Strategy for Heuristic Search Planning , 2004, ICAPS.

[18]  P. Pandurang Nayak,et al.  A Reactive Planner for a Model-based Executive , 1997, IJCAI.

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

[20]  Christer Bäckström,et al.  State-Variable Planning Under Structural Restrictions: Algorithms and Complexity , 1998, Artif. Intell..

[21]  David Chapman,et al.  Planning for Conjunctive Goals , 1987, Artif. Intell..

[22]  Hubie Chen,et al.  Causal graphs and structurally restricted planning , 2010, J. Comput. Syst. Sci..

[23]  Jonathan Schaeffer,et al.  Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators , 2005, J. Artif. Intell. Res..

[24]  Patrik Haslum.  A New Approach to Tractable Planning , 2008, ICAPS.

[25]  Christer Bäckström,et al.  Tractable plan existence does not imply tractable plan generation , 2004, Annals of Mathematics and Artificial Intelligence.

[26]  Jonathan Schaeffer,et al.  Fast Planning with Iterative Macros , 2007, IJCAI.

[27]  Hubie Chen,et al.  On-the-Fly Macros , 2009, WoLLIC.

[28]  Carmel Domshlak,et al.  Multi-agent off-line coordination: Structure and complexity , 2001 .

[29]  Olivier Buffet,et al.  Factored Planning Using Decomposition Trees , 2007, IJCAI.