TY - JOUR
T1 - Communication-Free Distributed Coverage for Networked Systems
AU - Yazicioglu, A. Yasin
AU - Egerstedt, Magnus
AU - Shamma, Jeff S.
N1 - KAUST Repository Item: Exported on 2020-10-01
Acknowledgements: This work was supported by ONR project #N00014-09-1-0751.
PY - 2016/1/15
Y1 - 2016/1/15
N2 - In this paper, we present a communication-free algorithm for 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 for maximizing the coverage.
AB - In this paper, we present a communication-free algorithm for 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 for maximizing the coverage.
UR - http://hdl.handle.net/10754/623709
UR - http://ieeexplore.ieee.org/document/7383274/
UR - http://www.scopus.com/inward/record.url?scp=85030128663&partnerID=8YFLogxK
U2 - 10.1109/tcns.2016.2518083
DO - 10.1109/tcns.2016.2518083
M3 - Article
SN - 2325-5870
VL - 4
SP - 499
EP - 510
JO - IEEE Transactions on Control of Network Systems
JF - IEEE Transactions on Control of Network Systems
IS - 3
ER -