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.
G. NOTARSTEFANO, BULLO F (2009). Network Abstract Linear Programming with Application to Cooperative Target Localization. DEU : SPRINGER [10.1007/978-3-642-03199-1_11].
Network Abstract Linear Programming with Application to Cooperative Target Localization
G. NOTARSTEFANO;
2009
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.File in questo prodotto:
Eventuali allegati, non sono esposti
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
