.png){kind=icon}
返回
Distributed Algorithm for Solving Convex Inequalities
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2017.2771140.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this note, a distributed subgradient-based algorithm is proposed for continuous-time multi-agent systems to search a feasible solution to convex inequalities. The algorithm involves each agent achieving a state constrained by its own inequalities while exchanging local information with other agents under a time-varying directed communication graph. With the validity of a mild connectivity condition associated with the communication graph, it is shown that all agents will reach agreement asymptotically and the consensus state is in the solution set of the inequalities. Furthermore, the method is also extended to solving the distributed optimization problem of minimizing the sum of local objective functions subject to convex inequalities. Simulation examples are presented to demonstrate the effectiveness of the theoretical results.
Keyword:
Consensus
convex inequalities
distributed optimization
multi-agent system (MAS)
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
Distributed Continuous-Time Convex Optimization With Time-Varying Cost Functions具有时变成本函数的分布式连续时间凸优化
OAAI
OAAI分享收藏Equilibrium topology of multi-agent systems with two leaders: A zero-sum game perspective.png)
AUTOMATICA
AUTOMATICAIF5.9
PREAI
分享收藏
查看更多内容