Dilated LMI conditions for time-varying polytopic descriptor systems: the discrete-time case

Abstract

This article addresses the admissibility analysis and state-feedback control synthesis problems of discrete-time polytopic descriptor systems with possibly time-varying parameters. First, we present a new necessary and sufficient strict linear matrix inequality (LMI) condition for the admissibility analysis of linear time-invariant (LTI) descriptor systems. Then, based on the concept of poly-quadratic admissibility, introduced in this article, we extend this result to the admissibility analysis of possibly time-varying parameter-dependent descriptor systems. This extension, which applies to both uncertain and measurable parameters, uses parameter-dependent Lyapunov functions and employs two slack variables. The extended conditions are also expressed as strict LMI conditions which are easily tractable numerically compared to the non-strict ones often encountered when dealing with descriptor systems. Note that we have proposed two separate admissibility analysis conditions: one directly exploitable for state estimation and the other for state-feedback control. The need for different admissibility analysis conditions for each synthesis problem is motivated by the fact that the duality between state estimation and state-feedback control, which hold in the case of measurable parameters, does not hold when dealing with uncertain ones. In our approach, we overcome the absence of such duality by considering a dilation only on the dynamical part of the descriptor system. The application of our analysis result to both robust state-feedback control and polytopic state-feedback control are also presented in this article. Our analysis results extend to descriptor systems, some existing results developed for regular systems.