A review of convex approaches for control, observation and safety of linear parameter varying and Takagi-Sugeno systems

This paper provides a review about the concept of convex systems based on Takagi-Sugeno, linear parameter varying (LPV) and quasi-LPV modeling. These paradigms are capable of hiding the nonlinearities by means of an equivalent description which uses a set of linear models interpolated by appropriately defined weighing functions. Convex systems have become very popular since they allow applying extended linear techniques based on linear matrix inequalities (LMIs) to complex nonlinear systems. This survey aims at providing the reader with a significant overview of the existing LMI-based techniques for convex systems in the fields of control, observation and safety. Firstly, a detailed review of stability, feedback, tracking and model predictive control (MPC) convex controllers is considered. Secondly, the problem of state estimation is addressed through the design of proportional, proportional-integral, unknown input and descriptor observers. Finally, safety of convex systems is discussed by describing popular techniques for fault diagnosis and fault tolerant control (FTC).Peer ReviewedPostprint (published version

Parameter-Invariant Monitor Design for Cyber Physical Systems

The tight interaction between information technology and the physical world inherent in Cyber-Physical Systems (CPS) can challenge traditional approaches for monitoring safety and security. Data collected for robust CPS monitoring is often sparse and may lack rich training data describing critical events/attacks. Moreover, CPS often operate in diverse environments that can have significant inter/intra-system variability. Furthermore, CPS monitors that are not robust to data sparsity and inter/intra-system variability may result in inconsistent performance and may not be trusted for monitoring safety and security. Towards overcoming these challenges, this paper presents recent work on the design of parameter-invariant (PAIN) monitors for CPS. PAIN monitors are designed such that unknown events and system variability minimally affect the monitor performance. This work describes how PAIN designs can achieve a constant false alarm rate (CFAR) in the presence of data sparsity and intra/inter system variance in real-world CPS. To demonstrate the design of PAIN monitors for safety monitoring in CPS with different types of dynamics, we consider systems with networked dynamics, linear-time invariant dynamics, and hybrid dynamics that are discussed through case studies for building actuator fault detection, meal detection in type I diabetes, and detecting hypoxia caused by pulmonary shunts in infants. In all applications, the PAIN monitor is shown to have (significantly) less variance in monitoring performance and (often) outperforms other competing approaches in the literature. Finally, an initial application of PAIN monitoring for CPS security is presented along with challenges and research directions for future security monitoring deployments

Robust fault detection for networked systems with distributed sensors

Copyright [2011] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.This paper is concerned with the robust fault detection problem for a class of discrete-time networked systems with distributed sensors. Since the bandwidth of the communication channel is limited, packets from different sensors may be dropped with different missing rates during the transmission. Therefore, a diagonal matrix is introduced to describe the multiple packet dropout phenomenon and the parameter uncertainties are supposed to reside in a polytope. The aim is to design a robust fault detection filter such that, for all probabilistic packet dropouts, all unknown inputs and admissible uncertain parameters, the error between the residual (generated by the fault detection filter) and the fault signal is made as small as possible. Two parameter-dependent approaches are proposed to obtain less conservative results. The existence of the desired fault detection filter can be determined from the feasibility of a set of linear matrix inequalities that can be easily solved by the efficient convex optimization method. A simulation example on a networked three-tank system is provided to illustrate the effectiveness and applicability of the proposed techniques.This work was supported by national 973 project under Grants 2009CB320602 and 2010CB731800, and the NSFC under Grants 60721003 and 60736026

Towards a Model-Based Meal Detector for Type I Diabetics

Blood glucose management systems are an important class of Medical Cyber-Physical Systems that provide vital everyday decision support service to diabetics. An artificial pancreas, which integrates a continuous glucose monitor, a wearable insulin pump, and control algorithms running on embedded computing devices, can significantly improve the quality of life for millions of Type 1 diabetics. A primary problem in the development of an artificial pancreas is the accurate detection and estimation of meal carbohydrates, which cause significant glucose system disturbances. Meal carbohydrate detection is challenging since post-meal glucose responses greatly depend on patient-specific physiology and meal composition. In this paper, we develop a novel meal-time detector that leverages a linearized physiological model to realize a (nearly) constant false alarm rate (CFAR) performance despite unknown model parameters and uncertain meal inputs. Insilico evaluations using 10, 000 virtual subjects on an FDA-accepted maximal physiological model illustrate that the proposed CFAR meal detector significantly outperforms a current state-of-the-art meal detector that utilizes a voting scheme based on rate-of-change (RoC) measures. The proposed detector achieves 99.6% correct detection rate while averaging one false alarm every 24 days (a 1.4% false alarm rate), which represents an 84% reduction in false alarms and a 95% reduction in missed alarms when compared to the RoC approach

H∞ fault estimation with randomly occurring uncertainties, quantization effects and successive packet dropouts: The finite-horizon case

In this paper, the finite-horizon H∞ fault estimation problem is investigated for a class of uncertain nonlinear time-varying systems subject to multiple stochastic delays. The randomly occurring uncertainties (ROUs) enter into the system due to the random fluctuations of network conditions. The measured output is quantized by a logarithmic quantizer before being transmitted to the fault estimator. Also, successive packet dropouts (SPDs) happen when the quantized signals are transmitted through an unreliable network medium. Three mutually independent sets of Bernoulli-distributed white sequences are introduced to govern the multiple stochastic delays, ROUs and SPDs. By employing the stochastic analysis approach, some sufficient conditions are established for the desired finite-horizon fault estimator to achieve the specified H∞ performance. The time-varying parameters of the fault estimator are obtained by solving a set of recursive linear matrix inequalities. Finally, an illustrative numerical example is provided to show the effectiveness of the proposed fault estimation approach