GraphMDP: A New Decomposition Tool for Solving Markov Decision Processes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles International Journal on Artificial Intelligence Tools Year : 2001

GraphMDP: A New Decomposition Tool for Solving Markov Decision Processes

Pierre Laroche

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.
Not file

Dates and versions

inria-00100821 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00100821 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More