Improving Graphplan's search with EBL & DDB techniques

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Scopus citations

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

Original languageEnglish (US)
Title of host publicationIJCAI International Joint Conference on Artificial Intelligence
Pages982-987
Number of pages6
Volume2
StatePublished - 1999
Event16th International Joint Conference on Artificial Intelligence, IJCAI 1999 - Stockholm, Sweden
Duration: Jul 31 1999Aug 6 1999

Other

Other16th International Joint Conference on Artificial Intelligence, IJCAI 1999
CountrySweden
CityStockholm
Period7/31/998/6/99

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

Kambhampati, S. (1999). Improving Graphplan's search with EBL & DDB techniques. In IJCAI International Joint Conference on Artificial Intelligence (Vol. 2, pp. 982-987)