Bayesian Landmark Learning for Mobile Robot Localization

164Citations
Citations of this article
133Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

To operate successfully in indoor environments, mobile robots must be able to localize themselves. Most current localization algorithms lack flexibility, autonomy, and often optimality, since they rely on a human to determine what aspects of the sensor data to use in localization (e.g., what landmarks to use). This paper describes a learning algorithm, called BaLL, that enables mobile robots to learn what features/landmarks are best suited for localization, and also to train artificial neural networks for extracting them from the sensor data. A rigorous Bayesian analysis of probabilistic localization is presented, which produces a rational argument for evaluating features, for selecting them optimally, and for training the networks that approximate the optimal solution. In a systematic experimental study, BaLL outperforms two other recent approaches to mobile robot localization.

Cite

CITATION STYLE

APA

Thrun, S. (1998). Bayesian Landmark Learning for Mobile Robot Localization. Machine Learning, 33(1), 41–76. https://doi.org/10.1023/A:1007554531242

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free