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.
| Original language | English (US) |
|---|---|
| Title of host publication | 4th IFAC Workshop on Distributed Estimation and Control in Networked Systems, NecSys 2013 - Proceedings |
| Publisher | IFAC Secretariat |
| Pages | 309-315 |
| Number of pages | 7 |
| Edition | PART 1 |
| ISBN (Print) | 9783902823557 |
| DOIs | |
| State | Published - 2013 |
| Externally published | Yes |
| Event | 4th IFAC Workshop on Distributed Estimation and Control in Networked Systems, NecSys 2013 - Koblenz, Germany Duration: Sep 25 2013 → Sep 26 2013 |
Publication series
| Name | IFAC Proceedings Volumes (IFAC-PapersOnline) |
|---|---|
| Number | PART 1 |
| Volume | 4 |
| ISSN (Print) | 1474-6670 |
Other
| Other | 4th IFAC Workshop on Distributed Estimation and Control in Networked Systems, NecSys 2013 |
|---|---|
| Country/Territory | Germany |
| City | Koblenz |
| Period | 9/25/13 → 9/26/13 |
Bibliographical note
Funding Information:This research was supported by ONR project #N00014-09-1-0751.