Complexities and Performance Limitations in Growing Time-Delay Noisy Linear Consensus Networks
| Autor: | Yaser Ghaedsharaf, Nader Motee |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
0209 industrial biotechnology
Mathematical optimization 021103 operations research Computer science Distributed computing Topology optimization 0211 other engineering and technologies Brute-force search 02 engineering and technology Square (algebra) 020901 industrial engineering & automation Control and Systems Engineering Focus (optics) Eigenvalues and eigenvectors |
| Zdroj: | IFAC-PapersOnLine. 49:228-233 |
| ISSN: | 2405-8963 |
| DOI: | 10.1016/j.ifacol.2016.10.401 |
| Popis: | This work investigates topology design for optimal performance in time-delay noisy networks. Performance of the network is measured by the square of the system’s H 2 -norm. The focus of this paper is on adding new interconnections to enhance performance of the time-delay first-order connected consensus network. We discuss complexity of topology optimization for delayed networks and develop two practical methods to tackle the combinatorial eigenvalue problem without exhaustive search or eigen-decomposition. Furthermore, we compare these methods and discuss their degrees of optimality. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|