LiDAR搭載UAV探査のための軽量パス考慮型フロンティア再ランキング
Lightweight Path-Aware Frontier Re-ranking for LiDAR-Based UAV Exploration
LiDAR搭載UAVの3D自律探査において、候補フロンティアを軽量に絞った後、時間制限付きRRT*で経路コストを見積もって再ランキングする手法を提案し、従来より短い探査経路と時間を実現した。
詳しい要約
1. どんなもの？
2. 先行研究と比べてどこがすごい？
3. 技術・手法の肝は？
4. どうやって有効だと検証した？
5. 議論はある？
6. 次に読むべき論文は？
※ AIが要旨から生成した要約です。正確性は原文をご確認ください。
著者: Duc Manh Do, Thanh Nguyen Canh, Ngoc Minh Do, Mai Thanh Thai, Xiem HoangVan
分類: cs.RO
原文アブストラクト
Autonomous 3D exploration with UAVs requires efficient target selection under limited flight time and onboard computation. In conventional Euclidean-distance-based frontier pipelines, geometric distance may poorly represent the actual collision-free travel cost in cluttered environments, leading to inefficient frontier choices. This paper presents a lightweight path-aware frontier re-ranking method for LiDAR-based UAV exploration. The method first retains a small top-N set of promising frontier candidates using a lightweight utility function and then applies time-bounded RRT* planning to estimate their feasible path costs for re-ranking. The path generated for the selected frontier is further reused for navigation to reduce redundant global planning. Experiments in three warehouse-like environments show that the proposed method consistently produces shorter exploration trajectories than conventional frontier baselines, with traveled-distance reductions of up to 14.1%, while reducing exploration time by up to 9.5% in two environments and remaining competitive in the third. The method maintains map detail comparable to the conventional OctoMap-based baseline, demonstrating an effective trade-off between exploration efficiency and mapping quality.