Proceedings

Improving Graphplan's Search with EBL & DDB Techniques

Download BibTeX Cite

Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence. Planning and Scheduling. Pages 982-986.

Abstract

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 (:::::100x speedups) as well as solvability-horizons on benchmark problems across seven different domains.

Subbarao Kambhampati. 1999. Improving Graphplan's Search with EBL & DDB Techniques. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI-99. IJCAI, 982–986. https://ijcai.org/proceedings/1999/140
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards