Arrow Research search
Back to IROS

IROS 2015

Robust incremental SLAM with consistency-checking

Conference Paper Accepted Paper Artificial Intelligence ยท Robotics

Abstract

Incorrect landmark and loop closure measurements can cause standard SLAM algorithms to fail catastrophically. Recently, several SLAM algorithms have been proposed that are robust to loop closure errors, but it is shown in this paper that they cannot provide robust solutions when landmark measurement errors occur. The root cause of this problem is that the robust SLAM algorithms only focus on generating solutions that are locally consistent (i. e. each measurement agrees with its corresponding estimates) rather than globally consistent (i. e. all of the measurements in the solution agree with each other). Moreover, these algorithms do not attempt to maximize the number of correct measurements included in the solution, meaning that often correct measurements are ignored and the solution quality suffers as a result. This paper proposes a new formulation of the robust SLAM problem that seeks a globally consistent map that also maximizes the number of measurements included in the solution. In addition, a novel incremental SLAM algorithm, called incremental SLAM with consistency-checking, is developed to solve the new robust SLAM problem. Finally, simulated and experimental results show that the new algorithm significantly outperforms state-of-the-art robust SLAM methods for datasets with incorrect landmark measurements and can match their performance for datasets with incorrect loop closures.

Authors

Keywords

  • Simultaneous localization and mapping
  • Robustness
  • Extraterrestrial measurements
  • Standards
  • Switches
  • Time measurement
  • Robust Algorithm
  • Robust Problem
  • Loop Closure
  • Global Consistency
  • Incremental Algorithm
  • Incorrect Measurements
  • Cost Function
  • Precision And Recall
  • Simulated Datasets
  • Precision Values
  • Nodes In The Graph
  • Real-world Datasets
  • Accurate Solution
  • Fisher Information
  • Pose Estimation
  • Standard Assumptions
  • Number Of Outliers
  • Landmark Localization
  • Fraction Measurements
  • Factor Graph
  • Robot Pose
  • Pose Changes
  • Monte Carlo Trials
  • Robust Formulation
  • Subset Of Measures
  • Additive Outlier
  • Augmentation Approach
  • Measurement Outliers
  • Linear Programming

Context

Venue
IEEE/RSJ International Conference on Intelligent Robots and Systems
Archive span
1988-2025
Indexed papers
26578
Paper id
673413349686225520
v2026.09.13