Fast-Convergent Anytime-Feasible Dynamics for Distributed Allocation of Resources over Switching Sparse Networks with Quantized Communication Links
Loading...
Access rights
openAccess
acceptedVersion
URL
Journal Title
Journal ISSN
Volume Title
A4 Artikkeli konferenssijulkaisussa
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Date
Major/Subject
Mcode
Degree programme
Language
en
Pages
6
Series
2022 European Control Conference, ECC 2022, pp. 84-89
Abstract
This paper proposes anytime feasible networked dynamics to solve resource allocation problems over time-varying multi-agent networks. The state of agents represents the assigned resources while their total (equal to demand) is constant. The idea is to optimally allocate the resources among the group of agents by minimizing the overall cost subject to fixed sum of resources. Each agent's information is local and restricted to its own state, cost function, and the ones from its immediate neighbors. This work provides a fast convergent solution (compared to linear dynamics) while considering more-relaxed uniform network connectivity and (logarithmic) quantized communications among agents. The proposed dynamics reaches optimal solution over switching (sparsely-connected) undirected networks as far as their union over some bounded non-overlapping time-intervals has a spanning tree. Moreover, we prove anytime-feasibility of the solution, uniqueness, and convergence to the optimal value irrespective of the specific nonlinearity in the proposed dynamics. Such general proof analysis applies to many similar 1st-order allocation dynamics subject to strongly sign-preserving nonlinearities, e.g., actuator saturation in generator coordination. Further, anytime feasibility (despite the nonlinearities) ensures that our solution satisfies the fixed-sum resources constraint at all times.Description
Publisher Copyright: © 2022 EUCA.
Other note
Citation
Doostmohammadian, M, Aghasi, A, Pirani, M, Nekouei, E, Khan, U A & Charalambous, T 2022, Fast-Convergent Anytime-Feasible Dynamics for Distributed Allocation of Resources over Switching Sparse Networks with Quantized Communication Links. in 2022 European Control Conference, ECC 2022. 2022 European Control Conference, ECC 2022, European Control Association, pp. 84-89, European Control Conference, London, United Kingdom, 12/07/2022. https://doi.org/10.23919/ECC55457.2022.9838141