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 various minimum-time formation control problems can be tackled through appropriate geometric examples of abstract linear programs.
Network abstract linear programming with application to minimum-time formation control / G. Notarstefano; F. Bullo. - STAMPA. - (2007), pp. 927-932. (Intervento presentato al convegno IEEE Conference on Decision and Control tenutosi a New Orleans nel December 2007) [10.1109/CDC.2007.4434701].
Network abstract linear programming with application to minimum-time formation control
G. Notarstefano;
2007
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 various minimum-time formation control problems can be tackled through appropriate geometric examples of abstract linear programs.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
