Distributed multi-step subgradient optimization for multi-agent system

This paper proposes a novel multi-step subgradient scheme to solve distributed optimization problem with a balanced digraph. To this end, matrix diameter and radius are first introduced to describe the convergence rate of the adjacency matrix. Then, we propose a hierarchical and recursive observer t...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Systems & control letters Ročník 128; s. 26 - 33
Hlavní autori:	Li, Chaoyong, Chen, Sai, Li, Jianqing, Wang, Feng
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.06.2019
Predmet:	Consensus Distributed control subgradient algorithm Distributed optimization Multi-agent system Distributed control subgradient algorithm Distributed optimization Multi-agent system Consensus
ISSN:	0167-6911, 1872-7956
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	This paper proposes a novel multi-step subgradient scheme to solve distributed optimization problem with a balanced digraph. To this end, matrix diameter and radius are first introduced to describe the convergence rate of the adjacency matrix. Then, we propose a hierarchical and recursive observer to estimate the desired optimal solution, and we prove that the proposed strategy can asymptotically obtain an optimal solution, while all networked systems achieve a consensus among estimates in a finite-time. Simulation results verified the effectiveness of the proposed algorithm.
ISSN:	0167-6911 1872-7956
DOI:	10.1016/j.sysconle.2019.04.008