.png){kind=icon}
.png){kind=icon}
Return
An Efficient Distributed Parallel Algorithm for Optimal Consensus of Multiagent Systems
.png){kind=icon}
PRE
AI
DOI：10.1109/TCNS.2023.3338245.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 O(1/t(2)) 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.
Keywords:
Optimization
Multi-agent systems
Convergence
Parallel algorithms
Jacobian matrices
Protocols
Costs
Convex optimization
distributed optimization
multiagent systems
optimal consensus
parallel algorithm
Journal
IF:
5
Papers:
1.6K
Citations:
5.8K