Network abstract linear programming with application to cooperative target localization

Abstract

We identify a novel class of distributed optimization problems, namely a networked version of abstract linear programming. For such problems we propose distributed algorithms for networks with various connectivity and/or memory constraints. Finally, we show how a suitable target localization problem can be tackled through appropriate linear programs. © 2009 Springer-Verlag Berlin Heidelberg.