State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning

Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of a set of states, and the naive technique enumerates the graphs individually. This is equivalent to solving a multiple-source shortest path problem by iterating a single-source algorithm over each source. We introduce a data-structure, the state agnostic planning graph, that directly solves the multiple-source problem for the relaxation introduced by planning graphs. The technique can also be characterized as exploiting the overlap present in sets of planning graphs. For the purpose of exposition, we first present the technique in deterministic (classical) planning to capture a set of planning graphs used in forward chaining search. A more prominent application of this technique is in conformant and conditional planning (i.e., search in belief state space), where each search node utilizes a set of planning graphs; an optimization to exploit state overlap between belief states collapses the set of sets of planning graphs to a single set. We describe another extension in conformant probabilistic planning that reuses planning graph samples of probabilistic action outcomes across search nodes to otherwise curb the inherent prediction cost associated with handling probabilistic actions. Finally, we show how to extract a state agnostic relaxed plan that implicitly solves the relaxed planning problem in each of the planning graphs represented by the state agnostic planning graph and reduces each heuristic evaluation to counting the relevant actions in the state agnostic relaxed plan. Our experimental evaluation (using many existing International Planning Competition problems from classical and non-deterministic conformant tracks) quantifies each of these performance boosts, and demonstrates that heuristic belief state space progression planning using our technique is competitive with the state of the art.

[1]  R. Brafman,et al.  Contingent Planning via Heuristic Forward Search witn Implicit Belief States , 2005, ICAPS.

[2]  Blai Bonet,et al.  Fifth International Planning Competition , 2006 .

[3]  Daniel Bryce,et al.  State Agnostic Planning Graphs and the Application to Belief-Space Planning , 2005, AAAI.

[4]  Nathanael Hyafil,et al.  Utilizing Structured Representations and CSP's in Conformant Probabilistic Planning , 2004, ECAI.

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

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

[7]  Enrico Pontelli,et al.  Improving Performance of Conformant Planners: Static Analysis of Declarative Planning Domain Specifications , 2009, PADL.

[8]  Hector Geffner,et al.  A Translation-Based Approach to Contingent Planning , 2009, IJCAI.

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

[10]  Marcel Schoppers,et al.  Universal Plans for Reactive Robots in Unpredictable Environments , 1987, IJCAI.

[11]  Håkan L. S. Younes,et al.  VHPOP: Versatile Heuristic Partial Order Planner , 2003, J. Artif. Intell. Res..

[12]  Terry L. Zimmerman,et al.  Using Memory to Transform Search on the Planning Graph , 2005, J. Artif. Intell. Res..

[13]  David Warren,et al.  Warplan: a system for generating plans , 1974 .

[14]  Ronen I. Brafman,et al.  Conformant planning via heuristic forward search: A new approach , 2004, Artif. Intell..

[15]  Daniel Bryce,et al.  Scalable planning under uncertainty , 2007 .

[16]  Daniel Bryce,et al.  A Tutorial on Planning Graph Based Reachability Heuristics , 2007, AI Mag..

[17]  Subbarao Kambhampati,et al.  Probabilistic Planning via Determinization in Hindsight , 2008, AAAI.

[18]  Daniel Bryce,et al.  Sequential Monte Carlo in reachability heuristics for probabilistic planning , 2008, Artif. Intell..

[19]  Johan de Kleer,et al.  An Assumption-Based TMS , 1987, Artif. Intell..

[20]  Daniel Bryce,et al.  Sequential Monte Carlo in Probabilistic Planning Reachability Heuristics , 2006, ICAPS.

[21]  Timothy J. Robinson,et al.  Sequential Monte Carlo Methods in Practice , 2003 .

[22]  Nathanael Hyafil,et al.  Conformant Probabilistic Planning via CSPs , 2003, ICAPS.

[23]  Daniel Bryce,et al.  Planning Graph Heuristics for Belief Space Search , 2006, J. Artif. Intell. Res..

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

[25]  Sylvie Thiébaux,et al.  Prottle: A Probabilistic Temporal Planner , 2005, AAAI.

[26]  Daniel Bryce,et al.  Model-Lite Planning : Diverse Multi-Option Plans & Dynamic Objective Functions , 2007 .

[27]  Subbarao Kambhampati,et al.  Understanding and Extending Graphplan , 1997, ECP.

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

[29]  Robert P. Goldman,et al.  Using Classical Planners to Solve Nondeterministic Planning Problems , 2008, ICAPS.

[30]  Fabio Somenzi,et al.  CUDD: CU Decision Diagram Package Release 2.2.0 , 1998 .

[31]  M. Fox,et al.  Efficient Implementation of the Plan Graph in STAN , 2011, J. Artif. Intell. Res..

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

[33]  Carmel Domshlak,et al.  Fast Probabilistic Planning through Weighted Model Counting , 2006, ICAPS.

[34]  Hector Geffner,et al.  Compiling Uncertainty Away: Solving Conformant Planning Problems using a Classical Planner (Sometimes) , 2006, AAAI.

[35]  Judith Good,et al.  Learning to Think and Communicate with Diagrams: 14 Questions to Consider , 2001, Artificial Intelligence Review.

[36]  David Furcy,et al.  Speeding up the calculation of heuristics for heuristic search-based planning , 2002, AAAI/IAAI.

[37]  Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference, AAAI 98, IAAI 98, July 26-30, 1998, Madison, Wisconsin, USA , 1998, AAAI.

[38]  Jussi Rintanen,et al.  Expressive Equivalence of Formalisms for Planning with Sensing , 2003, ICAPS.

[39]  Jinbo Huang,et al.  Combining Knowledge Compilation and Search for Conformant Probabilistic Planning , 2006, ICAPS.

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

[41]  Ioannis P. Vlahavas,et al.  The GRT Planning System: Backward Heuristic Construction in Forward State-Space Planning , 2001, J. Artif. Intell. Res..

[42]  M. Fox,et al.  The 3rd International Planning Competition: Results and Analysis , 2003, J. Artif. Intell. Res..

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

[44]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[45]  Bernhard Nebel,et al.  Extending Planning Graphs to an ADL Subset , 1997, ECP.

[46]  Pierre Marquis,et al.  A Knowledge Compilation Map , 2002, J. Artif. Intell. Res..

[47]  J. Dekleer.  An assumption-based TMS , 1986 .

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

[49]  David E. Smith,et al.  Extending Graphplan to handle uncertainty and sensing actions , 1998, AAAI 1998.

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

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

[52]  Fahiem Bacchus,et al.  A Knowledge-Based Approach to Planning with Incomplete Information and Sensing , 2002, AIPS.

[53]  Larry S. Davis,et al.  Pattern Databases , 1979, Data Base Design Techniques II.