Markov Decision Processes from Colored Petri Nets

摘要

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.