Distributed Boundary Coverage with a Team of Networked Miniature Robots using a Robust Market-Based Algorithm
Name
Correll_Distributed boundary.pdf
Size
416.93 KB
Format
Adobe PDF
Checksum (MD5)
3af375ff1c638645b4a9a151c43ed95d
Author(s)
Amstutz, Patrick
Correll, Nikolaus
Martinoli, Alcherio
Date Issued
March 2009
Journal
Annals of Mathematics and Artificial Intelligence
Publisher
Springer Netherlands
Citation
P. Amstutz, N. Correll, and A. Martinoli, “Distributed boundary coverage with a team of networked miniature robots using a robust market-based algorithm,” Annals of Mathematics and Artificial Intelligence, vol. 52, Apr. 2008, pp. 307-333.
Version
Author's final manuscript
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.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s10472-009-9127-8
