.png){kind=icon}
返回
A Multi-Agent System With a Proportional-Integral Protocol for Distributed Constrained Optimization
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2016.2610945.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This technical note presents a continuous-time multi-agent system for distributed optimization with an additive objective function composed of individual objective functions subject to bound, equality, and inequality constraints. Each individual objective function is assumed to be convex in the region defined by its local bound constraints only without the need to be globally convex. All agents in the system communicate using a proportional-integral protocol with their output information instead of state information to reduce communication bandwidth. It is proved that all agents with any initial state can reach output consensus at an optimal solution to the given constrained optimization problem, provided that the graph describing the communication links among agents is undirected and connected. It is further proved that the system with only integral protocol is also convergent to the unique optimal solution if each individual objective function is strictly convex. Simulation results are presented to substantiate the theoretical results.
Keyword:
Consensus
distributed optimization
multi-agent systems
nonconvex objective functions
proportional-integral protocol
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
Distributed constrained optimal consensus of multi-agent systems多智能体系统的分布式约束最优一致性.png)
AUTOMATICA
AUTOMATICAIF5.9
PREAI
分享收藏分享收藏
分享收藏分享收藏
查看更多内容