Skip to Main content Skip to Navigation
Journal articles

GraphMDP: A New Decomposition Tool for Solving Markov Decision Processes

Pierre Laroche 1
1 MAIA - Autonomous intelligent machine
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In this paper, we present a new tool for solving weakly-coupled Markov Decision Processes using decomposition techniques. Using a predefined partition of the MDP, a directed graph is built to decompose the global MDP into small local MDPs which are independently solved. An approximate solution for the global MDP is obtained by combining local solutions. Our approach has been tested on a mobile robotics application. It allows near-optimal solutions to be obtained in significantly reduced time. We also present preliminary results concerning a parallel implantation of our tool.
Document type :
Journal articles
Complete list of metadata
Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 2:51:40 PM
Last modification on : Friday, February 26, 2021 - 3:28:04 PM


  • HAL Id : inria-00100821, version 1



Pierre Laroche. GraphMDP: A New Decomposition Tool for Solving Markov Decision Processes. International Journal on Artificial Intelligence Tools, World Scientific Publishing, 2001, 10 (3), pp.325-343. ⟨inria-00100821⟩



Record views