论文信息 - Improving Graphplan's Search with EBL & DDB Techniques

Improving Graphplan's Search with EBL & DDB Techniques

I highlight some inefficiencies of Graphplan's backward search algorithm, and describe how these can be eliminated by adding explanation-based learning and dependency-directed backtracking capabilities to Graphplan. I will then demonstrate the effectiveness of these augmentations by describing results of empirical studies that show dramatic improvements in run-time (w 100× speedups) as well as solvability-horizons on benchmark problems across seven different domains.

Subbarao Kambhampati | S. Kambhampati

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

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

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

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

[5] Alan K. Mackworth. Constraint Satisfaction , 1985 .

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

[7] R. Dechter. to Constraint Satisfaction , 1991 .

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

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

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

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

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

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