Switchable constraints for robust pose graph SLAM

By Niko Sünderhauf, Peter Protzel. 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2012

354 citations recorded by the source corpus.

Current SLAM back-ends are based on least squares optimization and thus are not robust against outliers like data association errors and false positive loop closure detections. Our paper presents and evaluates a robust back-end formulation for SLAM using switchable constraints. Instead of proposing yet another appearance-based data association technique, our system is able to recognize and reject outliers during the optimization. This is achieved by making the topology of the underlying factor graph representation subject to the optimization instead of keeping it fixed. The evaluation shows that the approach can deal with up to 1000 false positive loop closure constraints on various datasets. This largely increases the robustness of the overall SLAM system and closes a gap between the sensor-driven front-end and the back-end optimizers.

Subfields: Aerospace Engineering, Computer Vision and Pattern Recognition

View Paper: https://www.semanticscholar.org/paper/8a937906e2a4235a6509926322f3de88340fd4dc

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Aerospace Engineering

  1. Vladlen Koltun
  2. Luca Carlone
  3. Qian-Yi Zhou
  4. Heng Yang
  5. Niko Sünderhauf
  6. Wolfram Burgard
  7. Michael Milford
  8. Cyrill Stachniss

In Computer Vision and Pattern Recognition

  1. Vladlen Koltun
  2. Luca Carlone
  3. Qian-Yi Zhou
  4. Niko Sünderhauf
  5. Michael Milford
  6. Wolfram Burgard
  7. Lei Tai
  8. Ming Liu

Citations in the corpus