Factored Planning

Amir, Eyal; Engelhardt, Barbara

Factored Planning

Download BibTeX Cite

Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Pages 929-934.

Abstract

We present a general-purpose method for dynamically factoring a planning domain, whose structure is then exploited by our generic planning method to find sound and complete plans. The planning algorithm's time complexity scales linearly with the size of the domain, and at worst exponentially with the size of the largest subdomain and interaction between subdomains. The factorization procedure divides a planning domain into subdomains that are organized in a tree structure such that interaction between neighboring subdomains in the tree is minimized. The combined planning algorithm is sound and complete, and we demonstrate it on a representative planning domain. The algorithm appears to scale to very large problems regardless of the black box planner used.

Eyal Amir, and Barbara Engelhardt. 2003. Factored Planning. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI-03. IJCAI, 929–934. https://ijcai.org/proceedings/2003/133

@inproceedings{ijcai2003p133,
  title     = {Factored Planning},
  author    = {Amir, Eyal and Engelhardt, Barbara},
  booktitle = {Proceedings of the Eighteenth International Joint Conference on
               Artificial Intelligence, {IJCAI-03}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Georg Gottlob},
  pages     = {929--934},
  year      = {2003},
  url       = {https://ijcai.org/proceedings/2003/133},
}

TY  - CPAPER
TI  - Factored Planning
AU  - Amir, Eyal
AU  - Engelhardt, Barbara
T2  - Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI-03
PB  - International Joint Conferences on Artificial Intelligence
PY  - 2003
SP  - 929
EP  - 934
UR  - https://ijcai.org/proceedings/2003/133
ER  -