The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Pairwise Consistent Measurement Set Maximization for Robust Multi-Robot Map Merging
Abstract
This paper reports on a method for robust selection of inter-map loop closures in multi-robot simultaneous localization and mapping (SLAM). Existing robust SLAM methods assume a good initialization or an “odometry backbone” to classify inlier and outlier loop closures. In the multi-robot case, these assumptions do not always hold. This paper presents an algorithm called Pairwise Consistency Maximization (PCM) that estimates the largest pairwise internally consistent set of measurements. Finding the largest pairwise internally consistent set can be transformed into an instance of the maximum clique problem from graph theory, and by leveraging the associated literature it can be solved in realtime. This paper evaluates how well PCM approximates the combinatorial gold standard using simulated data. It also evaluates the performance of PCM on synthetic and real-world data sets in comparison with DCS, SCGP, and RANSAC, and shows that PCM significantly outperforms these methods.
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
Multiple View Geometry in Computer Vision
Hartley, R., & Zisserman, A. (2004) · doi:10.1017/cbo9780511811685 · Cited by 21,070
Past, Present, and Future of Simultaneous Localization and Mapping: Toward the Robust-Perception Age
Cadena, C., Carlone, L., Carrillo, H., Latif, Y., Scaramuzza, D., Neira, J., Reid, I., & Leonard, J. J. (2016) · IEEE Transactions on Robotics · doi:10.1109/tro.2016.2624754 · Cited by 3,596
iSAM: Incremental Smoothing and Mapping
Kaess, M., Ranganathan, A., & Dellaert, F. (2008) · IEEE Transactions on Robotics · doi:10.1109/tro.2008.2006706 · Cited by 1,076
University of Michigan North Campus long-term vision and lidar dataset
Carlevaris-Bianco, N., Ushani, A. K., & Eustice, R. M. (2016) · The International Journal of Robotics Research · doi:10.1177/0278364915614638 · Cited by 576
Self-citationInference on networks of mixtures for robust robot mapping
Olson, E., & Agarwal, P. (2013) · The International Journal of Robotics Research · doi:10.1177/0278364913479413 · Cited by 252
Towards a robust back-end for pose graph SLAM
Sunderhauf, N., & Protzel, P. (2012) · 2012 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2012.6224709 · Cited by 198
Cited by
(2020) · doi:10.1109/icra40945.2020.9196885 · Cited by 633
Yang, H., Antonante, P., Tzoumas, V., & Carlone, L. (2020) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2020.2965893 · Cited by 325
Kimera-Multi: Robust, Distributed, Dense Metric-Semantic SLAM for Multi-Robot Systems
Tian, Y., Chang, Y., Herrera Arias, F., Nieto-Granda, C., How, J. P., & Carlone, L. (2022) · IEEE Transactions on Robotics · doi:10.1109/tro.2021.3137751 · Cited by 288
Kimera: From SLAM to spatial perception with 3D dynamic scene graphs
Rosinol, A., Violette, A., Abate, M., Hughes, N., Chang, Y., Shi, J., Gupta, A., & Carlone, L. (2021) · The International Journal of Robotics Research · doi:10.1177/02783649211056674 · Cited by 271
Tsintotas, K. A., Bampis, L., & Gasteratos, A. (2022) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2022.3175656 · Cited by 175
“, via robust pose-graph optimization [289]–[292].”
Metadata
- Authors
- Mangelson, J. G., Dominic, D., Eustice, R. M., & Vasudevan, R.
- Venue
- 2018 IEEE International Conference on Robotics and Automation (ICRA)
- Publisher
- IEEE
- Published
- 2018-05
- Pages
- 2916-2923
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W2891820683
- Cited by
- 202
- References
- 6
- FWCI
- 27.67
- Type
- conference paper
- 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: Pairwise Consistent Measurement Set Maximization for Robust Multi-Robot Map Merging. https://app.cochat.ai/papers/10.1109/icra.2018.8460217
- The paper
- Mangelson, J. G., Dominic, D., Eustice, R. M., & Vasudevan, R. (2018). Pairwise Consistent Measurement Set Maximization for Robust Multi-Robot Map Merging. 2018 IEEE International Conference on Robotics and Automation (ICRA). https://doi.org/10.1109/icra.2018.8460217
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.