Complexity Results for HTN Planning

Loading...
Thumbnail Image

Files

CS-TR-3240.ps (290.55 KB)
No. of downloads: 136
CS-TR-3240.pdf (286.11 KB)
No. of downloads: 773

Publication or External Link

Date

1998-10-15

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)

Notes

Rights