Limited Communication, Multi-Robot Team Based Coverage

April 2004

Limited Communication, Multi-Robot Team Based Coverage

Authors:

I. Rekleitis, V. Lee-Shue, A. New, and H. Choset
Conference Paper
Proceedings of (ICRA) International Conference on Robotics and Automation

Abstract:

This paper presents an algorithm for the complete coverage of free space by a team of mobile robots. Our approach is based on a single robot coverage algorithm, which divides the target two-dimensional space into regions called cells, each of which can be covered with simple back-and-forth motions; the decomposition of free space in a collection of such cells is known as Boustrophedon decomposition. Single robot coverage is achieved by ensuring that the robot visits every cell. The new multi-robot coverage algorithm uses the same planar cell-based decomposition as the single robot approach, but provides extensions to handle how teams of robots cover a single cell and how teams are allocated among cells. This method allows planning to occur in a two-dimensional configuration space for a team of N robots. The robots operate under the restriction that communication between two robots is available only when they are within line of sight of each other.
@conference{Rekleitis-2004-121492,
author = {I. Rekleitis And V. Lee-Shue And A. New And H. Choset},
title = {Limited Communication, Multi-Robot Team Based Coverage},
booktitle = {Proceedings of (ICRA) International Conference on Robotics and Automation},
year = {2004},
month = {April},
volume = {4},
pages = {3462 - 3468},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.