Optimization of the H_\infty-norm of Dynamic Flow Networks

MaRDI QIDQ6292332zbMATH OpenFDO

Authors Alexander Johansson, Jieqiang Wei, Henrik Sandberg, Karl Henrik Johansson, Jie Chen

Publication date 9 October 2017

Abstract: In this paper, we study the $H_{i}nfty$-norm of linear systems over graphs, which is used to model distribution networks. In particular, we aim to minimize the $H_{i}nfty$-norm subject to allocation of the weights on the edges. The optimization problem is formulated with LMI (Linear-Matrix-Inequality) constraints. For distribution networks with one port, i.e., SISO systems, we show that the $H_{i}nfty$-norm coincides with the effective resistance between the nodes in the port. Moreover, we derive an upper bound of the $H_{i}nfty$-norm, which is in terms of the algebraic connectivity of the graph on which the distribution network is defined.

This page was built for publication: Optimization of the $H_\infty$-norm of Dynamic Flow Networks

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