Show simple item record

dc.contributor.authorYaman, Fusunen_US
dc.contributor.authorNau, Dana S.en_US
dc.date.accessioned2004-05-31T23:23:55Z
dc.date.available2004-05-31T23:23:55Z
dc.date.created2002-12en_US
dc.date.issued2002-12-19en_US
dc.identifier.urihttp://hdl.handle.net/1903/1246
dc.description.abstractIn this paper we present a formalism for explicitly representing time in HTN planning. Actions can have durations and intermediate effects in this formalism. Methods can specify qualitative and quantitative temporal constraints on decompositions. Based on this formalism we defined a planning algorithm TimeLine that can produce concurrently executable plans in the presence of numeric state variables. We state and prove the soundness of the algorithm. We also present the experimental results of the TimeLine implementation that shows the feasibility of our approach. UMIACS-TR-2002-105en_US
dc.format.extent78867 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-4427en_US
dc.relation.ispartofseriesUMIACS; UMIACS-TR-2002-105en_US
dc.titleAn HTN Planner That can Reason About Timeen_US
dc.typeTechnical Reporten_US
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtUMIACS Technical Reportsen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record