Concurrent temporal planning using timed Petri nets: policy evaluation

Authors:
Melissa Liew;Langford B. White
Affiliations:
National ICT Australia, School of Electrical and Electronic Engineering, The University of Adelaide, Australia;National ICT Australia, School of Electrical and Electronic Engineering, The University of Adelaide, Australia
Venue:
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Year:
2007

Citing 3
Cited 0

A technique of state space search based on unfolding

Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Automated Planning: Theory & Practice

Automated Planning: Theory & Practice
Planning via Petri net unfolding

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.