CoChat

Towards a robust back-end for pose graph SLAM

Sunderhauf, Niko, Protzel, Peter · 2012 · 2012 IEEE International Conference on Robotics and Automation

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

Crossref · 10.1109/icra.2012.6224709

Cites

28 of 28 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Research works printed but not linked: 2

  1. ku?mmerle, 0, G2o: A general framework for graph optimization, Proc of the IEEE Int Conf on Robotics and Automation (ICRA) 2011
  2. olson, 0, Fast iterative optimization of pose graphs with poor initial estimates, Inl Conf on Robotics and Automation ICRA 2006

Cited by

See all 198

Metadata

Authors
Sunderhauf, N., & Protzel, P.
Affiliations
Chemnitz University of Technology (DE)
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

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.