HTN planning: Complexity and expressivity (1994)
by
Kutluhan Erol
,
James Hendler
,
Dana S. Nau
| Venue: | In AAAI-94 |
| Citations: | 209 - 13 self |
BibTeX
@INPROCEEDINGS{Erol94htnplanning:,
author = {Kutluhan Erol and James Hendler and Dana S. Nau},
title = {HTN planning: Complexity and expressivity},
booktitle = {In AAAI-94},
year = {1994}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Most practical work on AI planning systems during the last fteen 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.
