Submodular Optimization for Keyframe Selection & Usage in SLAM
David Thorne, Nathan Chan, Yanlong Ma, Christa S. Robison, Philip R. Osteen, Brett T. Lopez
TL;DR
This paper addresses the challenge of memory- and compute-efficient LiDAR SLAM by proposing online keyframe selection and submap generation guided by submodular optimization, enabled by a neural descriptor for point-cloud similarity. It defines three coupled components: (i) a keyframe selection strategy using a neural descriptor-based diversity objective with a provable submodular structure, (ii) a submap generation method that maximizes the minimum Hessian eigenvalue to constrain scan alignment, and (iii) a streaming map summarization approach that yields size-constrained summaries in one pass. The results show substantial savings in keyframe counts and memory, improved per-scan computation times, and effective map summarization without compromising localization performance, demonstrated on long-range UAV/train-like loops and ARL Graces Quarters datasets. The methods enable scalable SLAM with on-the-fly and offline map sharing capabilities, driven by submodular theory and neural descriptor-based similarity.
Abstract
Keyframes are LiDAR scans saved for future reference in Simultaneous Localization And Mapping (SLAM), but despite their central importance most algorithms leave choices of which scans to save and how to use them to wasteful heuristics. This work proposes two novel keyframe selection strategies for localization and map summarization, as well as a novel approach to submap generation which selects keyframes that best constrain localization. Our results show that online keyframe selection and submap generation reduce the number of saved keyframes and improve per scan computation time without compromising localization performance. We also present a map summarization feature for quickly capturing environments under strict map size constraints.
