inria-00101093, version 1
A New Decomposition Technique for Solving Markov Decision Processes
Symposium on Applied Computing - SAC'2001 (2001) 5 p
Résumé : In this paper, we present a new tool for automatically solving Markov Decision Processes. Using a predefined partition o fthe 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 using 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 implementation.
- a – UNIVERSITE DE METZ
- b – UNIVERSITE NANCY 2
- 1 :
- Université Paul Verlaine - Metz
- 2 :
- INRIA – CNRS : UMR7503 – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine (INPL)
- 3 :
- INRIA – CNRS : UMR7503 – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine (INPL)
- 4 :
- CNRS : UMR7502 – INRIA – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine (INPL)
- Domaine : Informatique/Autre
- Mots-clés : planning under uncertainty – markov decision process – decomposition – parallelism || plannification sous incertitude – mdp – parallélisme
- Référence interne : A01-R-107 || laroche01a
- Commentaire : Colloque avec actes et comité de lecture. internationale.
- inria-00101093, version 1
- http://hal.inria.fr/inria-00101093
- oai:hal.inria.fr:inria-00101093
- Contributeur :
- Soumis le : Mardi 26 Septembre 2006, 14:56:27
- Dernière modification le : Lundi 11 Juin 2007, 15:37:31


Exporter