Reduced MDP representation of a logistical planning problem using petri-nets

Authors:
Sanjeev Naguleswaran;Sarah L. Hickmott;Langford B. White
Affiliations:
National ICT Australia and School of Electrical and Electronic Engineering, University of Adelaide, Australia;National ICT Australia and School of Electrical and Electronic Engineering, University of Adelaide, Australia;National ICT Australia and School of Electrical and Electronic Engineering, University of Adelaide, Australia
Venue:
AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
Year:
2005

Citing 6
Cited 0

A Predicate-Transition Net Model for Parallel Interpretation of Logic Programs

IEEE Transactions on Software Engineering
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)
An Improvement of McMillan's Unfolding Algorithm

Formal Methods in System Design
Parallelisation of the Petri Net Unfolding Algorithm

TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Towards an Efficient Algorithm for Unfolding Petri Nets

CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Branching processes of high-level Petri nets

TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a method for unfolding a Predicate-net representation of a logistical planning problem, such that it possesses the Markov property. The problem can then be easily converted into a Markov Decision Process (MDP) which can be solved in a tractable manner using standard Dynamic Programming algorithms.