Multi-robot area coverage with limited visibility

Authors:
Pooyan Fazli;Alireza Davoodi;Philippe Pasquier;Alan K. Mackworth
Affiliations:
University of British Columbia;Simon Fraser University;Simon Fraser University;University of British Columbia
Venue:
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Year:
2010

Citing 4
Cited 3

Constrained Delaunay triangulations

SCG '87 Proceedings of the third annual symposium on Computational geometry
A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons

Computational Geometry: Theory and Applications
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Coverage for robotics – A survey of recent results

Annals of Mathematics and Artificial Intelligence

On multi-robot area coverage

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
On multi-robot area coverage

AI'10 Proceedings of the 23rd Canadian conference on Advances in Artificial Intelligence
Multi-robot repeated area coverage

Autonomous Robots

Quantified Score

Hi-index	0.00

Visualization

Abstract

We address the problem of multi-robot area coverage and present a new approach in the case where the map of the area and its static obstacles are known and the robots have a limited visibility range. The proposed method starts by locating a set of static guards on the map of the target area and then builds a graph called Reduced-CDT, a new environment representation method based on the Constrained Delaunay Triangulation (CDT). Multi-Prim's is used to decompose the resultant graph into a forest of partial spanning trees (PSTs). Each PST is modified through a mechanism called Constrained Spanning Tour (CST) to build a cycle which is then assigned to a covering robot. Subsequently, robots start navigating the cycles and consequently cover the whole area. The proposed approach is complete provided that at least one of the robots operates correctly.