Abstract
We consider network structures that optimize the H2 norm of weighted, time scaled consensus networks, under a minimal representation of such consensus networks described by the edge Laplacian. We show that a greedy algorithm can be used to find the minimum-H2 norm spanning tree, as well as how to choose edges to optimize the H2 norm when edges are added back to a spanning tree. In the case of edge consensus with a measurement model considering all edges in the graph, we show that adding edges between slow nodes in the graph provides the smallest increase in the H2 norm. Show more
Permanent link
https://doi.org/10.3929/ethz-b-000461441Publication status
publishedExternal links
Editor
Book title
24th International Symposium on Mathematical Theory of Networks and Systems (MTNS 2020)Journal / series
IFAC-PapersOnLineVolume
Pages / Article No.
Publisher
ElsevierEvent
Subject
Multi-agent systems; Consensus; Distributed control; H2 controlOrganisational unit
08814 - Smith, Roy (Tit.-Prof.)
03751 - Lygeros, John / Lygeros, John
Related publications and datasets
Is supplemented by: https://doi.org/10.3929/ethz-b-000477118
Notes
Conference cancelled due to Corona virus (COVID-19).More
Show all metadata
ETH Bibliography
yes
Altmetrics