Premium
Planning without state space explosion: Petri net to Markov decision process
Author(s) -
Naguleswaran Sanjeev,
White Langford B.
Publication year - 2009
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/j.1475-3995.2009.00674.x
Subject(s) - markov decision process , computer science , partially observable markov decision process , petri net , state space , markov process , markov chain , mathematical optimization , state (computer science) , stochastic petri net , dynamic programming , predicate (mathematical logic) , mathematics , markov model , algorithm , machine learning , programming language , statistics
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.