A Probabilistic Approach to Concurrent Mapping and Localization for Mobile Robots
Journal Article, Machine Learning, Vol. 31, No. 1, pp. 29 - 53, April, 1998
Abstract
This paper addresses the problem of building large-scale geometric maps of indoor environments with mobile robots. It poses the map building problem as a constrained, probabilistic maximum-likelihood estimation problem. It then devises a practical algorithm for generating the most likely map from data, along with the most likely path taken by the robot. Experimental results in cyclic environments of size up to 80 by 25 meter illustrate the appropriateness of the approach.
Notes
also, Autonomous Robots 5, 253 - 271
also, Autonomous Robots 5, 253 - 271
BibTeX
@article{Thrun-1998-16585,author = {Sebastian Thrun and Dieter Fox and W. Burgard},
title = {A Probabilistic Approach to Concurrent Mapping and Localization for Mobile Robots},
journal = {Machine Learning},
year = {1998},
month = {April},
volume = {31},
number = {1},
pages = {29 - 53},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.