Please use this identifier to cite or link to this item: https://doi.org/10.1109/ROBOT.2005.1570202
Title: Complete multi-robot coverage of unknown environments with minimum repeated coverage
Authors: Ge, S.S. 
Fua, C.-H.
Keywords: Bounded cover time
Complete coverage
Minimum repeated coverage
Multi-robots
Issue Date: 2005
Source: Ge, S.S.,Fua, C.-H. (2005). Complete multi-robot coverage of unknown environments with minimum repeated coverage. Proceedings - IEEE International Conference on Robotics and Automation 2005 : 715-720. ScholarBank@NUS Repository. https://doi.org/10.1109/ROBOT.2005.1570202
Abstract: In this paper, an algorithm for the complete multi-robot coverage of a connected space with unknown obstacles is presented. The proposed algorithm mainly operates by maintaining, as far as possible, small uncovered regions between covered areas and obstacles. In addition, the bounds on the amount of repeated coverage and time required for complete coverage are also investigated. Furthermore, it is shown that repeated coverage can occur only around regions where the paths between obstacles are less than twice the width of the robots' coverage range. This property holds even when the robots have no a priori knowledge of the environment, and therefore helps to prevent unnecessary wastage of time and resources. © 2005 IEEE.
Source Title: Proceedings - IEEE International Conference on Robotics and Automation
URI: http://scholarbank.nus.edu.sg/handle/10635/69659
ISBN: 078038914X
ISSN: 10504729
DOI: 10.1109/ROBOT.2005.1570202
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

32
checked on Dec 11, 2017

Page view(s)

18
checked on Dec 9, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.