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

Authors:
Patrick Amstutz;Nikolaus Correll;Alcherio Martinoli
Affiliations:
Distributed Intelligent Systems and Algorithms Laboratory, École Polytechnique Fédérale Lausanne, Lausanne, Switzerland 1015;Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, USA 02139;Distributed Intelligent Systems and Algorithms Laboratory, École Polytechnique Fédérale Lausanne, Lausanne, Switzerland 1015
Venue:
Annals of Mathematics and Artificial Intelligence
Year:
2008

Citing 6
Cited 3

Not all insertion methods yield constant approximate tours in the Euclidean plane

Theoretical Computer Science
Spanning-tree based coverage of continuous areas by a mobile robot

Annals of Mathematics and Artificial Intelligence
Analysis of Dynamic Task Allocation in Multi-Robot Systems

International Journal of Robotics Research
Collaborative coverage using a swarm of networked miniature robots

Robotics and Autonomous Systems
A review of probabilistic macroscopic models for swarm robotic systems

SAB'04 Proceedings of the 2004 international conference on Swarm Robotics
Min-max tree covers of graphs

Operations Research Letters

Indoor robot gardening: design and implementation

Intelligent Service Robotics
Multirobot forest coverage for weighted and unweighted terrain

IEEE Transactions on Robotics
Multi-robot repeated area coverage

Autonomous Robots

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.