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.
|Original language||English (US)|
|Title of host publication||4th IFAC Workshop on Distributed Estimation and Control in Networked Systems, NecSys 2013 - Proceedings|
|Number of pages||7|
|State||Published - 2013|
|Event||4th IFAC Workshop on Distributed Estimation and Control in Networked Systems, NecSys 2013 - Koblenz, Germany|
Duration: Sep 25 2013 → Sep 26 2013
|Name||IFAC Proceedings Volumes (IFAC-PapersOnline)|
|Other||4th IFAC Workshop on Distributed Estimation and Control in Networked Systems, NecSys 2013|
|Period||9/25/13 → 9/26/13|
Bibliographical noteFunding Information:
This research was supported by ONR project #N00014-09-1-0751.