Decomposition of Markov Decision Processes Using Directed Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1999

Decomposition of Markov Decision Processes Using Directed Graphs

Abstract

Decomposing an MDP consists in (1) partitioning the state space into regions; (2) solving each region independently; (3) combining the local solutions to generate a global one. In our approach, domain characteristics are used to accurately define how region communicates with each others, which is very important to ensure good quality of the approximate policies obtained. We apply it to mobile robotics planning in indoor environments.
Fichier principal
Vignette du fichier
99-R-250.pdf (193.94 Ko) Télécharger le fichier

Dates and versions

inria-00107799 , version 1 (19-10-2006)

Identifiers

  • HAL Id : inria-00107799 , version 1

Cite

Pierre Laroche, François Charpillet, René Schott. Decomposition of Markov Decision Processes Using Directed Graphs. Poster Session of European Conference on Planning, 1999, Durham, UK, 2 p. ⟨inria-00107799⟩
153 View
101 Download

Share

Gmail Facebook Twitter LinkedIn More