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: | Mohammadreza Doostmohammadian, Alireza Aghasi, Apostolos I. Rikos, Andreas Grammenos, Evangelia Kalyvianaki, Christoforos N. Hadjicostis, Karl H. Johansson, Themistoklis Charalambous |
---|---|
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/ |
Similar Items
-
Makespan-Minimizing Heterogeneous Task Allocation under Temporal Constraints
by: Byeong-Min Jeong, et al.
Published: (2023-12-01) -
Distributed constrained aggregative games of uncertain Euler-Lagrange systems under unbalanced digraphs
by: Yanqiong Zhang, et al.
Published: (2022-05-01) -
4-Transitive Digraphs I: The Structure of Strong 4-Transitive Digraphs
by: Hernández-Cruz César
Published: (2013-05-01) -
On the General Sum Distance Spectra of Digraphs
by: Weige Xi, et al.
Published: (2023-01-01) -
(K − 1)-Kernels In Strong K-Transitive Digraphs
by: Wang Ruixia
Published: (2015-05-01)