Graph-theoretic optimization for edge consensus
OPEN ACCESS
Loading...
Author / Producer
Date
2021
Publication Type
Conference Paper
ETH Bibliography
yes
Citations
Altmetric
OPEN ACCESS
Data
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.
Permanent link
Publication status
published
External links
Book title
24th International Symposium on Mathematical Theory of Networks and Systems (MTNS 2020)
Journal / series
Volume
54 (9)
Pages / Article No.
533 - 538
Publisher
Elsevier
Event
24th International Symposium on Mathematical Theory of Networks and Systems (MTNS 2020) (cancelled)
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
Multi-agent systems; Consensus; Distributed control; H2 control
Organisational unit
08814 - Smith, Roy (Tit.-Prof.) (ehemalig) / Smith, Roy (Tit.-Prof.) (former)
03751 - Lygeros, John / Lygeros, John
Notes
Conference cancelled due to Corona virus (COVID-19).
Funding
Related publications and datasets
Is supplemented by: