.png){kind=icon}
返回
Designing Zero-Gradient-Sum Protocols for Finite-Time Distributed Optimization Problem
.png){kind=icon}
PRE
AI
DOI：10.1109/TSMC.2021.3098641.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this article, the distributed finite-time and fixed-time optimization problems are investigated by adopting the zero-gradient-sum (ZGS) framework in multiagent systems. Specifically, when the local convex functions are nonquadratic, a basic optimization protocol is proposed to obtain a finite-time convergence, such that the networked system can cooperatively seek the optimal solution of the global objective, the sum of local objective, in a limited time. By utilizing the property of quadratic functions, a reduced algorithm can remove the dependence of initial conditions in the estimation of the upper bound of settling time and achieve a fixed-time result. Besides, the problem with time-varying topologies is studied by introducing a modified algorithm with an artificial potential function to preserve the network connectivity. Finally, the validity of the protocols is demonstrated via some example simulations.
Keyword:
Optimization
Protocols
Convergence
Multi-agent systems
Convex functions
Topology
Upper bound
Convex optimization
distributed protocol
finite-time stability
multiagent system
期刊
IF:
10.5
论文数:
1.1W
被引数:
5.0W
机构
引用论文
Pheochromocytoma Crisis Caused by Contemporary Ergotamine, Caffeine, and Nimesulide Administration
PREAI
分享收藏Distributed Optimization for Multiagent Systems: An Edge-Based Fixed-Time Consensus Approach多代理系统的分布式优化: 基于边缘的固定时间共识方法
PREAI
分享收藏
A fixed-time convergent algorithm for distributed convex optimization in multi-agent systems多智能体系统中分布式凸优化的固定时间收敛算法.png)
AUTOMATICA
AUTOMATICAIF5.9
PREAI
分享收藏KINEMATIC ANALYSIS AND PROTOTYPE OF A METAMORPHIC ANTHROPOMORPHIC HAND WITH A RECONFIGURABLE PALM
PREAI
分享收藏
查看更多内容