Efficient Computation of H2 Performance on Series-Parallel Networks

DOI10.23919/ACC.2019.8814989MaRDI QIDQ6315513zbMATH OpenFDO

Authors Mathias Hudoba de Badyn, Mehran Mesbahi

Publication date 13 March 2019

Full work available at URL https://doi.org/10.23919/ACC.2019.8814989

Abstract: Series-parallel networks are a class of graphs on which many NP-hard problems have tractable solutions. In this paper, we examine performance measures on leader-follower consensus on series-parallel networks. We show that a distributed computation of the $mathcal{H}_2$ norm can be done efficiently on this system by exploiting a decomposition of the network into atomic elements and composition rules. Lastly, we examine the problem of adaptively re-weighting the network to optimize the $mathcal{H}_2$ norm, and show that it can be done with similar complexity.

This page was built for publication: Efficient Computation of H2 Performance on Series-Parallel Networks

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