| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 714746 | IFAC Proceedings Volumes | 2013 | 7 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
