返回
A fixed-time gradient algorithm for distributed optimization with inequality constraints
DOI:10.1016/j.neucom.2023.02.022.png)
摘要
En 中文
In this paper, a distributed fixed time gradient algorithm for neurodynamic systems is proposed for solv-ing optimization problems with local inequality constraints. The algorithm is designed using fixed time theory and sliding model control techniques, where each agent has a local objective function known only to itself, and the optimal solution of each local objective function sum can be obtained in a fixed time by the information interaction between neighbors under the condition of local inequality constraints. In addition, the upper bound of the fixed time can be obtained and it is proved theoretically that the upper bound of the fixed time is independent of the initial value. Finally, the stability and effectiveness of the algorithm are verified by numerical examples.(c) 2023 Elsevier B.V. All rights reserved.
Keyword:
Gradient algorithm
Fixed time convergence
Distributed optimization
Load sharing control
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Distributed Optimization for Multiagent Systems: An Edge-Based Fixed-Time Consensus Approach多代理系统的分布式优化: 基于边缘的固定时间共识方法
Attitude tracking control for reentry vehicles using centralised robust model predictive control基于集中鲁棒模型预测控制的再入飞行器姿态跟踪控制
AUTOMATICA
IF5.9
A fixed-time convergent algorithm for distributed convex optimization in multi-agent systems多智能体系统中分布式凸优化的固定时间收敛算法
AUTOMATICA
IF5.9
Distributed Finite-Time Optimal Resource Management for Microgrids Based on Multi-Agent Framework基于多Agent框架的微电网分布式有限时间优化资源管理

