Complexity Results for HTN Planning

Loading...
Thumbnail Image

Files

TR_95-10.pdf (1.46 MB)
No. of downloads: 632

Publication or External Link

Date

1995

Advisor

Citation

DRUM DOI

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, and how it compares to STRIPS- style planning.

Notes

Rights