Switched Systems Reduction Framework Based on Convex Combination of Generalized Gramians

الملخص EN

A general method for model-order reduction of switched linear dynamical systems is presented.

The proposed technique uses convex generalized gramian which is a convex combination of the generalized gramians.

It is shown that different classical reduction methods can be developed into the generalized gramian framework for model reduction of linear systems and further for the reduction of switched systems by construction of the convex generalized gramian.

Balanced reduction within specified frequency bound is taken as an example which is developed within this framework.

In order to avoid numerical instability and also to increase the numerical efficiency, convex generalized gramian-based Petrov-Galerkin projection is constructed instead of the similarity transform approach for reduction.

It is proven that the method preserves the stability of the original switched system at least for stabilizing switching signal and it is also less conservative than the method which is based on the common generalized gramian.

Some discussions on the coefficient of the vertices of the convex variables are presented.

The performance of the proposed method is illustrated by numerical examples.