An Efficient Distributed Parallel Algorithm for Optimal Consensus of Multiagent Systems

A parallel algorithm is presented in this article to efficiently solve the optimal consensus problem of multiagent systems. By utilizing a Jacobi-type proximal alternating direction multiplier framework, the optimization process is divided into two independent subproblems that can be solved in paral...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on control of network systems Ročník 11; číslo 3; s. 1440 - 1451
Hlavní autoři: Bai, Nan, Wang, Qishao, Duan, Zhisheng
Médium: Journal Article
Jazyk:angličtina
Vydáno: Piscataway IEEE 01.09.2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Convergence
Convex optimization
Convexity
Costs
distributed optimization
Jacobian matrices
Lagrange multiplier
Multi-agent systems
Multiagent systems
optimal consensus
Optimization
parallel algorithm
Parallel algorithms
Parameters
Protocols
ISSN:2325-5870, 2372-2533
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:A parallel algorithm is presented in this article to efficiently solve the optimal consensus problem of multiagent systems. By utilizing a Jacobi-type proximal alternating direction multiplier framework, the optimization process is divided into two independent subproblems that can be solved in parallel to improve computational efficiency, followed by the Lagrangian multiplier update. The convergence analysis of the proposed algorithm is performed using the convex optimization theory, deriving the convergence conditions concerning the auxiliary parameters. Furthermore, the accelerated algorithm enjoys a convergence rate of <inline-formula><tex-math notation="LaTeX">\mathcal {O}(\frac{1}{t^{2}})</tex-math></inline-formula> by adjusting the auxiliary parameters adaptively. To leverage the strengths of the collaboration of multiagent systems, the distributed implementation of the proposed parallel algorithm is further developed, where each agent addresses its private subproblems only using its own and its neighbor's information. Numerical simulations demonstrate the effectiveness of the theoretical results.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2325-5870
2372-2533
DOI:10.1109/TCNS.2023.3338245