Cooperative Coverage by Multiple Robots with Contact Sensors

Cooperative coverage by multiple robots with contact sensors is studied in this paper. Multiple robots internal spiral coverage algorithm is presented to overcome the sensing limitation of the robot whose sense range is the radius of the body. The algorithm guarantees complete coverage by repeating covering portion of the environment and setting the GATE grids. The algorithm is also robust in that even if there is only one robot without catastrophic failure it can complete the coverage. The competitive analysis is also made and the upper limitation of the competitive factor is presented. The simulation test and real experiment prove the feasibility of the algorithm.

[1]  Huang Qing-cheng.  Study of coverage path planning based on grid-map , 2007 .

[2]  Howie Choset,et al.  Limited communication, multi-robot team based coverage , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[3]  Noam Hazon,et al.  Redundancy, Efficiency and Robustness in Multi-Robot Coverage , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[4]  Israel A. Wagner,et al.  Distributed covering by ant-robots using evaporating traces , 1999, IEEE Trans. Robotics Autom..

[5]  Elon Rimon,et al.  Spanning-tree based coverage of continuous areas by a mobile robot , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[6]  Ralph L. Hollis,et al.  Contact sensor-based coverage of rectilinear environments , 1999, Proceedings of the 1999 IEEE International Symposium on Intelligent Control Intelligent Systems and Semiotics (Cat. No.99CH37014).

[7]  Gregory Dudek,et al.  Multi-Robot Exploration of an Unknown Environment, Efficiently Reducing the Odometry Error , 1997, IJCAI.

[8]  Elon Rimon,et al.  Spanning-tree based coverage of continuous areas by a mobile robot , 2004, Annals of Mathematics and Artificial Intelligence.