Abstract
In this paper we present an algorithmic solution for the distributed, complete coverage, path planning problem. Real world applications such as lawn mowing, chemical spill clean-up, and humanitarian de-mining can be automated by the employment of a team of autonomous mobile robots. Our approach builds on a single robot coverage algorithm. A greedy auction algorithm (a market based mechanism) is used for task reallocation among the robots. The robots are initially distributed through space and each robot is allocated a virtually bounded area to cover. Communication between the robots is available without any restrictions. © 2005 Springer.
Author supplied keywords
Cite
CITATION STYLE
Rekleitis, I., New, A. P., & Choset, H. (2005). Distributed coverage of unknown/unstructured environments by mobile sensor networks. In Multi-Robot Systems. From Swarms to Intelligent Automata - Proceedings from the 2005 International Workshop on Multi-Robot Systems (Vol. 3, pp. 145–155). Kluwer Academic Publishers. https://doi.org/10.1007/1-4020-3389-3_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
