Graph-theoretic optimization for edge consensus

arXiv2006.16201MaRDI QIDQ6344017FDOQ6344017

Authors: Mathias Hudoba de Badyn, Dillon R. Foight, Daniel Calderone, Mehran Mesbahi, Roy S. Smith 

Publication date: 29 June 2020

Abstract: We consider network structures that optimize the $mathcal{H}_2$ 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-$mathcal{H}_2$ norm spanning tree, as well as how to choose edges to optimize the $mathcal{H}_2$ 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 $mathcal{H}_2$ norm.

This page was built for publication: Graph-theoretic optimization for edge consensus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6344017)