Robust Motion Planning using Markov Decision Processes and Quadtree Decomposition - Archive ouverte HAL Access content directly
Conference Papers Year : 2004

Robust Motion Planning using Markov Decision Processes and Quadtree Decomposition

(1) , (1) , (1)
1

Abstract

To reach a given goal, a mobile robot first computes a motion plan (ie a sequence of actions that will take it to its goal), and then executes it. Markov Decision Processes (MDPs) have been successfully used to solve these two problems. Their main advantage is that they provide a theoretical framework to deal with the uncertainties related to the robot's motor and perceptive actions during both planning and execution stages. This paper describes a MDP-based planning method that uses a hierarchic representation of the robot's state space (based on a quadtree decomposition of the environment). Besides, the actions used better integrate the kinematic constraints of a wheeled mobile robot. These two features yield a motion planner more efficient and better suited to plan robust motion strategies.
Fichier principal
Vignette du fichier
papier.pdf (469.62 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00182070 , version 1 (24-10-2007)

Identifiers

  • HAL Id : inria-00182070 , version 1

Cite

Julien Burlet, Olivier Aycard, Thierry Fraichard. Robust Motion Planning using Markov Decision Processes and Quadtree Decomposition. Proc. of the IEEE Int. Conf. on Robotics and Automation, Apr 2004, New Orleans, LA (US), France. pp.2820--2825. ⟨inria-00182070⟩
135 View
1024 Download

Share

Gmail Facebook Twitter LinkedIn More