Comparison of methods to efficient graph SLAM under general optimization framework

Simultaneous Localization and Mapping(SLAM) algorithms can infer the robot's trajectory as well as the map under unknown environment. Robust and time-efficient optimization methods are important requirements for SLAM. There are many algorithms designed for the graph optimization. However, it is hard to select an appropriate algorithm and corresponding software library, due to the difficulty of evaluating algorithms' adaptabilities under various situations. In this paper, we summarize these algorithms under general optimization framework, conduct several sets of experiments to compare these algorithms in three software libraries, and give some suggestions to choose algorithms.

[1]  Wolfram Burgard,et al.  A benchmark for the evaluation of RGB-D SLAM systems , 2012, 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[2]  Garret N. Vanderplaats,et al.  Numerical Optimization Techniques for Engineering Design: With Applications , 1984 .

[3]  Joaquim Salvi,et al.  The SLAM problem: a survey , 2008, CCIA.

[4]  X. Jin.  Factor graphs and the Sum-Product Algorithm , 2002 .

[5]  Wolfram Burgard,et al.  Nonlinear Constraint Network Optimization for Efficient Map Learning , 2009, IEEE Transactions on Intelligent Transportation Systems.

[6]  Frank Dellaert,et al.  iSAM2: Incremental smoothing and mapping using the Bayes tree , 2012, Int. J. Robotics Res..

[7]  Frank Dellaert,et al.  iSAM: Incremental Smoothing and Mapping , 2008, IEEE Transactions on Robotics.

[8]  Wolfram Burgard,et al.  A Tutorial on Graph-Based SLAM , 2010, IEEE Intelligent Transportation Systems Magazine.

[9]  Niko Sünderhauf,et al.  Towards a robust back-end for pose graph SLAM , 2012, 2012 IEEE International Conference on Robotics and Automation.

[10]  Frank Dellaert,et al.  Selecting good measurements via ℓ1 relaxation: A convex approach for robust estimation over graphs , 2014, 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[11]  Yasir Latif,et al.  Robust graph SLAM back-ends: A comparative analysis , 2014, 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[12]  Kurt Konolige,et al.  g 2 o: A general Framework for (Hyper) Graph Optimization , 2011 .

[13]  Jeffrey K. Uhlmann,et al.  A counter example to the theory of simultaneous localization and map building , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[14]  Evangelos E. Milios,et al.  Globally Consistent Range Scan Alignment for Environment Mapping , 1997, Auton. Robots.

[15]  John J. Leonard,et al.  RISE: An Incremental Trust-Region Method for Robust Online Sparse Least-Squares Estimation , 2014, IEEE Transactions on Robotics.

[16]  Wolfram Burgard,et al.  Efficient Sparse Pose Adjustment for 2D mapping , 2010, 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[17]  Wolfram Burgard,et al.  Robust map optimization using dynamic covariance scaling , 2013, 2013 IEEE International Conference on Robotics and Automation.

[18]  Edwin Olson,et al.  Fast iterative alignment of pose graphs with poor initial estimates , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[19]  Cyrill Stachniss,et al.  On measuring the accuracy of SLAM algorithms , 2009, Auton. Robots.

[20]  Frank Dellaert,et al.  Square Root SAM: Simultaneous Localization and Mapping via Square Root Information Smoothing , 2006, Int. J. Robotics Res..