Improving Graphplan's Search with EBL & DDB Techniques

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

Cite

Text

Kambhampati. "Improving Graphplan's Search with EBL & DDB Techniques." International Joint Conference on Artificial Intelligence, 1999.

Markdown

[Kambhampati. "Improving Graphplan's Search with EBL & DDB Techniques." International Joint Conference on Artificial Intelligence, 1999.](https://mlanthology.org/ijcai/1999/kambhampati1999ijcai-improving/)

BibTeX

@inproceedings{kambhampati1999ijcai-improving,
  title     = {{Improving Graphplan's Search with EBL & DDB Techniques}},
  author    = {Kambhampati, Subbarao},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {1999},
  pages     = {982-987},
  url       = {https://mlanthology.org/ijcai/1999/kambhampati1999ijcai-improving/}
}