Title :
Towards a robust back-end for pose graph SLAM
Author :
Sünderhauf, Niko ; Protzel, Peter
Author_Institution :
Dept. of Electr. Eng. & Inf. Technol., Chemnitz Univ. of Technol., Chemnitz, Germany
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.
Keywords :
SLAM (robots); graph theory; optimisation; probability; false positive loop closures; graph structure topological correctness; pose graph SLAM problem; probabilistic constraint graphs; robust back-end optimizer; sensor-driven front-end; sparse optimization techniques; Cost function; Robustness; Simultaneous localization and mapping; Switches; Trajectory;
Conference_Titel :
Robotics and Automation (ICRA), 2012 IEEE International Conference on
Conference_Location :
Saint Paul, MN
Print_ISBN :
978-1-4673-1403-9
Electronic_ISBN :
1050-4729
DOI :
10.1109/ICRA.2012.6224709