Please use this identifier to cite or link to this item: https://hdl.handle.net/2440/44791
Citations
Scopus Web of Science® Altmetric
?
?
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLiew, E.-
dc.contributor.authorWhite, L.-
dc.contributor.editorOrgun, M.-
dc.contributor.editorThornton, J.-
dc.date.issued2007-
dc.identifier.citationAI 2007: Advances in Artificial Intelligence 20th Australian Joint Conference on Artificial Intelligence, Gold Coast, Australia, December 2-6, 2007. Proceedings / pp.727-731-
dc.identifier.isbn9783540769262-
dc.identifier.issn0302-9743-
dc.identifier.issn1611-3349-
dc.identifier.urihttp://hdl.handle.net/2440/44791-
dc.descriptionThe definitive version can be found at www.springerlink.com-
dc.description.abstractThis paper is the first in a series which address the development of a temporal planner using timed Petri net (TPN) models of concurrent temporal plans. Unlike previous work which uses Petri net unfoldings to develop partially ordered plans (in the untimed case), the approach presented here is purely algebraic, and is based on a (min,max,+) discrete event dynamical system description of a TPN. This paper focuses primarily on policy evaluation, with subsequent work detailing how to use this approach for efficient optimal temporal planning.-
dc.description.statementofresponsibilityMelissa Liew and Langford B. White-
dc.language.isoen-
dc.publisherSpringer-
dc.relation.ispartofseriesLECTURE NOTES IN COMPUTER SCIENCE-
dc.rights© Springer-
dc.titleConcurrent temporal planning using timed petri nets - policy evaluation-
dc.typeConference paper-
dc.contributor.conferenceAI 2007: Advances in Artificial Intelligence (2007 : Gold Coast, Australia)-
dc.identifier.doi10.1007/978-3-540-76928-6-
dc.publisher.placeBerlin-
pubs.publication-statusPublished-
dc.identifier.orcidWhite, L. [0000-0001-6660-0517]-
Appears in Collections:Aurora harvest 6
Electrical and Electronic Engineering publications

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.