This 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. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Liew, M., & White, L. B. (2007). Concurrent temporal planning using timed Petri nets - Policy evaluation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4830 LNAI, pp. 727–731). Springer Verlag. https://doi.org/10.1007/978-3-540-76928-6_83
Mendeley helps you to discover research relevant for your work.