By Topic

State aggregation for solving Markov decision problems an application to mobile robotics

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Laroche, P. ; LORIA, Inst. Nat. de Recherche en Inf. et Autom., Vamdoeuvre-les-Nancy, France ; Charpillet, F.

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 intractable for problems necessitating a large number of states, such as our robotics application. The use of aggregation techniques allows to reduce the number of states and our methods give nearly optimal plans in a significantly reduced time

Published in:

Tools with Artificial Intelligence, 1998. Proceedings. Tenth IEEE International Conference on

Date of Conference:

10-12 Nov 1998