Abstract
This work investigates performance of noisy time-delayed linear consensus networks from a graph topological point of view. Performance of the network is measured by the square of the H 2 -norm of the system. The focus of this paper is on noisy consensus networks with homogeneous time delays affecting both the agent and all its neighbors. We derive an exact expression for the performance measure of the network in terms of time delay parameter and Laplacian eigenvalues of the underlying graph of the network. It is shown that the performance measure is a convex and Schur-convex function of Laplacian eigenvalues. We characterize the network topology with optimal performance. Furthermore, we quantify a fundamental limit on the best achievable performance based on performance of the optimal topology.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.