Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/28547
Citations | ||
Scopus | Web of ScienceĀ® | Altmetric |
---|---|---|
?
|
?
|
Type: | Conference paper |
Title: | Reduced MDP representation of a logistical planning problem using petri-nets |
Author: | Naguleswaran, S. Hickmott, S. White, L. |
Citation: | Al 2005 : advances in artificial intelligence : 18th Australian joint conference on artificial intelligence, Sydney, Australia, December 5-9, 2005 : proceedings / Shichao Zhang, Ray Jarvis (eds.), pp. 830-833 |
Publisher: | Springer |
Publisher Place: | Berlin Heidelberg |
Issue Date: | 2005 |
Series/Report no.: | Lecture notes in computer science ; 3809 |
ISBN: | 3540304622 9783540304623 |
ISSN: | 0302-9743 1611-3349 |
Conference Name: | Australian Joint Conference on Artificial Intelligence (18th : 2005 : Sydney, Australia) |
Editor: | Zhang, S. Jarvis, R. |
Statement of Responsibility: | Sanjeev Naguleswaran, Sarah L. Hickmott and Langford B. White |
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. |
Description: | The original publication is available at www.springerlink.com |
DOI: | 10.1007/11589990_90 |
Published version: | http://www.springerlink.com/content/y8x60m6412348086/ |
Appears in Collections: | Aurora harvest 2 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.