Decentralized Localization of Sparsely-Communicating Robot Networks: A Centralized-Equivalent Approach
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
Finite-range sensing and communication are factors in the connectivity of a dynamic mobile-robot network. State estimation becomes a difficult problem when communication connections allowing information exchange between all robots are not guaranteed. This paper presents a decentralized state-estimation algorithm guaranteed to work in dynamic robot networks without connectivity requirements. We prove that a robot only needs to consider its own knowledge of network topology in order to produce an estimate equivalent to the centralized state estimate whenever possible while ensuring that the same can be performed by all other robots in the network. We prove certain properties of our technique and then it is validated through simulations. We present a comprehensive set of results, indicating the performance benefit in different network connectivity settings, as well as the scalability of our approach.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Consensus and Cooperation in Networked Multi-Agent Systems
Olfati-Saber, R., Fax, J. A., & Murray, R. M. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887293 · Cited by 10,522 · cited 1×
“To provide an insight to the scalability of our approach, we will examine how the number of robots, communication range, and the size of the workspace affects localization performance.”
BackgroundOn Physically Similar Systems; Illustrations of the Use of Dimensional Equations
Buckingham, E. (1914) · Physical Review · doi:10.1103/physrev.4.345 · Cited by 3,588
Coordinated multi-robot exploration
Burgard, W., Moors, M., Stachniss, C., & Schneider, F. E. (2005) · IEEE Transactions on Robotics · doi:10.1109/tro.2004.839232 · Cited by 1,177
Distributed maximum a posteriori estimation for multi-robot cooperative localization
Nerurkar, E. D., Roumeliotis, S. I., & Martinelli, A. (2009) · 2009 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2009.5152398 · Cited by 233
Cited by
Perception, Planning, Control, and Coordination for Autonomous Vehicles
Pendleton, S., Andersen, H., Du, X., Shen, X., Meghjani, M., Eng, Y., Rus, D., & Ang, M. (2017) · Machines · doi:10.3390/machines5010006 · Cited by 657
Multiple-Robot Simultaneous Localization and Mapping: A Review
Saeedi, S., Trentini, M., Seto, M., & Li, H. (2016) · Journal of Field Robotics · doi:10.1002/rob.21620 · Cited by 324
Distributed Consensus on Robot Networks for Dynamically Merging Feature-Based Maps
Aragues, R., Cortes, J., & Sagues, C. (2012) · IEEE Transactions on Robotics · doi:10.1109/tro.2012.2192012 · Cited by 119
Collaborative localization with heterogeneous inter-robot measurements by Riemannian optimization
Knuth, J., & Barooah, P. (2013) · 2013 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2013.6630774 · Cited by 34
Metadata
- Authors
- Leung, K. Y. K., Barfoot, T. D., & Liu, H.
- Venue
- IEEE Transactions on Robotics
- Published
- 2010-02
- Volume
- 26
- Issue
- 1
- Pages
- 62-77
- ISSN
- 1552-3098 (ISSN-L)
- 1941-0468
- OpenAlex
- W2096300742
- Cited by
- 106
- References
- 4
- FWCI
- 12.01
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Decentralized Localization of Sparsely-Communicating Robot Networks: A Centralized-Equivalent Approach. https://app.cochat.ai/papers/10.1109/tro.2009.2035741
- The paper
- Leung, K. Y. K., Barfoot, T. D., & Liu, H. (2010). Decentralized Localization of Sparsely-Communicating Robot Networks: A Centralized-Equivalent Approach. IEEE Transactions on Robotics. https://doi.org/10.1109/tro.2009.2035741
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.