Multi-robot repeated area coverage

  • Authors:

  • Pooyan Fazli;Alireza Davoodi;Alan K. Mackworth

  • Affiliations:

  • Department of Computer Science, University of British Columbia, Vancouver, Canada V6T 1Z4;Department of Computer Science, University of British Columbia, Vancouver, Canada V6T 1Z4;Department of Computer Science, University of British Columbia, Vancouver, Canada V6T 1Z4

  • Venue:
  • Autonomous Robots
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

We address the problem of repeated coverage of a target area, of any polygonal shape, by a team of robots having a limited visual range. Three distributed Cluster-based algorithms, and a method called Cyclic Coverage are introduced for the problem. The goal is to evaluate the performance of the repeated coverage algorithms under the effects of the variables: Environment Representation, and the Robots' Visual Range. A comprehensive set of performance metrics are considered, including the distance the robots travel, the frequency of visiting points in the target area, and the degree of balance in workload distribution among the robots. The Cyclic Coverage approach, used as a benchmark to compare the algorithms, produces optimal or near-optimal solutions for the single robot case under some criteria. The results can be used as a framework for choosing an appropriate combination of repeated coverage algorithm, environment representation, and the robots' visual range based on the particular scenario and the metric to be optimized.