Semantics for Hierarchical Task-Network Planning

Simple item page
dc.contributor.authorErol, Kutluhanen_US
dc.contributor.authorHendler, James A.en_US
dc.contributor.authorNau, Dana S.en_US
dc.contributor.departmentISRen_US
dc.date.accessioned2007-05-23T09:58:30Z
dc.date.available2007-05-23T09:58:30Z
dc.date.issued1995en_US
dc.description.abstractOne big obstacle to understanding the nature of hierarchical task network (HTN) planning has been the lack of a clear theoretical framework. In particular, no one has yet presented a clear and concise HTN algorithm that is sound and complete. In this paper, we present a formal syntax and semantics for HTN planning. Based on this syntax and semantics, we are able to define an algorithm for HTN planning and prove it sound and complete. We also develop several definitions of expressivity for planning languages and prove that HTN planning is strictly more expressive than STRIPS- style planning according to those definitions.<P>en_US
dc.format.extent1548405 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/5604
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1995-9en_US
dc.subjectalgorithmsen_US
dc.subjectknowledge representationen_US
dc.subjectplanningen_US
dc.subjectSystems Integration Methodologyen_US
dc.titleSemantics for Hierarchical Task-Network Planningen_US
dc.typeTechnical Reporten_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR_95-9.pdf
Size:
1.48 MB
Format:
Adobe Portable Document Format
Download

Collections

Institute for Systems Research Technical Reports