Continuous Probabilistic Mapping by Autonomous Robots
Conference Paper, Proceedings of 6th International Symposium on Experimental Robotics (ISER '99), pp. 275 - 286, March, 1999
Abstract
In this paper, we present a new approach for continuous probabilistic mapping. The objective is to build metric maps of unknown environments through cooperation between multiple autonomous mobile robots. The approach is based on a Bayesian update rule that can be used to integrate the range sensing data coming from multiple sensors on multiple robots. In addition, the algorithm is fast and computationally inexpensive so that it can be implemented on small robots with limited computation resources. The paper describes the algorithm and illustrates it with experiments in simulation and on real robots.
BibTeX
@conference{Salido-Tercero-1999-14869,author = {Jesus Salido-Tercero and Chris Paredis and Pradeep Khosla},
title = {Continuous Probabilistic Mapping by Autonomous Robots},
booktitle = {Proceedings of 6th International Symposium on Experimental Robotics (ISER '99)},
year = {1999},
month = {March},
pages = {275 - 286},
}
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.