A Versatile Multi-Robot Monte Carlo Tree Search Planner for On-Line Coverage Path Planning

02/11/2020
by   Phillip Hyatt, et al.
0

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.

READ FULL TEXT
research
12/05/2022

TMSTC*: A Turn-minimizing Algorithm For Multi-robot Coverage Path Planning

Coverage path planning is a major application for mobile robots, which r...
research
03/03/2023

Graph-based Simultaneous Coverage and Exploration Planning for Fast Multi-robot Search

In large unknown environments, search operations can be much more time-e...
research
07/22/2019

Revisiting Boustrophedon Coverage Path Planning as a Generalized Traveling Salesman Problem

In this paper, we present a path planner for low-altitude terrain covera...
research
09/14/2023

Efficiently Identifying Hotspots in a Spatially Varying Field with Multiple Robots

In this paper, we present algorithms to identify environmental hotspots ...
research
09/19/2022

D2CoPlan: A Differentiable Decentralized Planner for Multi-Robot Coverage

Centralized approaches for multi-robot coverage planning problems suffer...
research
03/08/2021

Autonomous object harvesting using synchronized optoelectronic microrobots

Optoelectronic tweezer-driven microrobots (OETdMs) are a versatile micro...
research
06/30/2023

Mixed Integer Programming for Time-Optimal Multi-Robot Coverage Path Planning with Efficient Heuristics

We investigate time-optimal Multi-Robot Coverage Path Planning (MCPP) fo...

Please sign up or login with your details

Forgot password? Click here to reset