Grid-based Submap Joining: An Efficient Algorithm for Simultaneously Optimizing Global Occupancy Map and Local Submap Frames
Yingyu Wang, Liang Zhao, Shoudong Huang

TL;DR
This paper introduces a grid-based submap joining algorithm for large-scale 2D SLAM that optimizes the global occupancy map and local submap frames efficiently, leveraging a pose-only Gauss-Newton method.
Contribution
The paper presents a novel formulation of the submap joining problem as a non-linear least squares problem and proves an independence property that enables a more efficient pose-only optimization algorithm.
Findings
Outperforms state-of-the-art methods in efficiency and accuracy
Effective in very large-scale environments
Validates with simulations and real datasets
Abstract
Optimizing robot poses and the map simultaneously has been shown to provide more accurate SLAM results. However, for non-feature based SLAM approaches, directly optimizing all the robot poses and the whole map will greatly increase the computational cost, making SLAM problems difficult to solve in large-scale environments. To solve the 2D non-feature based SLAM problem in large-scale environments more accurately and efficiently, we propose the grid-based submap joining method. Specifically, we first formulate the 2D grid-based submap joining problem as a non-linear least squares (NLLS) form to optimize the global occupancy map and local submap frames simultaneously. We then prove that in solving the NLLS problem using Gauss-Newton (GN) method, the increments of the poses in each iteration are independent of the occupancy values of the global occupancy map. Based on this property, we…
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.
