返回
A fixed-time convergent algorithm for distributed convex optimization in multi-agent systems
DOI:10.1016/j.automatica.2018.05.032.png)
摘要
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.
Keyword:
Distributed algorithm
Convex optimization
Equality constraint
Fixed-time convergence
Multi-agent system
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.9
论文数:
1.2W
被引数:
5.2W
机构
引用论文
Initialization-free distributed coordination for economic dispatch under varying loads and generator commitment
AUTOMATICA
IF5.9
Patients in palliative care—Development of a predictive model for anxiety using routine data
PLOS ONE
IF0
Nonsingular fixed-time consensus tracking for second-order multi-agent networks二阶多智能体网络的非奇异固定时间一致性跟踪
AUTOMATICA
IF5.9
Distributed Continuous-Time Optimization: Nonuniform Gradient Gains, Finite-Time Convergence, and Convex Constraint Set分布式连续时间优化: 非均匀梯度增益,有限时间收敛和凸约束集

