A monte carlo algorithm for multi-robot localization

March 1999

A monte carlo algorithm for multi-robot localization

Authors:

Dieter Fox, W. Burgard, H. Kruppa, and Sebastian Thrun
Technical Report
CMU-CS-99-120

Abstract:

This paper presents a statistical algorithm for collaborative mobile robot localization. Our approach uses a sample-based version of Markov localization, capable of localizing mobile robots in an any-time fashion. When teams of robots localize themselves in the same environment, probabilistic methods are employed to synchronize each robot's belief whenever one robot detects another. As a result, the robots localize themselves faster, maintain higher accuracy, and high-cost sensors are amortized across multiple robot platforms. The paper also describes experimental results obtained using two mobile robots, using computer vision and laser range finding for detecting each other and estimating each other's relative location. The results, obtained in an indoor office environment, illustrate drastic improvements in localization speed and accuracy when compared to conventional single-robot localization.
@techreport{Fox-1999-16635,
author = {Dieter Fox And W. Burgard And H. Kruppa And Sebastian Thrun},
title = {A monte carlo algorithm for multi-robot localization},
year = {1999},
month = {March},
institute = {Carnegie Mellon University},
address = {Pittsburgh, PA},
number = {CMU-CS-99-120},
}
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.