人間の断続的な支援を考慮した協調ロボットチームの最適経路計画
Optimal Robot Path Planning In a Collaborative Human-Robot Team with Intermittent Human Availability
人間が時々しか支援できない協調作業環境で、ロボットが待機時間の制約下で最速経路を計算する手法を提案し、都市道路網で有効性を示した。
著者: Abhinav Dahiya, Stephen L. Smith
分類: cs.RO
原文アブストラクト
This paper presents a solution for the problem of optimal planning for a robot in a collaborative human-robot team, where the human supervisor is intermittently available to assist the robot in completing tasks more quickly. Specifically, we address the challenge of computing the fastest path between two configurations in an environment with time constraints on how long the robot can wait for assistance. To solve this problem, we propose a novel approach that utilizes the concepts of budget and critical departure times, which enables us to obtain optimal solutions while scaling to larger problem instances than existing methods. We demonstrate the effectiveness of our approach by comparing it with several baseline algorithms on a city road network and analyzing the quality of the solutions obtained. Our work contributes to the field of robot planning by addressing the critical issue of incorporating human assistance and environmental restrictions, which has significant implications for real-world applications.
