Decomposition of Markov Decision Processes Using Directed Graphs

Pierre Laroche (1) , François Charpillet (1) , René Schott (2)

1 MAIA - Autonomous intelligent machine
2 LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications

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.

Mots clés: planification sous incertitude; planning under uncertainty; markov decision processes; processus décisionnels de markov; décomposition

Domaines: Autre [cs.OH]

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⟩