Consistent data association in multi-robot systems with limited communications
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
In this paper we address the data association problem of features observed by a robot team with limited communications.At every time instant, each robot can only exchange data with a subset of the robots, its neighbors.Initially, each robot solves a local data association with each of its neighbors.After that, the robots execute the proposed algorithm to agree on a data association between all their local observations which is globally consistent.One inconsistency appears when chains of local associations give rise to two features from one robot being associated among them.The contribution of this work is the decentralized detection and resolution of these inconsistencies.We provide a fully decentralized solution to the problem.This solution does not rely on any particular communication topology.Every robot plays the same role, making the system robust to individual failures.Information is exchanged exclusively between neighbors.In a finite number of iterations, the algorithm finishes with a data association which is free of inconsistent associations.In the experiments, we show the performance of the algorithm under two scenarios.In the first one, we apply the resolution and detection algorithm for a set of stochastic visual maps.In the second, we solve the feature matching between a set of images taken by a robotic team.
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
SURF: Speeded Up Robust Features
Bay, H., Tuytelaars, T., & Van Gool, L. (2006) · Lecture Notes in Computer Science · doi:10.1007/11744023_32 · Cited by 14,955 · cited 1×
“Each robot acquires one image with its onboard camera and extracts SURF features [3].”
MethodSimultaneous localization and mapping (SLAM): part II
Bailey, T., & Durrant-Whyte, H. (2006) · IEEE Robotics & Automation Magazine · doi:10.1109/mra.2006.1678144 · Cited by 2,554
Distributed Multirobot Exploration and Mapping
Fox, D., Ko, J., Konolige, K., Limketkai, B., Schulz, D., & Stewart, B. (2006) · Proceedings of the IEEE · doi:10.1109/jproc.2006.876927 · Cited by 344 · cited 1×
“Then, the data association is solved like in a single robot scenario, using scan matching and ICP for laser scans [14], [10], [16], [20], or NN, ML, and visual methods for feature-based maps [12], [17].”
Method
Cited by
Simultaneous Localization and Mapping: A Survey of Current Trends in Autonomous Driving
Bresson, G., Alsayed, Z., Yu, L., & Glaser, S. (2017) · IEEE Transactions on Intelligent Vehicles · doi:10.1109/tiv.2017.2749181 · Cited by 885
“Similarly, in [228] and [229], a consensus is sought between neighbors so as to find”
DDF-SAM 2.0: Consistent distributed smoothing and mapping
Cunningham, A., Indelman, V., & Dellaert, F. (2013) · 2013 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2013.6631323 · Cited by 171
“This paper assumes known data associations between measurements and landmarks are for both single robot platforms and between robot platforms; for a treatments of data associations between platforms, see [2], [21].”
BackgroundDistributed 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
Metadata
- Authors
- Aragues, R., Montijano, E., & Sagues, C.
- Venue
- Robotics: Science and Systems VI
- Published
- 2010-06-27
- OpenAlex
- W2293984849
- Cited by
- 37
- References
- 3
- FWCI
- 10.22
- Type
- conference paper
- Language
- en
- Open access
- gold
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: Consistent data association in multi-robot systems with limited communications. https://app.cochat.ai/papers/10.15607/rss.2010.vi.013
- The paper
- Aragues, R., Montijano, E., & Sagues, C. (2010). Consistent data association in multi-robot systems with limited communications. Robotics: Science and Systems VI. https://doi.org/10.15607/rss.2010.vi.013
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.