A Simulation-based Approach for Solving Generalized Semi-Markov Decision Processes

Time is a crucial variable in planning and often requires special attention since it introduces a specific structure along with additional complexity, especially in the case of decision under uncertainty. In this paper, after reviewing and comparing MDP frameworks designed to deal with temporal problems, we focus on Generalized Semi-Markov Decision Processes (GSMDP) with observable time. We highlight the inherent structure and complexity of these problems and present the differences with classical reinforcement learning problems. Finally, we introduce a new simulation-based reinforcement learning method for solving GSMDP, bringing together results from simulation-based policy iteration, regression techniques and simulation theory. We illustrate our approach on a subway network control example.

Authors

• Emmanuel Rachelson
• Gauthier Quesnel
• Frédérick Garçia
• Patrick Fabiani

Keywords

No keywords are indexed for this paper.