Complexity Results for HTN Planning

Simple item page
dc.contributor.authorErol, Kutluhanen_US
dc.contributor.authorHendler, James A.en_US
dc.contributor.authorNau, D.S.en_US
dc.contributor.departmentISRen_US
dc.date.accessioned2007-05-23T09:56:41Z
dc.date.available2007-05-23T09:56:41Z
dc.date.issued1994en_US
dc.description.abstractMost practical work on AI planning systems during the last fifteen years has been based on hierarchical task network 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.en_US
dc.format.extent1511028 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/5518
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1994-44en_US
dc.subjectcomputational complexityen_US
dc.subjectknowledge representationen_US
dc.subjectartificial intelligence planning systemsen_US
dc.subjectSystems Integrationen_US
dc.titleComplexity Results for HTN Planningen_US
dc.typeTechnical Reporten_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR_94-44.pdf
Size:
1.44 MB
Format:
Adobe Portable Document Format
Download

Collections

Institute for Systems Research Technical Reports