The giving tree: constructing trees for efficient offline and online multi-robot coverage

This paper discusses the problem of building efficient coverage paths for a team of robots. An efficient multi-robot coverage algorithm should result in a coverage path for every robot, such that the union of all paths generates a full coverage of the terrain and the total coverage time is minimized. A method underlying several coverage algorithms, suggests the use of spanning trees as base for creating coverage paths. However, overall performance of the coverage is heavily dependent on the given spanning tree. This paper focuses on the challenge of constructing a coverage spanning tree for both online and offline coverage that minimizes the time to complete coverage. Our general approach involves building a spanning tree by growing sub-trees from the initial location of the robots. This paper first describes a polynomial time tree-construction algorithm for offline coverage. The use of this algorithm is shown by extensive simulations to significantly improve the coverage time of the terrain even when used as a basis for a simple, inefficient, coverage algorithm. Second, this paper provides an algorithm for online coverage of a finite terrain based on spanning-trees, that is complete and guarantees linear time coverage with no redundancy in the coverage. In addition, the solutions proposed by this paper guarantee robustness to failing robots: the offline trees are used as base for robust multi-robot coverage algorithms, and the online algorithm is proven to be robust.

[1]  Elon Rimon,et al.  Competitive on-line coverage of grid environments by a mobile robot , 2003, Comput. Geom..

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

[3]  Mark Levene,et al.  Brick& Mortar: an on-line multi-agent exploration algorithm , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[4]  Noa Agmon,et al.  Constructing spanning trees for efficient multi-robot coverage , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[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]  Ioannis M. Rekleitis,et al.  Distributed coverage with multi-robot system , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

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

[8]  Israel A. Wagner,et al.  MAC Versus PC: Determinism and Randomness as Complementary Approaches to Robotic Exploration of Continuous Unknown Domains , 2000, Int. J. Robotics Res..

[9]  Israel A. Wagner,et al.  Robust and Efficient Covering of Unknown Continuous Domains with Simple, Ant-Like A(ge)nts , 2008, Int. J. Robotics Res..

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

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

[12]  Gregory Dudek,et al.  Multi-robot collaboration for robust exploration , 2004, Annals of Mathematics and Artificial Intelligence.

[13]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[14]  Howie Choset,et al.  Robust sensor-based coverage of unstructured environments , 2001, Proceedings 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems. Expanding the Societal Role of Robotics in the the Next Millennium (Cat. No.01CH37180).

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

[16]  Gaurav S. Sukhatme,et al.  Spreading Out: A Local Approach to Multi-robot Coverage , 2002, DARS.

[17]  Richard T. Vaughan,et al.  The Player/Stage Project: Tools for Multi-Robot and Distributed Sensor Systems , 2003 .

[18]  Ernest L. Hall,et al.  Region filling operations for mobile robot using computer graphics , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[19]  Sven Koenig,et al.  Building Terrain-Covering Ant Robots: A Feasibility Study , 2004, Auton. Robots.

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

[21]  Ralph L. Hollis,et al.  Complete distributed coverage of rectilinear environments , 2000 .