Distributed Coverage Games for Energy-Aware Mobile Sensor Networks
Author(s)
Zhu, Minghui; Martínez, Sonia
DownloadZhu-2013-Distributed coverage games for energy-aware mobile sensor networks.pdf (408.1Kb)
PUBLISHER_POLICY
Publisher Policy
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Terms of use
Metadata
Show full item recordAbstract
Inspired by current challenges in data-intensive and energy-limited sensor networks, we formulate a coverage optimization problem for mobile sensors as a (constrained) repeated multiplayer game. Each sensor tries to optimize its own coverage while minimizing the processing/energy cost. The sensors are subject to the informational restriction that the environmental distribution function is unknown a priori. We present two distributed learning algorithms where each sensor only remembers its own utility values and actions played during the last plays. These algorithms are proven to be convergent in probability to the set of (constrained) Nash equilibria and global optima of a certain coverage performance metric, respectively. Numerical examples are provided to verify the performance of our proposed algorithms.
Date issued
2013-01Department
Massachusetts Institute of Technology. Laboratory for Information and Decision SystemsJournal
SIAM Journal on Control and Optimization
Publisher
Society for Industrial and Applied Mathematics
Citation
Zhu, Minghui, and Sonia Martínez. “Distributed Coverage Games for Energy-Aware Mobile Sensor Networks.” SIAM Journal on Control and Optimization 51, no. 1 (January 2013): 1-27. © 2013, Society for Industrial and Applied Mathematics
Version: Final published version
ISSN
0363-0129
1095-7138