On Multi-robot Area Coverage

Area coverage is one of the emerging problems in multi-robot coordination. In this task a team of robots is cooperatively trying to observe or sweep an entire area, possibly containing obstacles, with their sensors or actuators. The goal is to build an efficient path for each robot which jointly ensure that every single point in the environment can be seen or swept by at least one of the robots while performing the task.

[1]  Eli Packer,et al.  Computing Multiple Watchman Routes , 2008, WEA.

[2]  Wolfram Burgard,et al.  Collaborative multi-robot exploration , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[3]  C. Guestrin,et al.  Near-optimal sensor placements: maximizing information while minimizing communication cost , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.

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

[5]  Brian Yamauchi,et al.  Frontier-based exploration using multiple robots , 1998, AGENTS '98.

[6]  Joel W. Burdick,et al.  Multi-robot boundary coverage with plan revision , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[7]  Noa Agmon,et al.  The giving tree: constructing trees for efficient offline and online multi-robot coverage , 2008, Annals of Mathematics and Artificial Intelligence.

[8]  Howie Choset,et al.  Coverage for robotics – A survey of recent results , 2001, Annals of Mathematics and Artificial Intelligence.

[9]  Sonal Jain,et al.  Multi-robot forest coverage , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[10]  Miodrag Potkonjak,et al.  Coverage problems in wireless ad-hoc sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[11]  Noam Hazon,et al.  On redundancy, efficiency, and robustness in coverage for multiple robots , 2008, Robotics Auton. Syst..

[12]  Philippe Pasquier,et al.  Multi-robot area coverage with limited visibility , 2010, AAMAS.

[13]  Svante Carlsson,et al.  Optimum Guard Covers and $m$-Watchmen Routes for Restricted Polygons , 1993, Int. J. Comput. Geom. Appl..

[14]  J. O'Rourke.  Art gallery theorems and algorithms , 1987 .

[15]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[16]  Simeon C. Ntafos,et al.  Optimum watchman routes , 1986, SCG '86.

[17]  Pooyan Fazli.  On multi-robot area coverage , 2010, AAMAS.

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