Return
Distributed Continuous-Time Algorithms for Resource Allocation Problems Over Weight-Balanced Digraphs
DOI:10.1109/TCYB.2017.2759141.png)
Abstract
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.
Keywords:
Distributed optimization
multiagent systems
nonsmooth analysis
projected dynamical systems
resource allocation
weight-balanced digraphs
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.5
Papers:
1.1W
Citations:
5.0W
Organization
Cited Papers
Target containment control of multi-agent systems with random switching interconnection topologies
AUTOMATICA
IF5.9
Distributed Finite-Time Computation of Digraph Parameters: Left-Eigenvector, Out-Degree and Spectrum
Synthesis of Cu3P nanocubes and their excellent electrocatalytic efficiency for the hydrogen evolution reaction in acidic solution
RSC Advances
IF0

