.png){kind=icon}
Return
A fixed-time convergent algorithm for distributed convex optimization in multi-agent systems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.automatica.2018.05.032.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This technical paper presents a distributed continuous-time algorithm to solve multi-agent optimization problem with the team objective being the sum of all local convex objective functions while subject to an equality constraint. The optimal solutions are achieved within fixed time which is independent of the initial conditions of agents. This advantage makes it possible to off-line preassign the settling time according to task requirements. The fixed-time convergence for the proposed algorithm is rigorously proved with the aid of convex optimization and fixed-time Lyapunov theory. Finally, the algorithm is valuated via an example. (C) 2018 Elsevier Ltd. All rights reserved.
Keywords:
Distributed algorithm
Convex optimization
Equality constraint
Fixed-time convergence
Multi-agent system
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.9
Papers:
1.2W
Citations:
5.2W
Organization
Cited Papers
Pheochromocytoma Crisis Caused by Contemporary Ergotamine, Caffeine, and Nimesulide Administration
PREAI
ShareSaveShareSaveInitialization-free distributed coordination for economic dispatch under varying loads and generator commitment.png)
AUTOMATICA
OAAI
AUTOMATICAIF5.9
OAAIShareSavePatients in palliative care—Development of a predictive model for anxiety using routine dataPLOS ONEOAAI
PLOS ONEIF0
OAAIShareSave
ShareSave
View more