Complexity Results for HTN Planning
Complexity Results for HTN Planning
Files
Publication or External Link
Date
1998-10-15
Authors
Erol, Kutluhan
Hendler, James
Nau, Dana S.
Advisor
Citation
DRUM DOI
Abstract
(Also cross-referenced as ISR-TR-95-10)
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, and how it
compares to STRIPS-style planning.
(Also cross-referenced as UMIACS-TR-94-32)