Using Available Memory to Transform Graphplan's Search

Zimmerman, Terry; Kambhampati, Subbarao

Using Available Memory to Transform Graphplan's Search

Download BibTeX Cite

Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Pages 1526--1.

Abstract

We present a major variant of the Graphplan algorithm that employs available memory to transform the depth-first nature of Graphplan's search into an iterative sta te space view in which heuristics can be used to traverse the search space. When the planner, PEGG, is set to conduct exhaustive search, it produces guaranteed optimal parallel plans 2 to 90 times faster than a version of Graphplan enhanced with CSP speedup methods. By heuristically pruning this search space PEGG produces plans comparable to Graphplan's in makespan, at speeds ap proaching state-of-the-art heuristic serial planners.

Terry Zimmerman, and Subbarao Kambhampati. 2003. Using Available Memory to Transform Graphplan's Search. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI-03. IJCAI, 1526–-1. https://ijcai.org/proceedings/2003/261

@inproceedings{ijcai2003p261,
  title     = {Using Available Memory to Transform Graphplan's Search},
  author    = {Zimmerman, Terry and Kambhampati, Subbarao},
  booktitle = {Proceedings of the Eighteenth International Joint Conference on
               Artificial Intelligence, {IJCAI-03}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Georg Gottlob},
  pages     = {1526---1},
  year      = {2003},
  url       = {https://ijcai.org/proceedings/2003/261},
}

TY  - CPAPER
TI  - Using Available Memory to Transform Graphplan's Search
AU  - Zimmerman, Terry
AU  - Kambhampati, Subbarao
T2  - Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI-03
PB  - International Joint Conferences on Artificial Intelligence
PY  - 2003
SP  - 1526
EP  - -1
UR  - https://ijcai.org/proceedings/2003/261
ER  -