abstract: We identify a novel class of distributed optimization problems, namely networked version of abstract linear programming. For such problems we propose distributed algorithms for networks with various connectivity andor memory constraints. Finally, we show how various minimum-time formation control problems can be tackled through appropriate geometric examples of abstract linear programs.
Networkabstractlinearprogramming