.png){kind=icon}
返回
Prescribed-time distributed optimization problem with constraints
.png){kind=icon}
PRE
AI
DOI：10.1016/j.isatra.2024.03.024.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Prescribed-time
Distributed optimization
Convex constraint
Convex set
期刊
IF:
6.5
论文数:
5.9K
被引数:
2.0W
机构
引用论文
Pheochromocytoma Crisis Caused by Contemporary Ergotamine, Caffeine, and Nimesulide Administration
PREAI
分享收藏
Resilient Bipartite Consensus of Second-Order Multiagent Systems With Event-Triggered Communication
PREAI
分享收藏Distributed Projection Subgradient Algorithm Over Time-Varying General Unbalanced Directed Graphs时变一般不平衡有向图上的分布式投影次梯度算法
PREAI
分享收藏Bridging the Fields of Solar Cell and Battery Research to Develop High-Performance Anodes for Photoelectrochemical Cells and Metal Ion Batteries.png)
Challenges
OAAI
ChallengesIF0
OAAI分享收藏
查看更多内容