Efficient Multi-Robot Coverage of a Known Environment

Nare Karapetyan, Kelly Benson, Chris McKinney, Perouz Taslakian, Ioannis Rekleitis
In IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) 2017.

Abstract

Abstract: This paper addresses the complete area coverage problem of a known environment by multiple-robots. Complete area coverage is the problem of moving an end-effector over all available space while avoiding existing obstacles. In such tasks, using multiple robots can increase the efficiency of the area coverage in terms of minimizing the operational time and increase the robustness in the face of robot attrition. Unfortunately, the problem of finding an optimal solution for such an area coverage problem with multiple robots is known to be NP-complete. In this paper we present two approximation heuristics for solving the multi-robot coverage problem. The first solution presented is a direct extension of an efficient single robot area coverage algorithm, based on an exact cellular decomposition. The second algorithm is a greedy approach that divides the area into equal regions and applies an efficient single-robot coverage algorithm to each region. We present experimental results for two algorithms. Results indicate that our approaches provide good coverage distribution between robots and minimize the workload per robot, meanwhile ensuring complete coverage of the area.

Download

Video

BibTeX

@inproceedings{RekleitisIROS2017b,
  author       = {Nare Karapetyan and Kelly Benson and Chris McKinney and
		 Perouz Taslakian and Ioannis Rekleitis},
  title        = {Efficient Multi-Robot Coverage of a Known Environment},
  booktitle    = {IEEE/RSJ International Conference on Intelligent Robots
		 and Systems (IROS)},
  year	       = {2017},
  pages        = {1846 - 1852},
  month        = {Sep.},
  address      = {Vancouver, BC, Canada}
}

Rekleitis's home page
Rekleitis's publication list

Sat Dec 15 06:21:02 EST 2018