arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2406.01195cs.RO
收藏

C$^3$P-VoxelMap:紧凑、累积与可合并的概率体素建图

C$^3$P-VoxelMap: Compact, Cumulative and Coalescible Probabilistic Voxel Mapping

Deptrum Ltd.(德创科技有限公司)

Xu Yang, Wenhao Li, Qijie Ge, Lulu Suo, Weijie Tang, Zhengyu Wei, Longxiang Huang, Bo Wang

AI总结:

本文提出C$^3$P-VoxelMap,一种紧凑、累积与可合并的概率体素建图方法,通过无点表示和延迟合并策略,大幅降低LiDAR里程计的复杂度与内存消耗,同时显著提升精度与性能。

摘要:

本工作提出了一种紧凑、累积与可合并的概率体素建图方法,以提升 LiDAR 里程计的性能、精度和内存效率。概率体素建图需要存储过去的点云并对其重新迭代,以在每次迭代时更新不确定性,这会消耗大量内存空间和 CPU 周期。为解决此问题,我们提出了一种双重策略。首先,我们为概率体素引入了一种紧凑的无点表示,并推导出平面不确定性的累积更新,而无需缓存原始点云。我们的体素结构仅跟踪位于其内部的点的预定统计量集合。该方法将运行时复杂度从 $O(MN)$ 降低至 $O(N)$,空间复杂度从 $O(N)$ 降低至 $O(1)$,其中 $M$ 为迭代次数,$N$ 为点数。其次,为进一步最小化内存使用并提升建图精度,我们利用现实世界的几何特征,提供了一种动态合并与同一物理平面相关联的体素的策略。我们的合并策略并非在每次迭代时不断扫描这些可合并体素,而是在局部敏感哈希中累积体素并延迟触发合并。按需合并不仅以最小的计算开销减少了内存占用,还得益于跨体素去噪而提高了定位精度。实验表明,与现有技术相比,精度提高了 20%,性能提升了 20%,内存消耗降低了 70%。

英文摘要:

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 $O(MN)$ to $O(N)$ and the space complexity from $O(N)$ to $O(1)$ where $M$ is the number of iterations and $N$ is the number of points. Second, to further minimize memory usage and enhance mapping accuracy, we provide a strategy to dynamically merge voxels associated with the same physical planes by taking advantage of the geometric features in the real world. Rather than scanning for these coalescible voxels constantly at every iteration, our merging strategy accumulates voxels in a locality-sensitive hash and triggers merging lazily. On-demand merging not only reduces memory footprint with minimal computational overhead but also improves localization accuracy thanks to cross-voxel denoising. Experiments exhibit 20% higher accuracy, 20% faster performance and 70% lower memory consumption than the state-of-the-art.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑