Distributed Resource Allocation Over Dynamic Networks With Uncertainty

DOI10.1109/TAC.2020.3041248zbMATH Open1471.93015arXiv1708.03543OpenAlexW3110154020MaRDI QIDQ4957736FDOQ4957736

Authors: Thinh T. Doan, Carolyn L. Beck 

Publication date: 9 September 2021

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Abstract: Motivated by broad applications in various fields of engineering, we study a network resource allocation problem where the goal is to optimally allocate a fixed quantity of resources over a network of nodes. We consider large scale networks with complex interconnection structures, thus any solution must be implemented in parallel and based only on local data resulting in a need for distributed algorithms. In this paper, we study a distributed Lagrangian method for such problems. By utilizing the so-called distributed subgradient methods to solve the dual problem, our approach eliminates the need for central coordination in updating the dual variables, which is often required in classic Lagrangian methods. Our focus is to understand the performance of this distributed algorithm when the number of resources is unknown and may be time-varying. In particular, we obtain an upper bound on the convergence rate of the algorithm to the optimal value, in expectation, as a function of the size and the topology of the underlying network. The effectiveness of the proposed method is demonstrated by its application to the economic dispatch problem in power systems, with simulations completed on the benchmark IEEE-14 and IEEE-118 bus test systems.

Full work available at URL: https://arxiv.org/abs/1708.03543

zbMATH Keywords

distributed algorithmsmulti-agent systemsdistributed optimization

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Distributed algorithms (68W15) Multi-agent systems (93A16) Networked control (93B70)

Cited In (7)

• A resource allocation game on network graphs with two uncertain factors
• Distributed resource allocation over random networks based on stochastic approximation
• Title not available (Why is that?)
• A local-minimization-free zero-gradient-sum algorithm for distributed optimization
• Dynamic Distributed Scheduling in Random Access Networks
• On the emergence of oscillations in distributed resource allocation
• Distributed resource allocation on dynamic networks in quadratic time

This page was built for publication: Distributed Resource Allocation Over Dynamic Networks With Uncertainty

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4957736)