Performance Improvement in Noisy Linear Consensus Networks With Time-Delay

From MaRDI portal
Publication:5223750

DOI10.1109/TAC.2018.2874675zbMATH Open1482.93190arXiv1810.08287OpenAlexW2897209813WikidataQ129117938 ScholiaQ129117938MaRDI QIDQ5223750FDOQ5223750


Authors: Yaser Ghaedsharaf, Milad Siami, Christoforos Somarakis, Nader Motee Edit this on Wikidata


Publication date: 18 July 2019

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

Abstract: We analyze performance of a class of time-delay first-order consensus networks from a graph topological perspective and present methods to improve it. The performance is measured by network's square of H-2 norm and it is shown that it is a convex function of Laplacian eigenvalues and the coupling weights of the underlying graph of the network. First, we propose a tight convex, but simple, approximation of the performance measure in order to achieve lower complexity in our design problems by eliminating the need for eigen-decomposition. The effect of time-delay reincarnates itself in the form of non-monotonicity, which results in nonintuitive behaviors of the performance as a function of graph topology. Next, we present three methods to improve the performance by growing, re-weighting, or sparsifying the underlying graph of the network. It is shown that our suggested algorithms provide near-optimal solutions with lower complexity with respect to existing methods in literature.


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







Cited In (3)





This page was built for publication: Performance Improvement in Noisy Linear Consensus Networks With Time-Delay

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