A Graph-Theoretic Approach to the \mathcal{H}_{\infty} Performance of Dynamical Systems on Directed and Undirected Networks

arXiv1804.10483MaRDI QIDQ6300902FDOQ6300902

Henrik Sandberg, Karl Henrik Johansson, Mohammad Pirani

Publication date: 27 April 2018

Abstract: We study a graph-theoretic approach to the

m a t h c a l H_{i n f t y}

performance of leader following consensus dynamics on directed and undirected graphs. We first provide graph-theoretic bounds on the system

m a t h c a l H_{i n f t y}

norm of the leader following dynamics and show the tightness of the proposed bounds. Then, we discuss the relation between the system

m a t h c a l H_{i n f t y}

norm for directed and undirected networks for specific classes of graphs, i.e., balanced digraphs and directed trees. Moreover, we investigate the effects of adding directed edges to a directed tree on the resulting system

m a t h c a l H_{i n f t y}

norm. In the end, we apply these theoretical results to a reference velocity tracking problem in a platoon of connected vehicles and discuss the effect of the location of the leading vehicle on the overall

m a t h c a l H_{i n f t y}

performance of the system.

This page was built for publication: A Graph-Theoretic Approach to the $\mathcal{H}_{\infty}$ Performance of Dynamical Systems on Directed and Undirected Networks

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