.png){kind=icon}
Return
Prescribed-time distributed optimization problem with constraints
.png){kind=icon}
PRE
AI
DOI：10.1016/j.isatra.2024.03.024.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In recent years, distributed optimization problem have a wide range of applications in various fields. This paper considers the prescribed-time distributed optimization problem with/without constraints. Firstly, we assume the state of each agent is constrained, and the prescribed-time distributed optimization algorithm with constraints is designed on the basis of gradient projection algorithm and consensus algorithm. Secondly, the constrained distributed optimization problem is transformed into the unconstrained distributed optimization problem, and according to the gradient descent algorithm and consensus algorithm, we also propose the prescribed-time distributed optimization algorithm without constraints. By designing the appropriate objective functions, we prove the multi-agent system can converge to the optimal solution within any prescribed-time, and the convergence time is fully independent of the initial conditions and system parameters. Finally, three simulation examples are provided to verify the validity of the designed algorithms.
Keywords:
Prescribed-time
Distributed optimization
Convex constraint
Convex set
Journal
IF:
6.5
Papers:
5.9K
Citations:
2.0W
Organization
Cited Papers
Pheochromocytoma Crisis Caused by Contemporary Ergotamine, Caffeine, and Nimesulide Administration
PREAI
ShareSaveShareSaveShareSave
ShareSaveResilient Bipartite Consensus of Second-Order Multiagent Systems With Event-Triggered Communication
PREAI
ShareSaveDistributed Projection Subgradient Algorithm Over Time-Varying General Unbalanced Directed Graphs
PREAI
ShareSaveBridging the Fields of Solar Cell and Battery Research to Develop High-Performance Anodes for Photoelectrochemical Cells and Metal Ion Batteries.png)
Challenges
OAAI
ChallengesIF0
OAAIShareSave
View more