State Aggregation for Solving Markov Decision Problems - An Application to Mobile Robotics - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1998

State Aggregation for Solving Markov Decision Problems - An Application to Mobile Robotics

Pierre Laroche

Abstract

In this paper, we present two state aggregation methods, used to build stochastic plans, modelling our environment with Markov Decision Processes. Classical methods used to compute stochastic plans are highly untractable for problems necessiting a large number of states, like our robotics application. The use of aggregation techniques allows to reduce the number of states to take into account, and our methods give nearly optimal plans in a significantly reduced time.
Not file

Dates and versions

inria-00098464 , version 1 (25-09-2006)

Identifiers

  • HAL Id : inria-00098464 , version 1

Cite

Pierre Laroche, François Charpillet. State Aggregation for Solving Markov Decision Problems - An Application to Mobile Robotics. IEEE International Conference Tools with Artificial Intelligence - ICTAI'98, 1998, none, 8 p. ⟨inria-00098464⟩
84 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More