.png){kind=icon}
Return
Distributed Resource Allocation Over Directed Graphs via Continuous-Time Algorithms
.png){kind=icon}
PRE
AI
DOI：10.1109/TSMC.2019.2894862.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper investigates the resource allocation problem for a group of agents communicating over a strongly connected directed graph, where the total objective function of the problem is composted of the sum of the local objective functions incurred by the agents. With local convex sets, we first design a continuous-time projection algorithm over a strongly connected and weight-balanced directed graph. Our convergence analysis indicates that when the local objective functions are strongly convex, the output state of the projection algorithm could asymptotically converge to the optimal solution of the resource allocation problem. In particular, when the projection operation is not involved, we show the exponential convergence at the equilibrium point of the algorithm. Second, we propose an adaptive continuous-time gradient algorithm over a strongly connected and weight-unbalanced directed graph for the reduced case without local convex sets. In this case, we prove that the adaptive algorithm converges exponentially to the optimal solution of the considered problem, where the local objective functions and their gradients satisfy strong convexity and Lipachitz conditions, respectively. Numerical simulations illustrate the performance of our algorithms.
Keywords:
Adaptive algorithm
directed graphs
projection algorithm
resource allocation
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
ShareSaveShareSaveShareSaveShareSaveInitialization-free distributed coordination for economic dispatch under varying loads and generator commitment.png)
AUTOMATICA
OAAI
AUTOMATICAIF5.9
OAAIShareSaveShareSaveDistributed Finite-Time Computation of Digraph Parameters: Left-Eigenvector, Out-Degree and Spectrum
PREAI
ShareSave
View more