C$^3$P-VoxelMap: Compact, Cumulative and Coalescible Probabilistic Voxel Mapping
Xu Yang, Wenhao Li, Qijie Ge, Lulu Suo, Weijie Tang, Zhengyu Wei,, Longxiang Huang, Bo Wang

TL;DR
This paper introduces a novel probabilistic voxel mapping method that significantly reduces memory and computational costs while improving accuracy in LiDAR odometry through a compact representation and dynamic voxel merging.
Contribution
The paper proposes a compact, point-free probabilistic voxel representation and a lazy, locality-sensitive voxel merging strategy to enhance efficiency and accuracy in mapping.
Findings
20% higher accuracy compared to state-of-the-art
20% faster performance
70% lower memory consumption
Abstract
This work presents a compact, cumulative and coalescible probabilistic voxel mapping method to enhance performance, accuracy and memory efficiency in LiDAR odometry. Probabilistic voxel mapping requires storing past point clouds and re-iterating on them to update the uncertainty every iteration, which consumes large memory space and CPU cycles. To solve this problem, we propose a two-folded strategy. First, we introduce a compact point-free representation for probabilistic voxels and derive a cumulative update of the planar uncertainty without caching original point clouds. Our voxel structure only keeps track of a predetermined set of statistics for points that lie inside it. This method reduces the runtime complexity from to and the space complexity from to where is the number of iterations and is the number of points. Second, to further minimize…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDigital Image Processing Techniques · Computational Geometry and Mesh Generation · Modular Robots and Swarm Intelligence
