Linear SLAM: Linearising the SLAM Problems using Submap Joining
Liang Zhao, Shoudong Huang, Gamini Dissanayake

TL;DR
This paper introduces Linear SLAM, a novel approach that simplifies large-scale SLAM problems by joining submaps through linear least squares, avoiding complex nonlinear optimization and requiring no initial guess.
Contribution
The paper presents a linear submap joining method for SLAM that eliminates the need for iterative nonlinear optimization, applicable to various SLAM types and dimensions.
Findings
Produces results close to nonlinear optimization solutions
Does not require initial guesses or iterations
Applicable to 2D and 3D SLAM scenarios
Abstract
The main contribution of this paper is a new submap joining based approach for solving large-scale Simultaneous Localization and Mapping (SLAM) problems. Each local submap is independently built using the local information through solving a small-scale SLAM; the joining of submaps mainly involves solving linear least squares and performing nonlinear coordinate transformations. Through approximating the local submap information as the state estimate and its corresponding information matrix, judiciously selecting the submap coordinate frames, and approximating the joining of a large number of submaps by joining only two maps at a time, either sequentially or in a more efficient Divide and Conquer manner, the nonlinear optimization process involved in most of the existing submap joining approaches is avoided. Thus the proposed submap joining algorithm does not require initial guess or…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRobotics and Sensor-Based Localization · Advanced Image and Video Retrieval Techniques · Indoor and Outdoor Localization Technologies
