Performance Improvement in Noisy Linear Consensus Networks With Time-Delay
| Autor: | Milad Siami, Nader Motee, Yaser Ghaedsharaf, Christoforos Somarakis |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
0209 industrial biotechnology
Computational complexity theory Computer science Systems and Control (eess.SY) 02 engineering and technology Graph Computer Science Applications Network planning and design 020901 industrial engineering & automation Control and Systems Engineering Norm (mathematics) FOS: Electrical engineering electronic engineering information engineering Computer Science - Systems and Control Topological graph theory Graph (abstract data type) Electrical and Electronic Engineering Performance improvement Convex function Algorithm Eigendecomposition of a matrix |
| Zdroj: | IEEE Transactions on Automatic Control. 64:2457-2472 |
| ISSN: | 2334-3303 0018-9286 |
| DOI: | 10.1109/tac.2018.2874675 |
| Popis: | 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. 16 pages, 11 figures |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|