A sparse separable SLAM back-end

Publication Type:
Journal Article
Citation:
IEEE Transactions on Robotics, 2016, 32 (6), pp. 1536 - 1549
Issue Date:
2016-12-01
Full metadata record
Files in This Item:
Filename Description Size
r.pdfPublished Version858.19 kB
Adobe PDF
© 2004-2012 IEEE. We propose a scalable algorithm to take advantage of the separable structure of simultaneous localization and mapping (SLAM). Separability is an overlooked structure of SLAM that distinguishes it from a generic nonlinear least-squares problem. The standard relative-pose and relative-position measurement models in SLAM are affine with respect to robot and features' positions. Therefore, given an estimate for robot orientation, the conditionally optimal estimate for the rest of the state variables can be easily computed by solving a sparse linear least-squares problem. We propose an algorithm to exploit this intrinsic property of SLAM by stripping the problem down to its nonlinear core, while maintaining its natural sparsity. Our algorithm can be used in conjunction with any Newton-based solver and is applicable to 2-D/3-D pose-graph and feature-based SLAM. Our results suggest that iteratively solving the nonlinear core of SLAM leads to a fast and reliable convergence as compared to the state-of-the-art sparse back-ends.
Please use this identifier to cite or link to this item: