Distributed boundary coverage with a team of networked miniature robots using a robust market-based algorithm

We study distributed boundary coverage of known environments using a team of miniature robots. Distributed boundary coverage is an instance of the multi-robot task-allocation problem and has applications in inspection, cleaning, and painting among others. The proposed algorithm is robust to sensor and actuator noise, failure of individual robots, and communication loss. We use a market-based algorithm with known lower bounds on the performance to allocate the environmental objects of interest among the team of robots. The coverage time for systems subject to sensor and actuator noise is significantly shortended by on-line task re-allocation. The complexity and convergence properties of the algorithm are formally analyzed. The system performance is systematically analyzed at two different microscopic modeling levels, using agent-based, discrete-event and module-based, realistic simulators. Finally, results obtained in simulation are validated using a team of Alice miniature robots involved in a distributed inspection case study.

[1]  Lynne E. Parker,et al.  Multi-Robot Systems: From Swarms to Intelligent Automata , 2002, Springer Netherlands.

[2]  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..

[3]  R. Ravi,et al.  Min-max tree covers of graphs , 2004, Oper. Res. Lett..

[4]  Alcherio Martinoli,et al.  Modeling Swarm Robotic Systems: a Case Study in Collaborative Distributed Manipulation , 2004, Int. J. Robotics Res..

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

[6]  Nikolaus Correll,et al.  Collaborative coverage using a swarm of networked miniature robots , 2009, Robotics Auton. Syst..

[7]  Anthony Stentz,et al.  A Free Market Architecture for Distributed Control of a Multirobot System , 2000 .

[8]  Chul E. Kim,et al.  Approximation algorithms for some routing problems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[9]  Nikolaus Correll,et al.  Comparing Coordination Schemes for Miniature Robotic Swarms: A Case Study in Boundary Coverage of Regular Structures , 2006, ISER.

[10]  Howie Choset,et al.  Path Planning for Robotic Demining: Robust Sensor-Based Coverage of Unstructured Environments and Probabilistic Methods , 2003, Int. J. Robotics Res..

[11]  Howie Choset,et al.  Distributed Coverage of Unknown/Unstructured Environments by Mobile Sensor Networks , 2005 .

[12]  Kristina Lerman,et al.  Analysis of Dynamic Task Allocation in Multi-Robot Systems , 2006, Int. J. Robotics Res..

[13]  Maja J. Mataric,et al.  Sold!: auction methods for multirobot coordination , 2002, IEEE Trans. Robotics Autom..

[14]  Nidhi Kalra,et al.  Hoplites: A Market-Based Framework for Planned Tight Coordination in Multirobot Teams , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[15]  Noam Hazon,et al.  Towards robust on-line multi-robot coverage , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[16]  Bernhard Nebel,et al.  Dynamic decentralized area partitioning for cooperating cleaning robots , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[17]  Joel W. Burdick,et al.  A Coverage Algorithm for Multi-robot Boundary Inspection , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[18]  Kristina Lerman,et al.  A Review of Probabilistic Macroscopic Models for Swarm Robotic Systems , 2004, Swarm Robotics.

[19]  Sven Koenig,et al.  Robot exploration with combinatorial auctions , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[20]  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).

[21]  Evangelos Markakis,et al.  Auction-Based Multi-Robot Routing , 2005, Robotics: Science and Systems.

[22]  Nicolaus Correll,et al.  Coordination schemes for distributed boundary coverage with a swarm of miniature robots - synthesis, analysis and experimental validation , 2007 .

[23]  Anthony Stentz,et al.  Market-based Multirobot Coordination for Complex Tasks , 2006, Int. J. Robotics Res..

[24]  Michail G. Lagoudakis,et al.  The Generation of Bidding Rules for Auction-Based Robot Coordination , 2005 .

[25]  Nikolaus Correll,et al.  Robust Self-Localization in Industrial Environments based on 3D Ceiling Structures , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[26]  Nidhi Kalra,et al.  Market-Based Multirobot Coordination: A Survey and Analysis , 2006, Proceedings of the IEEE.

[27]  Bala Kalyanasundaram,et al.  Not All Insertion Methods Yield Constant Approximate Tours in the Euclidean Plane , 1994, Theor. Comput. Sci..

[28]  Roland Siegwart,et al.  Mobile micro-robots ready to use: Alice , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[29]  Nikolaus Correll,et al.  Robust Distributed Coverage using a Swarm of Miniature Robots , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[30]  Anthony Stentz,et al.  Multi-robot exploration controlled by a market economy , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[31]  Olivier Michel,et al.  Cyberbotics Ltd. Webots™: Professional Mobile Robot Simulation , 2004, ArXiv.

[32]  Wolfram Burgard,et al.  Robotics: Science and Systems XV , 2010 .

[33]  Olivier Michel,et al.  Cyberbotics Ltd. Webots™: Professional Mobile Robot Simulation , 2004 .