Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan

This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search techniques to the Graphplan algorithm. It then describes how explanation based learning, dependency directed backtracking, dynamic variable ordering, forward checking, sticky values and random-restart search strategies can be adapted to Graphplan. Empirical results are provided to demonstrate that these augmentations improve Graphplan's performance significantly (up to 1000x speedups) on several benchmark problems. Special attention is paid to the explanation-based learning and dependency directed backtracking techniques as they are empirically found to be most useful in improving the performance of Graphplan.

[1]  Frank P. Coyle,et al.  Aaai '90 , 1990, IEEE Expert.

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

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

[4]  Francesca Rossi,et al.  Principles and Practice of Constraint Programming — CP '95 , 1995, Lecture Notes in Computer Science.

[5]  Fahiem Bacchus,et al.  Dynamic Variable Ordering in CSPs , 1995, CP.

[6]  Rina Dechter,et al.  In Search of the Best Constraint Satisfaction Search , 1994, AAAI.

[7]  Subbarao Kambhampati,et al.  Distance-Based Goal-Ordering Heuristics for Graphplan , 2000, AIPS.

[8]  Subbarao Kambhampati,et al.  Exploiting Symmetry in the Planning graph via Explanation-Guided Search , 1999, AAAI/IAAI.

[9]  Henry Kautz,et al.  Blackbox: Unifying sat-based and graph-based planning , 1999, International Joint Conference on Artificial Intelligence.

[10]  Esther Gelle,et al.  On the generation of locally consistent solution spaces in mixed dynamic constraint problems , 1998 .

[11]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

[12]  Subbarao Kambhampati,et al.  On the Relations Between Intelligent Backtracking and Failure-Driven Explanation-Based Learning in Constraint Satisfaction and Planning , 1998, Artif. Intell..

[13]  Bart Selman,et al.  Boosting Combinatorial Search Through Randomization , 1998, AAAI/IAAI.

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

[15]  David E. Smith,et al.  Extending Graphplan to Handle Uncertainty & Sensing Actions , 1998, AAAI/IAAI.

[16]  Hector J. Levesque,et al.  A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.

[17]  Chu Min Li,et al.  Heuristics Based on Unit Propagation for Satisfiability Problems , 1997, IJCAI.

[18]  Roberto J. Bayardo,et al.  Using CSP Look-Back Techniques to Solve Real-World SAT Instances , 1997, AAAI/IAAI.

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

[20]  Patrick Prosser,et al.  Domain Filtering can Degrade Intelligent Backtracking Search , 1993, IJCAI.

[21]  Subbarao Kambhampati,et al.  Scaling up Planning by Teasing out Resource Scheduling , 1999, ECP.

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

[23]  Subbarao Kambhampati,et al.  Investigating the Effect of Relevance and Reachability Constraints on SAT Encodings of Planning , 1999, AIPS.

[24]  Subbarao Kambhampati,et al.  Failure Driven Dynamic Search Control for Partial Order Planners: An Explanation Based Approach , 1996, Artif. Intell..

[25]  Subbarao Kambhampati,et al.  Improving Graphplan's Search with EBL & DDB Techniques , 1999, IJCAI.

[26]  Ivan Serina,et al.  Fast Planning through Greedy Action Graphs , 1999, AAAI/IAAI.

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

[28]  Subbarao Kambhampati,et al.  Extracting Effective and Admissible State Space Heuristics from the Planning Graph , 2000, AAAI/IAAI.

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

[30]  Thomas Schiex,et al.  Nogood Recording for static and dynamic constraint satisfaction problems , 1993, Proceedings of 1993 IEEE Conference on Tools with Al (TAI-93).

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

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

[33]  Brian Falkenhainer,et al.  Dynamic Constraint Satisfaction Problems , 1990, AAAI.

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

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

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