Distributed abstract programs are a novel class of distributed optimization problems where (i) the number of variables is much smaller than the number of constraints and (ii) each constraint is associated to a network node. Abstract optimization programs are a generalization of linear programs that captures numerous geometric optimization problems. We propose novel constraints consensus algorithms for distributed abstract programs with guaranteed finite-time convergence to a global optimum. The algorithms rely upon solving local abstract programs and exchanging the solutions among neighboring processors. The proposed algorithms are appropriate for networks with weak time-dependent connectivity requirements and tight memory constraints. We show how the constraints consensus algorithms may be applied to suitable target localization and formation control problems.

Giuseppe Notarstefano, Francesco Bullo (2011). Distributed abstract optimization via constraints consensus: theory and applications. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 56, 2247-2261 [10.1109/TAC.2011.2164020].

Distributed abstract optimization via constraints consensus: theory and applications

Giuseppe Notarstefano;
2011

Abstract

Distributed abstract programs are a novel class of distributed optimization problems where (i) the number of variables is much smaller than the number of constraints and (ii) each constraint is associated to a network node. Abstract optimization programs are a generalization of linear programs that captures numerous geometric optimization problems. We propose novel constraints consensus algorithms for distributed abstract programs with guaranteed finite-time convergence to a global optimum. The algorithms rely upon solving local abstract programs and exchanging the solutions among neighboring processors. The proposed algorithms are appropriate for networks with weak time-dependent connectivity requirements and tight memory constraints. We show how the constraints consensus algorithms may be applied to suitable target localization and formation control problems.
2011
Giuseppe Notarstefano, Francesco Bullo (2011). Distributed abstract optimization via constraints consensus: theory and applications. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 56, 2247-2261 [10.1109/TAC.2011.2164020].
Giuseppe Notarstefano; Francesco Bullo
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.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11585/671821
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 67
  • ???jsp.display-item.citation.isi??? 58
social impact