ML Anthology

HTN Planning: Complexity and Expressivity

Kutluhan Erol, James A. Hendler, Dana S. Nau
AAAI 1994 pp. 1123-1128
/aaai/1994/erol1994aaai-htn/

Abstract

Most practical work on AI planning systems during the last fifteen years has been based on hierarchical task network (HTN) decomposition, but until now, there has been very little analytical work on the properties of HTN planners. This paper describes how the complexity of HTN planning varies with various conditions on the task networks.

PDF AAAI Semantic Scholar

Cite

Text

Erol et al. "HTN Planning: Complexity and Expressivity." AAAI Conference on Artificial Intelligence, 1994.

Markdown

[Erol et al. "HTN Planning: Complexity and Expressivity." AAAI Conference on Artificial Intelligence, 1994.](https://mlanthology.org/aaai/1994/erol1994aaai-htn/)

BibTeX

@inproceedings{erol1994aaai-htn,
  title     = {{HTN Planning: Complexity and Expressivity}},
  author    = {Erol, Kutluhan and Hendler, James A. and Nau, Dana S.},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {1994},
  pages     = {1123-1128},
  url       = {https://mlanthology.org/aaai/1994/erol1994aaai-htn/}
}