オンライン被覆経路計画のための汎用マルチロボットモンテカルロ木探索プランナ
A Versatile Multi-Robot Monte Carlo Tree Search Planner for On-Line Coverage Path Planning
ゲーム理論由来のモンテカルロ木探索を用いて、地図未知の環境で複数ロボットが協調してエリアを被覆・地図化するオンライン経路計画手法を提案し、従来のBoustrophedon法と比較した。
著者: Phillip Hyatt, Zachary Brock, Marc D. Killpack
分類: cs.MA, cs.RO
原文アブストラクト
Mobile robots hold great promise in reducing the need for humans to perform jobs such as vacuuming, seeding,harvesting, painting, search and rescue, and inspection. In practice, these tasks must often be done without an exact map of the area and could be completed more quickly through the use of multiple robots working together. The task of simultaneously covering and mapping an area with multiple robots is known as multi-robot on-line coverage and is a growing area of research. Many multi-robot on-line coverage path planning algorithms have been developed as extensions of well established off-line coverage algorithms. In this work we introduce a novel approach to multi-robot on-line coverage path planning based on a method borrowed from game theory and machine learning- Monte Carlo Tree Search. We implement a Monte Carlo Tree Search planner and compare completion times against a Boustrophedon-based on-line multi-robot planner. The MCTS planner is shown to perform on par with the conventional Boustrophedon algorithm in simulations varying the number of robots and the density of obstacles in the map. The versatility of the MCTS planner is demonstrated by incorporating secondary objectives such as turn minimization while performing the same coverage task. The versatility of the MCTS planner suggests it is well suited to many multi-objective tasks that arise in mobile robotics.
