Mobile Robotics Planning using Abstract Markov Decision Processes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1999

Mobile Robotics Planning using Abstract Markov Decision Processes


Markov Decision Processes have been successfully used in robotics for indoor robot navigation problems. They allow to compute optimal sequences of actions in order to achieve a given goal, accounting for actuators uncertainties. But MDPs are weak to avoid unknown obstacles. At the opposite reactive navigators are particulary a dapted to that, and don't need any prior knowledge about the environment. But they are unable to plan the set of actions that will permit the realization of a given mission. We present a new state aggregation technique for Markov Decision Processes, such that part of the work usually dedicated to the planner is achieved by a reactive navigator. Thus some characteristics of our environments, such as width of corridors, have not to be considered, which allows to cluster states together, si gnificantly reducing the state space. As a consequence, policies are computed faster and are shown to be at least as efficient as optimal ones.
No file

Dates and versions

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


  • HAL Id : inria-00098843 , version 1


Pierre Laroche, François Charpillet, René Schott. Mobile Robotics Planning using Abstract Markov Decision Processes. International Conference on Tools with Artificial Intelligence - ICTAI'99, IEEE Computer Society, 1999, Chicago, Illinois, pp.299-306. ⟨inria-00098843⟩
102 View
0 Download


Gmail Facebook Twitter LinkedIn More