• Sorted by Date • Classified by Publication Type • Sorted by First Author Last Name • Classified by Author Last Name •
Pooyan Fazli, Alireza Davoodi, Philippe Pasquier, and Alan K. Mackworth. Complete and Robust Cooperative Robot Area Coverage with Limited Range. In Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2010, pp. 5577–5582, 2010.
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 graph into a forest of partial spanning trees (PSTs). Each PST is then modified through a mechanism called Constrained Spanning Tour (CST) to build a cycle which is then assigned to an individual robot. Subsequently, robots start navigating the cycles and consequently cover the whole area. We show that the proposed approach is complete and robust with respect to robot failure.
@inproceedings{PooyanFazliIROS2010,
author = {Pooyan Fazli and Alireza Davoodi and Philippe Pasquier and Alan K. Mackworth},
title = {Complete and Robust Cooperative Robot Area Coverage with Limited Range},
booktitle = {Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2010},
year = {2010},
pages = {5577-5582},
location = {Taipei, Taiwan},
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 graph into a forest of partial spanning trees (PSTs). Each
PST is then modified through a mechanism called Constrained
Spanning Tour (CST) to build a cycle which is then assigned to
an individual robot. Subsequently, robots start navigating the
cycles and consequently cover the whole area. We show that
the proposed approach is complete and robust with respect to
robot failure.},
bib2html_pubtype ={Refereed Conference Proceeding},
bib2html_rescat ={},
}
Generated by bib2html.pl (written by Patrick Riley ) on Wed Apr 23, 2014 19:08:35