長距離センサ情報を用いた自律移動パトロールロボットのための高速再訪カバレッジ経路計画
Fast-Revisit Coverage Path Planning for Autonomous Mobile Patrol Robots Using Long-Range Sensor Information
限られたセンサ範囲のUGVパトロール向けに、貪欲法で最大カバレッジのウェイポイントを提案し、ランダム探索で再訪時間を最小化する経路計画アルゴリズムを提案。シミュレーションで既存手法より経路長21%以上、再訪時間33%以上削減した。
著者: Srinivas Kachavarapu, Tobias Doernbach, Reinhard Gerndt
分類: cs.RO
原文アブストラクト
The utilization of Unmanned Ground Vehicles (UGVs) for patrolling industrial sites has expanded significantly. These UGVs typically are equipped with perception systems, e.g., computer vision, with limited range due to sensor limitations or site topology. High-level control of the UGVs requires Coverage Path Planning (CPP) algorithms that navigate all relevant waypoints and promptly start the next cycle. In this paper, we propose the novel Fast-Revisit Coverage Path Planning (FaRe-CPP) algorithm using a greedy heuristic approach to propose waypoints for maximum coverage area and a random search-based path optimization technique to obtain a path along the proposed waypoints with minimum revisit time. We evaluated the algorithm in a simulated environment using Gazebo and a camera-equipped TurtleBot3 against a number of existing algorithms. Compared to their average path lengths and revisit times, our FaRe-CPP algorithm showed a reduction of at least 21% and 33%, respectively, in these highly relevant performance indicators.
関連論文
- 未知環境における階層的カバレッジ経路計画アルゴリズムカバレッジ経路計画
- 3D-CovDiffusion: カバレッジ経路計画のための3D認識拡散ポリシーカバレッジ経路計画
- セルラー分解を用いたロボット芝刈り機のカバレッジ経路計画のエンドツーエンドフレームワークカバレッジ経路計画
- 自律型水中ロボットのためのトラック間隔適応型カバレッジ経路計画カバレッジ経路計画
