Distributed coverage games for mobile visual sensors (II): Reaching the set of Global Optima

Minghui Zhu and Sonia Martínez
48th IEEE Int. Conference on Decision and Control and 28th Chinese Control Conference, Shanghai, China, December 2009

Abstract:

We formulate a coverage optimization problem for mobile visual sensor networks as a repeated multi-player game. Each visual sensor tries to optimize its own coverage while minimizing the processing cost. We present an asynchronous distributed learning algorithm where each sensor only remembers the utility values obtained by its neighbors and itself, and the actions it played during the last two time steps when it was active. We show that this algorithm is convergent in probability to the set of global optima of certain coverage performance metric.

File: main.pdf

Bib-tex entry:

@InProceedings{MZ-SM:09ii-cdc,
author = {M. Zhu and S. Mart{\'\i}nez},
booktitle = {Proceedings of the 48th IEEE International Conference on Decision and Control and 28th Chinese Control Conference},
title = {Distributed coverage games for mobile visual sensors (II): {R}eaching the set of {G}lobal {O}ptima},
year = {2009},
month = {December},
address = {Shanghai, China},
pages = {174--180}
}