Curve-graph odometry: Orientation-free error parameterisations for loop closure problems

被引:1
作者
Gutierrez-Gomez, Daniel [1 ]
Guerrero, J. J.
机构
[1] Univ Zaragoza, Inst Invest Ingn Aragon 13A, Zaragoza 50018, Spain
关键词
Pose-graph optimisation; Loop closure; SLAM; Robot odometry;
D O I
10.1016/j.robot.2015.07.017
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
During incremental odometry estimation in robotics and vision applications, the accumulation of estimation error produces a drift in the trajectory. This drift becomes observable when returning to previously visited areas, where it is possible to correct it by applying loop closing techniques. Ultimately a loop closing process leads to an optimisation problem where new constraints between poses obtained from Imp detection are applied to the initial incremental estimate of the trajectory. Typically this optimisation is jointly applied on the position and orientation of each pose of the robot using the state-of-the-art pose graph optimisation scheme on the manifold of the rigid body motions. In this paper we propose to address the loop closure problem using only the positions and thus removing the orientations from the optimisation vector. The novelty in our approach is that, instead of treating trajectory as a set of poses, we look at it as a curve in its pure mathematical meaning. We define an observation function which computes the estimate of one constraint in a local reference frame using only the robot positions. Our proposed method is compared against state-of-the-art pose graph optimisation algorithms in 2 and 3 dimensions. The benefit of eliminating orientations is twofold. First, the objective function in the optimisation does not mix translation and rotation terms, which may have different scales. Second, computational performance can be improved due to the reduction in the state dimension of the nodes of the graph. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码:299 / 308
页数:10
相关论文
共 26 条
[1]  
Absil PA, 2008, OPTIMIZATION ALGORITHMS ON MATRIX MANIFOLDS, P1
[2]  
[Anonymous], 2012, THESIS IMPERIAL COLL
[3]  
[Anonymous], 2010, ROBOTICS SCI SYSTEMS
[4]   From Angular Manifolds to the Integer Lattice: Guaranteed Orientation Estimation With Application to Pose Graph Optimization [J].
Carlone, Luca ;
Censi, Andrea .
IEEE TRANSACTIONS ON ROBOTICS, 2014, 30 (02) :475-492
[5]  
Carlone Luca., 2011, Robotics: Science and Systems
[6]  
Dubbelman G, 2013, IEEE INT CONF ROBOT, P5190, DOI 10.1109/ICRA.2013.6631319
[7]   Efficient Trajectory Bending with Applications to Loop Closure [J].
Dubbelman, Gijs ;
Esteban, Isaac ;
Schutte, Klamer .
IEEE/RSJ 2010 INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS 2010), 2010, :4836-4842
[8]   Fast, on-line learning of globally consistent maps [J].
Duckett, T ;
Marsland, S ;
Shapiro, J .
AUTONOMOUS ROBOTS, 2002, 12 (03) :287-300
[9]   A multilevel relaxation algorithm for simultaneous localization and mapping [J].
Frese, U ;
Larsson, P ;
Duckett, T .
IEEE TRANSACTIONS ON ROBOTICS, 2005, 21 (02) :196-207
[10]   Hybrid Hessians for Flexible Optimization of Pose Graphs [J].
Grimes, Matthew Koichi ;
Anguelov, Dragomir ;
LeCun, Yann .
IEEE/RSJ 2010 INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS 2010), 2010, :2997-3004