Towards a robust back-end for pose graph SLAM
The DOI matches its Crossref record; 28 of the 33 references it cites were found in a registry or an index.
Abstract
Current state of the art solutions of the SLAM problem are based on efficient sparse optimization techniques and represent the problem as probabilistic constraint graphs. For example in pose graphs the nodes represent poses and the edges between them express spatial information (e.g. obtained from odometry) and information on loop closures. The task of constructing the graph is delegated to a front-end that has access to the available sensor information. The optimizer, the so called back-end of the system, relies heavily on the topological correctness of the graph structure and is not robust against misplaced constraint edges. Especially edges representing false positive loop closures will lead to the divergence of current solvers. We propose a novel formulation that allows the back-end to change parts of the topological structure of the graph during the optimization process. The back-end can thereby discard loop closures and converge towards correct solutions even in the presence of false positive loop closures. This largely increases the overall robustness of the SLAM system and closes a gap between the sensor-driven front-end and the back-end optimizers. We demonstrate the approach and present results both on large scale synthetic and real-world datasets.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Thrun, S. (2002) · Communications of the ACM · doi:10.1145/504729.504754 · Cited by 7,994 · cited 1×
“, see [30] for an introduction to these methods), optimization-based approaches build upon efficient algorithms for nonlinear optimization that exploit the sparsity inherent in the SLAM problem.”
MethodFactor graphs and the sum-product algorithm
Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486 · cited 1×
“The pose graph SLAM problem can be conveniently modelled as a factor graph [17].”
BackgroundRobust Regression: Asymptotics, Conjectures and Monte Carlo
Huber, P. J. (1973) · The Annals of Statistics · doi:10.1214/aos/1176342503 · Cited by 2,328 · cited 1×
“So called robust cost functions, like the Huber function [12], can reduce the influence of potential outliers.”
BackgroundG2o: A general framework for graph optimization
Kummerle, R., Grisetti, G., Strasdat, H., Konolige, K., & Burgard, W. (2011) · 2011 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2011.5979949 · Cited by 1,982 · cited 6×
“Due to its inherent sparse structure the problem can be solved efficiently with state of the art frameworks like g2o [18] or GTSAM [1] that use iterative solvers such as Gauss-Newton or LevenbergMarquardt.”
BackgroundMethodInfluentialFAB-MAP: Probabilistic Localization and Mapping in the Space of Appearance
Cummins, M., & Newman, P. (2008) · The International Journal of Robotics Research · doi:10.1177/0278364908090961 · Cited by 1,472 · cited 2×
“Furthermore, the front-end part of the system can detect loop closures between two poses xi and xj , for example by a visual place recognition system like [4] or [29].”
BackgroundGlobally Consistent Range Scan Alignment for Environment Mapping
Lu, F., & Milios, E. (1997) · Autonomous Robots · doi:10.1023/a:1008854305733 · Cited by 1,304
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 · cited 3×
“The datasets City and Sphere shipped with the open-source implementation of iSAM [14].”
BackgroundMethodSquare Root SAM: Simultaneous Localization and Mapping via Square Root Information Smoothing
Dellaert, F., & Kaess, M. (2006) · The International Journal of Robotics Research · doi:10.1177/0278364906072768 · Cited by 922 · cited 10×
“1, which shows the results of iSAM [14] version 1.5. for 10 outlier constraints.”
BackgroundInfluentialData association in stochastic mapping using the joint compatibility test
Neira, J., & Tardos, J. D. (2001) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.976019 · Cited by 772 · cited 1×
“Although many of these strategies [2], [4], [15], [23], [25], [27] are appealing and reach high precision and recall measures in several benchmarks, the bottom line is that none of the current approaches can guarantee to always work perfectly and never let a false positive pass.”
BackgroundEfficient Sparse Pose Adjustment for 2D mapping
Konolige, K., Grisetti, G., Kümmerle, R., Burgard, W., Limketkai, B., & Vincent, R. (2010) · 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2010.5649043 · Cited by 395 · cited 2×
“{niko.suenderhauf, peter.protzel}@etit.tu-chemnitz.de iSAM [14] and very recently Sparse Pose Adjustment [16], iSAM2 [13], and g2o [18].”
Background
Research works printed but not linked: 2
- ku?mmerle, 0, G2o: A general framework for graph optimization, Proc of the IEEE Int Conf on Robotics and Automation (ICRA) 2011
- olson, 0, Fast iterative optimization of pose graphs with poor initial estimates, Inl Conf on Robotics and Automation ICRA 2006
Cited by
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
“In the colored box below we provide an example of SLAM for a robot equipped with a monocular camera and a 3D laser scanner.”
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. D., & Leonard, J. J. (2016) · Zurich Open Repository and Archive (University of Zurich) · doi:10.5167/uzh-138892 · Cited by 3,048
Online global loop closure detection for large-scale multi-session graph-based SLAM
Labbe, M., & Michaud, F. (2014) · 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2014.6942926 · Cited by 373
“Some graph optimization approaches such as [22], [23] deal with possible invalid matches, and could be used to increase robustness of the proposed approach.”
MethodSwitchable constraints for robust pose graph SLAM
Sunderhauf, N., & Protzel, P. (2012) · 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2012.6385590 · Cited by 344
“Notice that the system’s feasibility to work on large-scale real-world datasets has been demonstrated before [14].”
BackgroundMethodInfluentialSelf-citationA Survey on Active Simultaneous Localization and Mapping: State of the Art and New Frontiers
Placed, J. A., Strader, J., Carrillo, H., Atanasov, N., Indelman, V., Carlone, L., & Castellanos, J. A. (2023) · IEEE Transactions on Robotics · doi:10.1109/tro.2023.3248510 · Cited by 332
Metadata
- Authors
- Sunderhauf, N., & Protzel, P.
- Affiliations
- Chemnitz University of Technology (DE)
- ORCID
- Protzel, Peter
- Venue
- 2012 IEEE International Conference on Robotics and Automation
- Publisher
- IEEE
- Published
- 2012-05
- Pages
- 1254-1261
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W1991172434
- Cited by
- 198
- References
- 33
- Citations by year
- 2026: 4 · 2025: 10 · 2024: 10 · 2023: 14 · 2022: 19 · 2021: 12 · 2020: 19 · 2019: 13 · 2018: 23 · 2017: 10 · 2016: 12 · 2015: 13 · 2014: 16 · 2013: 13 · 2012: 10
- FWCI
- 30.98
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Proceedings - IEEE International Conference on Robotics and Automation/Proceedings (publishedVersion)
- Funders
- Technische Universität Chemnitz
- Queensland University of Technology
- University of Queensland
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Robotics and Sensor-Based Localization
- Physical Sciences › Computer Science › Artificial Intelligence › Target Tracking and Data Fusion in Sensor Networks
- Physical Sciences › Earth and Planetary Sciences › Geology › 3D Surveying and Cultural Heritage
- Keywords
- pose graph SLAM, back-end optimization, loop closure detection, robust optimization, sparse optimization, topological correctness
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: Towards a robust back-end for pose graph SLAM. https://app.cochat.ai/papers/10.1109/icra.2012.6224709
- The paper
- Sunderhauf, N., & Protzel, P. (2012). Towards a robust back-end for pose graph SLAM. 2012 IEEE International Conference on Robotics and Automation. https://doi.org/10.1109/icra.2012.6224709
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.