dc.contributor.author | Rikos, Apostolos I. | en |
dc.contributor.author | Hadjicostis, Christoforos N. | en |
dc.creator | Rikos, Apostolos I. | en |
dc.creator | Hadjicostis, Christoforos N. | en |
dc.date.accessioned | 2021-01-26T09:45:59Z | |
dc.date.available | 2021-01-26T09:45:59Z | |
dc.date.issued | 2018 | |
dc.identifier.issn | 2325-5870 | |
dc.identifier.uri | http://gnosis.library.ucy.ac.cy/handle/7/63492 | |
dc.description.abstract | A digraph with positive weights on its edges is weight-balanced if, for each node, the sum of the weights of the incoming edges is equal to the sum of the weights of the outgoing edges. Weight-balanced digraphs play an important role in a variety of cooperative control problems, including formation control, event-triggered coordination, distributed averaging, and optimization. Classical distributed algorithms for asymptotic average consensus typically assume timely and reliable exchange of information between neighboring components of a given multicomponent system. These assumptions are not necessarily valid in practice due to varying delays that might affect computations at different nodes and/or transmissions at different links. In this paper, we propose a distributed algorithm that solves the integer weight balancing problem in the presence of arbitrary (time-varying and inhomogeneous) time delays that might affect the transmission at a particular link at a particular time. The algorithm converges after a finite number of steps (that we explicitly bound) in the presence of bounded delays and converges in finite time (with probability one) in the case of unbounded delays (packet drops). Furthermore, we show that the resulting weight-balanced digraph is unique regardless of how time delays or packet drops manifest themselves. We also analyze the computational and communication complexity of the proposed algorithm, and provide examples to illustrate its operation and performance. | en |
dc.source | IEEE Transactions on Control of Network Systems | en |
dc.title | Distributed Integer Weight Balancing in the Presence of Time Delays in Directed Graphs | en |
dc.type | info:eu-repo/semantics/article | |
dc.identifier.doi | 10.1109/TCNS.2017.2702392 | |
dc.description.volume | 5 | |
dc.description.issue | 3 | |
dc.description.startingpage | 1300 | |
dc.description.endingpage | 1309 | |
dc.author.faculty | Πολυτεχνική Σχολή / Faculty of Engineering | |
dc.author.department | Τμήμα Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών / Department of Electrical and Computer Engineering | |
dc.type.uhtype | Article | en |
dc.contributor.orcid | Hadjicostis, Christoforos N. [0000-0002-1706-708X] | |
dc.contributor.orcid | Rikos, Apostolos I. [0000-0002-8737-1984] | |
dc.gnosis.orcid | 0000-0002-1706-708X | |
dc.gnosis.orcid | 0000-0002-8737-1984 | |