当前位置: X-MOL 学术Int. J. Adv. Robot. Syst. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Incremental 3-D pose graph optimization for SLAM algorithm without marginalization
International Journal of Advanced Robotic Systems ( IF 2.1 ) Pub Date : 2020-05-01 , DOI: 10.1177/1729881420925304
Feng Youyang 1 , Wang Qing 1 , Yang Gaochao 1
Affiliation  

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.

中文翻译:

无边缘化的 SLAM 算法增量 3-D 姿态图优化

位姿图优化算法是一个经典的非凸问题,广泛应用于同步定位和映射算法。首先,我们使用 KITTI、Technische Universität München (TUM) 和 New College 数据集调查以前的贡献并评估他们的表现。在实际场景中,位姿图优化在闭环发生时开始优化。一个估计的机器人位姿满足多个闭环;Schur 补是获得序列位姿图结果的常用方法。我们提出了一种无需管理复杂贝叶斯因子图的新算法,并获得比最先进算法更准确的姿态图结果。在所提出的方法中,我们将估计绝对位姿的问题转化为估计相对位姿的问题。我们将这种增量姿态图优化算法命名为 G-pose 图优化算法。G-pose 图优化算法的另一个优点是对异常值具有鲁棒性。我们添加了闭环度量来处理异常数据。先前的姿势图优化算法实验使用不符合现实世界的模拟数据来评估性能。我们使用 KITTI、TUM 和 New College 数据集,这些数据集是在本研究中通过真实传感器获得的。实验结果表明,我们提出的增量姿态图算法模型在实际场景中是稳定和准确的。不符合现实世界的,以评估性能。我们使用 KITTI、TUM 和 New College 数据集,这些数据集是在本研究中通过真实传感器获得的。实验结果表明,我们提出的增量姿态图算法模型在实际场景中是稳定和准确的。不符合现实世界的,以评估性能。我们使用 KITTI、TUM 和 New College 数据集,这些数据集是在本研究中通过真实传感器获得的。实验结果表明,我们提出的增量姿态图算法模型在实际场景中是稳定和准确的。
更新日期:2020-05-01
down
wechat
bug