Linear MonoSLAM: A Linear Approach to Large-Scale Monocular SLAM Problems

Publisher:
IEEE
Publication Type:
Conference Proceeding
Citation:
2014 IEEE International Conference on Robotics & Automation (ICRA), 2014, pp. 1517 - 1523
Issue Date:
2014-01
Full metadata record
Files in This Item:
Filename Description Size
ThumbnailLinear MonoSLAM.pdf876.91 kB
Adobe PDF
This paper presents a linear approach for solving monocular simultaneous localization and mapping (SLAM) problems. The algorithm rst builds a sequence of small initial submaps and then joins these submaps together in a divideand-conquer (D&C) manner. Each of the initial submap is built using three monocular images by bundle adjustment (BA), which is a simple nonlinear optimization problem. Each step in the D&C submap joining is solved by a linear least squares together with a coordinate and scale transformation. Since the only nonlinear part is in the building of the initial submaps, the algorithm makes it possible to solve large-scale monocular SLAM while avoiding issues associated with initialization, iteration, and local minima that are present in most of the nonlinear optimization based algorithms currently used for large-scale monocular SLAM. Experimental results based on publically available datasets are used to demonstrate that the proposed algorithms yields solutions that are very close to those obtained using global BA starting from good initial guess.
Please use this identifier to cite or link to this item: