Abstract
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.
Original language | English (US) |
---|---|
Article number | 7383274 |
Pages (from-to) | 499-510 |
Number of pages | 12 |
Journal | IEEE Transactions on Control of Network Systems |
Volume | 4 |
Issue number | 3 |
DOIs | |
State | Published - Sep 2017 |
Externally published | Yes |
Keywords
- Decentralized control
- game theory
- learning
- multiagent systems
ASJC Scopus subject areas
- Control and Systems Engineering
- Signal Processing
- Computer Networks and Communications
- Control and Optimization