arXiv:2603.03695cs.RO2026-03

用森林数字档案实现厘米级精准定位,省去海量点云数据。

TreeLoc++: Robust 6-DoF LiDAR Localization in Forests with a Compact Digital Forest Inventory

  • 直接基于数字森林档案进行全局定位,无需原始点云。
  • 在多国森林中实现厘米级定位,两年间数据仍能准确匹配。
  • 适合长期监测森林的机器人系统,地图仅需250KB。

可靠定位对可持续森林管理至关重要,使机器人可长期回访并监测单棵树状态。现代林业依赖数字森林档案(DFI),以紧凑几何属性编码树干,而非原始数据。然而,现有定位研究忽视了DFI,多数方法仍依赖高成本的密集点云。为此,我们提出TreeLoc++,一种直接基于DFI的全局定位框架,消除对原始点云的依赖。该方法通过配对距离直方图编码局部树布局上下文,结合胸径(DBH)过滤与航向一致性内点选择,显著减少误匹配。进一步利用树几何约束优化,联合估计俯仰、翻滚和高度,提升位姿稳定性。在四个国家的多样森林中测试表明,其定位精度达厘米级;且在2023年与2025年数据间仍具鲁棒性,跨越两年间隔。系统仅用250KB地图数据表示7.98公里轨迹共15次会话,优于依赖点云地图的手工与学习基线,证明其适用于长期部署。代码已开源。

原文摘要 · Abstract (English)

Reliable localization is essential for sustainable forest management, as it allows robots to revisit and monitor the status of individual trees over long periods. In modern forestry, this management is structured around Digital Forest Inventories (DFIs), which encode stems using compact geometric attributes rather than raw data. Despite their central role, DFIs have been overlooked in localization research, and most methods still rely on dense gigabyte-sized point clouds that are costly to store and maintain. To improve upon this, we propose TreeLoc++, a global localization framework that operates directly on DFIs as a discriminative representation, eliminating the need to use the raw point clouds. TreeLoc++ reduces false matches in structurally ambiguous forests and improves the reliability of full 6-DoF pose estimation. It augments coarse retrieval with a pairwise distance histogram that encodes local tree-layout context, subsequently refining candidates via DBH-based filtering and yaw-consistent inlier selection to further reduce mismatches. Furthermore, a constrained optimization leveraging tree geometry jointly estimates roll, pitch, and height, enhancing pose stability and enabling accurate localization without reliance on dense 3D point cloud data. Evaluations on diverse forests across four countries show that TreeLoc++ achieves precise localization with centimeter-level accuracy. We further demonstrate robustness to long-term change by localizing data recorded in 2025 against inventories built from 2023 data, spanning a two-year interval. The system represents 15 sessions spanning 7.98 km of trajectories using only 250KB of map data and outperforms both hand-crafted and learning-based baselines that rely on point cloud maps. This demonstrates the scalability of TreeLoc++ for long-term deployment. TreeLoc++ is open-sourced at \bl{https://github.com/minwoo0611/TreeLoc-plusplus}.

定位森林管理数字档案轻量化

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。