TY - GEN
T1 - Markov decision processes from colored Petri nets
AU - Eboli, Monica Góes
AU - Cozman, Fabio Gagliardi
PY - 2010/12/14
Y1 - 2010/12/14
N2 - Models that are suitable for planning are not always easy to specify. In this paper we investigate the conversion of Petri nets into factored Markov decision processes: the former are relatively easy to build while the latter are adequate for policy generation. To represent probabilities that are needed when planning under uncertainty, we introduce factored Petri nets; we then describe the conversion of factored Petri nets in Markov decision processes. © 2010 Springer-Verlag.
AB - Models that are suitable for planning are not always easy to specify. In this paper we investigate the conversion of Petri nets into factored Markov decision processes: the former are relatively easy to build while the latter are adequate for policy generation. To represent probabilities that are needed when planning under uncertainty, we introduce factored Petri nets; we then describe the conversion of factored Petri nets in Markov decision processes. © 2010 Springer-Verlag.
UR - https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=78649967766&origin=inward
UR - https://www.scopus.com/inward/citedby.uri?partnerID=HzOxMe3b&scp=78649967766&origin=inward
U2 - 10.1007/978-3-642-16138-4_8
DO - 10.1007/978-3-642-16138-4_8
M3 - Conference contribution
SN - 3642161375
SN - 9783642161377
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 72
EP - 81
BT - Markov decision processes from colored Petri nets
T2 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Y2 - 1 January 2018
ER -