Jonsson, Ulf T. (Royal Inst. of Tech.), Kao, Chung-Yao (Univ. of Melbourne), Fujioka, Hisaya (Kyoto Univ. Graduate School of Informatics)

A Popov Criterion for Networked Systems

Scheduled for presentation during the Regular Session "Networked control" (ThP08), Thursday, July 27, 2006, 15:20−15:45, Room I

17th International Symposium on Mathematical Theory of Networks and Systems, July 24-28, 2006, Kyoto, Japan

This information is tentative and subject to change. Compiled on May 19, 2024

Abstract

It is shown how robustness analysis based on integral quadratic constraints (IQCs) can decompose to lower dimensional problems if network structure is exploited. This generally leads to a significant reduction of the computational complexity. Both heterogeneous and homogeneous networks are considered. A second contribution is obtained by considering a set of IQCs that characterizes the eigenvalues of the interconnection matrix of a symmetric network. Direct use of these IQCs gives a Popov criterion that for a single input single output linear systems can be illustrated using a generalized Popov plot. The Popov criterion is also a necessary condition in the sense that if the criterion is violated then a destabilizing network with the specified eigenvalue distribution can be constructed.