A Game Theoretic Approach to Distributed Coverage of Graphs by Heterogeneous Mobile Agents
Yazıcıoğlu, A. Yasin
Egerstedt, Magnus B.
Shamma, Jeff S.
MetadataShow full item record
In this paper, we study the problem of covering an apriori unknown network structure by a group of mobile agents with possibly nonidentical coverage and communication capabilities. The network is represented as a graph, and the agents are mobile devices that explore and cover the graph in a decentralized fashion. We study this problem in a game theoretic setting and achieve optimal coverage through learning in games.