Optimal Strategies for Mobile Robots Based on the Cross-Entropy Algorithm

This paper deals with the problem of optimizing the navigation of an intelligent mobile with respect to the maximization of the performance of the localization algorithm used during execution. It is assumed that a known map composed of features describing natural landmarks in the environment is give...

Full description

Saved in:
Bibliographic Details
Published in2006 16th IEEE Signal Processing Society Workshop on Machine Learning for Signal Processing pp. 331 - 336
Main Authors Celeste, F., Dambreville, F., Le Cadre, J.-P.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.09.2006
Subjects
Dynamic programming
Filters
Intelligent robots
Intelligent sensors
Mobile robots
Navigation
Optimal control
Position measurement
Stress
Vehicles
Online AccessGet full text

Cover

More Information
Summary:This paper deals with the problem of optimizing the navigation of an intelligent mobile with respect to the maximization of the performance of the localization algorithm used during execution. It is assumed that a known map composed of features describing natural landmarks in the environment is given. The vehicle is also equipped with a range and bearing sensor to interact with its environment. The measurements are associated with the map to estimate its position. The main goal is to design an optimal path which guarantees the control of a measure of the performance of the map-based localization filter. Thus, a functional of the approximate Posterior Cramer-Rao Bound is used. However, due to the functional properties, classical techniques such as Dynamic Programming is generally not usable. To face that, we investigate a learning approach based on the Cross-Entropy method to stress globally the optimization problem.
ISBN:9781424406562
1424406560
ISSN:1551-2541
2378-928X
DOI:10.1109/MLSP.2006.275570