Recursive decentralized collaborative localization for sparsely communicating robots

37Citations
Citations of this article
50Readers
Mendeley users who have this article in their library.

Abstract

This paper provides a new fully-decentralized algorithm for Collaborative Localization based on the extended Kalman filter. The major challenge in decentralized collaborative localization is to track inter-robot dependencies - which is particularly difficult in situations where sustained synchronous communication between robots cannot be guaranteed. Current approaches suffer from the need for particular communication schemes, extensive bookkeeping of measurements, overlyconservative assumptions, or the restriction to specific measurement models. To the best of our knowledge, the algorithm we propose in this paper is the first one that tracks interrobot correlations while fulfilling all of the following relevant conditions: communication is limited to two robots that obtain a relative measurement, the algorithm is recursive in the sense that it does not require storage of measurements and each robot maintains only the latest estimate of its own pose, and it supports generic measurement models. These particularly hard conditions make the approach applicable to a wide range of multi-robot applications. Extensive experiments carried out using real world datasets demonstrate the improved performance of our method compared to several existing approaches.

Cite

CITATION STYLE

APA

Luft, L., Schubert, T., Roumeliotis, S. I., & Burgard, W. (2016). Recursive decentralized collaborative localization for sparsely communicating robots. In Robotics: Science and Systems (Vol. 12). MIT Press Journals. https://doi.org/10.15607/rss.2016.xii.016

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