Please use this identifier to cite or link to this item:
Full metadata record
|dc.identifier.citation||Proceedings of the 20th IJCAI-07, 2007 / pp.1-8||en|
|dc.description.abstract||The factored state representation and concurrency semantics of Petri nets are closely related to those of concurrent planning domains, yet planning and Petri net analysis have developed independently, with minimal and usually unconvincing attempts at cross-fertilisation. In this paper, we investigate and exploit the relationship between the two areas, focusing on Petri net unfolding, which is an attractive reachability analysis method as it naturally enables the recognition and separate resolution of independent subproblems. On the one hand, based on unfolding, we develop a new forward search method for cost-optimal partial-order planning which can be exponentially more efficient than state space search. On the other hand, inspired by well-known planning heuristics, we investigate the automatic generation of heuristics to guide unfolding, resulting in a more efficient, directed reachability analysis tool for Petri nets.||en|
|dc.description.statementofresponsibility||Sarah Hickmott, Jussi Rintanen, Sylvie Thiébaux, Lang White||en|
|dc.title||Planning via petri net unfolding||en|
|dc.contributor.conference||International Joint Conference on Artificial Intelligence (20th : 2007 : Hyderabad, India)||en|
|pubs.library.collection||Electrical and Electronic Engineering publications||en|
|dc.identifier.orcid||White, L. [0000-0001-6660-0517]||en|
|Appears in Collections:||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.