Loading [MathJax]/extensions/MathZoom.js
Performance Improvement in Noisy Linear Consensus Networks With Time-Delay | IEEE Journals & Magazine | IEEE Xplore

Performance Improvement in Noisy Linear Consensus Networks With Time-Delay


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. Performance is meas...Show More

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. Performance is measured by network's square of H2 norm and it is derived in closed form. Moreover, we prove that performance is a convex function of the coupling weights of the underlying graph. We demonstrate that the effect of time-delay reincarnates itself in the form of non-monotonicity, leading to counter-intuitive behaviors of the performance as a function of graph topology. For the network design problem, we propose a tight but simple approximation of the performance measure in order to achieve lower complexity in our problems by eliminating the computationally expensive need for eigendecomposition. More specifically, we discuss three H2-based optimal design methods to enhance performance. The proposed algorithms provide near-optimal solutions with improved computational complexity as opposed to existing methods in the literature.
Published in: IEEE Transactions on Automatic Control ( Volume: 64, Issue: 6, June 2019)
Page(s): 2457 - 2472
Date of Publication: 07 October 2018

ISSN Information:

Funding Agency:


References

References is not available for this document.