.png){kind=icon}
返回
Distributed Continuous-Time Algorithms for Resource Allocation Problems Over Weight-Balanced Digraphs
.png){kind=icon}
PRE
AI
DOI：10.1109/TCYB.2017.2759141.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, a distributed resource allocation problem with nonsmooth local cost functions is considered, where the interaction among agents is depicted by strongly connected and weight-balanced digraphs. Here the decision variable of each agent is within a local feasibility constraint described as a convex set, and all the decision variables have to satisfy a network resource constraint, which is the sum of available resources. To solve the problem, a distributed continuous-time algorithm is developed by virtue of differentiated projection operations and differential inclusions, and its convergence to the optimal solution is proved via the set-valued LaSalle invariance principle. Furthermore, the exponential convergence of the proposed algorithm can be achieved when the local cost functions are differentiable with Lipschitz gradients and there are no local feasibility constraints. Finally, numerical examples are given to verify the effectiveness of the proposed algorithms.
Keyword:
Distributed optimization
multiagent systems
nonsmooth analysis
projected dynamical systems
resource allocation
weight-balanced digraphs
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.5
论文数:
1.1W
被引数:
5.0W
机构
引用论文
Target containment control of multi-agent systems with random switching interconnection topologies.png)
AUTOMATICA
AUTOMATICAIF5.9
PREAI
分享收藏Pressure-volume-temperature properties of amorphous polymers: empirical and theoretical predictions
PREAI
分享收藏Distributed Finite-Time Computation of Digraph Parameters: Left-Eigenvector, Out-Degree and Spectrum
PREAI
分享收藏Synthesis of Cu3P nanocubes and their excellent electrocatalytic efficiency for the hydrogen evolution reaction in acidic solutionRSC Advances
RSC AdvancesIF0
PREAI
分享收藏
查看更多内容