Invariant Set-Based Analysis of Minimal Detectable Fault for Discrete-Time LPV Systems with Bounded Uncertainties

Abstract

This paper proposes an invariant-set based minimal detectable fault (MDF) computation method based on the set-separation condition between the healthy and faulty residual sets for discrete-time linear parameter varying (LPV) systems with bounded uncertainties. First, a novel invariant-set computation method for discrete-time LPV systems is developed exclusively based on a sequence of convex-set operations. Notably, this method does not need to satisfy the existence condition of a common quadratic Lyapunov function for all the vertices of the parametric uncertainty compared with the traditional invariant-set computation methods. Based on asymptotic stability assumptions, a family of robust positively invariant (RPI) outer-approximations of minimal robust positively invariant (mRPI) set are obtained by using a shrinking procedure. Based on the mRPI set, the healthy and faulty residual sets can be obtained. Then, by considering the dual case of the set-separation constraint regarding the healthy and faulty residual sets, we transform the guaranteed MDF problem based on the set-separation constraint into a simple linear programming (LP) problem to compute the magnitude of MDF. Since the proposed MDF computation method is robust regardless of the value of scheduling variables in a given convex set, fault detection (FD) can be guaranteed whenever the magnitude of fault is larger than that of the MDF. At the end of the paper, a practical vehicle model is used to illustrate the effectiveness of the proposed method.