Incremental 3-D pose graph optimization for SLAM algorithm without marginalization. (15th June 2020)

• Record Type: Journal Article
• Authors: Youyang, Feng; Qing, Wang; Gaochao, Yang
• Is Part Of: International journal of advanced robotic systems. Volume 17:Number 3(2020:May/Jun.)
• Publication Date: 2020-06-15
• Subjects: Pose graph optimization -- computer vision -- visual simultaneous localization and mapping -- optimization method; Robotics -- Periodicals; Robotics; Periodicals; 629.892
• DOI: 10.1177/1729881420925304
• Languages: English
• ISSNs: 1729-8806

Abstract

Pose graph optimization algorithm is a classic nonconvex problem which is widely used in simultaneous localization and mapping algorithm. First, we investigate previous contributions and evaluate their performances using KITTI, Technische Universität München (TUM), and New College data sets. In practical scenario, pose graph optimization starts optimizing when loop closure happens. An estimated robot pose meets more than one loop closures; Schur complement is the common method to obtain sequential pose graph results. We put forward a new algorithm without managing complex Bayes factor graph and obtain more accurate pose graph result than state-of-art algorithms. In the proposed method, we transform the problem of estimating absolute poses to the problem of estimating relative poses. We name this incremental pose graph optimization algorithm as G-pose graph optimization algorithm. Another advantage of G-pose graph optimization algorithm is robust to outliers. We add loop closure metric to deal with outlier data. Previous experiments of pose graph optimization algorithm use simulated data, which do not conform to real world, to evaluate performances. We use KITTI, TUM, and New College data sets, which are obtained by real sensor in this study. Experimental results demonstrate that our proposed incremental pose graph algorithm model is stable and accurate in real-world scenario.