Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/53703
Citations | ||
Scopus | Web of ScienceĀ® | Altmetric |
---|---|---|
?
|
?
|
Type: | Journal article |
Title: | Planning without state space explosion: Petri net to Markov decision process |
Author: | Naguleswaran, S. White, L. |
Citation: | International Transactions in Operational Research, 2009; 16(2):243-255 |
Publisher: | Wiley-Blackwell Publishing Ltd |
Issue Date: | 2009 |
ISSN: | 0969-6016 1475-3995 |
Statement of Responsibility: | Sanjeev Naguleswaran and Langford B. White |
Abstract: | <jats:title>Abstract</jats:title><jats:p>This paper explores the construction of a Markov decision process (MDP) from a predicate transition net representation of a planning problem, which can be optimised using dynamic programming methods. The construction methodology alleviates the problem of state space explosion.</jats:p> |
Keywords: | automated planning Markov decision processes Petri nets dynamic programming shortest path problem |
DOI: | 10.1111/j.1475-3995.2009.00674.x |
Published version: | http://dx.doi.org/10.1111/j.1475-3995.2009.00674.x |
Appears in Collections: | Aurora harvest 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.