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.
G. Notarstefano, F. Bullo (2007). Network abstract linear programming with application to minimum-time formation control. USA : IEEE [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.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.
