Distributed Anytime-Feasible Resource Allocation Subject to Heterogeneous Time-Varying Delays
This paper considers distributed allocation strategies, formulated as a distributed sum-preserving (fixed-sum) allocation of resources over a multi-agent network in the presence of heterogeneous arbitrary time-varying delays. We propose a double time-scale scenario for unknown delays and a faster si...
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2022-01-01
|
| Series: | IEEE Open Journal of Control Systems |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9904851/ |
| _version_ | 1797797529583091712 |
|---|---|
| author | Mohammadreza Doostmohammadian Alireza Aghasi Apostolos I. Rikos Andreas Grammenos Evangelia Kalyvianaki Christoforos N. Hadjicostis Karl H. Johansson Themistoklis Charalambous |
| author_facet | Mohammadreza Doostmohammadian Alireza Aghasi Apostolos I. Rikos Andreas Grammenos Evangelia Kalyvianaki Christoforos N. Hadjicostis Karl H. Johansson Themistoklis Charalambous |
| author_sort | Mohammadreza Doostmohammadian |
| collection | DOAJ |
| description | This paper considers distributed allocation strategies, formulated as a distributed sum-preserving (fixed-sum) allocation of resources over a multi-agent network in the presence of heterogeneous arbitrary time-varying delays. We propose a double time-scale scenario for unknown delays and a faster single time-scale scenario for known delays. Further, the links among the nodes are considered subject to certain nonlinearities (e.g, quantization and saturation/clipping). We discuss different models for nonlinearities and how they may affect the convergence, sum-preserving feasibility constraint, and solution optimality over general weight-balanced uniformly strongly connected networks and, further, time-delayed undirected networks. Our proposed scheme works in a variety of applications with general non-quadratic strongly-convex smooth objective functions. The non-quadratic part, for example, can be due to additive convex penalty or barrier functions to address the local box constraints. The network can change over time, is not necessarily connected at all times, but is only assumed to be uniformly-connected. The novelty of this work is to address all-time feasible Laplacian gradient solutions in presence of nonlinearities, switching digraph topology (not necessarily all-time connected), and heterogeneous time-varying delays. |
| first_indexed | 2024-03-13T03:49:44Z |
| format | Article |
| id | doaj.art-509a5d30a284401999ae122e88a0e914 |
| institution | Directory Open Access Journal |
| issn | 2694-085X |
| language | English |
| last_indexed | 2024-03-13T03:49:44Z |
| publishDate | 2022-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Open Journal of Control Systems |
| spelling | doaj.art-509a5d30a284401999ae122e88a0e9142023-06-22T16:06:43ZengIEEEIEEE Open Journal of Control Systems2694-085X2022-01-01125526710.1109/OJCSYS.2022.32104539904851Distributed Anytime-Feasible Resource Allocation Subject to Heterogeneous Time-Varying DelaysMohammadreza Doostmohammadian0https://orcid.org/0000-0003-0959-6608Alireza Aghasi1https://orcid.org/0000-0001-6029-9380Apostolos I. Rikos2https://orcid.org/0000-0002-8737-1984Andreas Grammenos3https://orcid.org/0000-0002-2525-5101Evangelia Kalyvianaki4https://orcid.org/0000-0003-0753-1261Christoforos N. Hadjicostis5https://orcid.org/0000-0002-1706-708XKarl H. Johansson6https://orcid.org/0000-0001-9940-5929Themistoklis Charalambous7https://orcid.org/0000-0003-4800-6738Department of Electrical Engineering and Automation, School of Electrical Engineering, Aalto University, Espoo, FinlandRobinson College of Business, Georgia State University, Atlanta, GA, USADivision of Decision and Control Systems, KTH Royal Institute of Technology, Stockholm, SwedenThe Alan Turing Institute, London, U.K.Department of Computer Science and Technology, University of Cambridge, Cambridge, U.K.Department of Electrical and Computer Engineering, School of Engineering, University of Cyprus, Nicosia, CyprusDivision of Decision and Control Systems, KTH Royal Institute of Technology, Stockholm, SwedenDepartment of Electrical Engineering and Automation, School of Electrical Engineering, Aalto University, Espoo, FinlandThis paper considers distributed allocation strategies, formulated as a distributed sum-preserving (fixed-sum) allocation of resources over a multi-agent network in the presence of heterogeneous arbitrary time-varying delays. We propose a double time-scale scenario for unknown delays and a faster single time-scale scenario for known delays. Further, the links among the nodes are considered subject to certain nonlinearities (e.g, quantization and saturation/clipping). We discuss different models for nonlinearities and how they may affect the convergence, sum-preserving feasibility constraint, and solution optimality over general weight-balanced uniformly strongly connected networks and, further, time-delayed undirected networks. Our proposed scheme works in a variety of applications with general non-quadratic strongly-convex smooth objective functions. The non-quadratic part, for example, can be due to additive convex penalty or barrier functions to address the local box constraints. The network can change over time, is not necessarily connected at all times, but is only assumed to be uniformly-connected. The novelty of this work is to address all-time feasible Laplacian gradient solutions in presence of nonlinearities, switching digraph topology (not necessarily all-time connected), and heterogeneous time-varying delays.https://ieeexplore.ieee.org/document/9904851/Allocation strategiesbalanced digraphsnetworked constrained optimizationsum-preserving coupling-constraint |
| spellingShingle | Mohammadreza Doostmohammadian Alireza Aghasi Apostolos I. Rikos Andreas Grammenos Evangelia Kalyvianaki Christoforos N. Hadjicostis Karl H. Johansson Themistoklis Charalambous Distributed Anytime-Feasible Resource Allocation Subject to Heterogeneous Time-Varying Delays IEEE Open Journal of Control Systems Allocation strategies balanced digraphs networked constrained optimization sum-preserving coupling-constraint |
| title | Distributed Anytime-Feasible Resource Allocation Subject to Heterogeneous Time-Varying Delays |
| title_full | Distributed Anytime-Feasible Resource Allocation Subject to Heterogeneous Time-Varying Delays |
| title_fullStr | Distributed Anytime-Feasible Resource Allocation Subject to Heterogeneous Time-Varying Delays |
| title_full_unstemmed | Distributed Anytime-Feasible Resource Allocation Subject to Heterogeneous Time-Varying Delays |
| title_short | Distributed Anytime-Feasible Resource Allocation Subject to Heterogeneous Time-Varying Delays |
| title_sort | distributed anytime feasible resource allocation subject to heterogeneous time varying delays |
| topic | Allocation strategies balanced digraphs networked constrained optimization sum-preserving coupling-constraint |
| url | https://ieeexplore.ieee.org/document/9904851/ |
| work_keys_str_mv | AT mohammadrezadoostmohammadian distributedanytimefeasibleresourceallocationsubjecttoheterogeneoustimevaryingdelays AT alirezaaghasi distributedanytimefeasibleresourceallocationsubjecttoheterogeneoustimevaryingdelays AT apostolosirikos distributedanytimefeasibleresourceallocationsubjecttoheterogeneoustimevaryingdelays AT andreasgrammenos distributedanytimefeasibleresourceallocationsubjecttoheterogeneoustimevaryingdelays AT evangeliakalyvianaki distributedanytimefeasibleresourceallocationsubjecttoheterogeneoustimevaryingdelays AT christoforosnhadjicostis distributedanytimefeasibleresourceallocationsubjecttoheterogeneoustimevaryingdelays AT karlhjohansson distributedanytimefeasibleresourceallocationsubjecttoheterogeneoustimevaryingdelays AT themistoklischaralambous distributedanytimefeasibleresourceallocationsubjecttoheterogeneoustimevaryingdelays |