In this paper, we present a communication-free algorithm for the distributed coverage of an arbitrary network by a group of mobile agents with local sensing capabilities. The network is represented as a graph, and the agents are arbitrarily deployed on some nodes of the graph. Any node of the graph is covered if it is within the sensing range of at least one agent. The agents are mobile devices that aim to explore the graph and to optimize their locations in a decentralized fashion by relying only on their sensory inputs. We formulate this problem in a game-theoretic setting and propose a communication-free learning algorithm to maximize the coverage.
Bibliographical noteFunding Information:
Manuscript received November 10, 2015; accepted December 26, 2015. Date of publication January 14, 2016; date of current version September 15, 2017. This work was supported by ONR project under Grant N00014-09-1-0751. Recommended by Editor-in-Chief I. Paschalidis.
- Decentralized control
- game theory
- multiagent systems