Automated Insulin Delivery for Type 1 Diabetes Mellitus Patients using Gaussian Process-based Model Predictive Control

The human insulin-glucose metabolism is a time-varying process, which is partly caused by the changing insulin sensitivity of the body. This insulin sensitivity follows a circadian rhythm and its effects should be anticipated by any automated insulin delivery system. This paper presents an extension of our previous work on automated insulin delivery by developing a controller suitable for humans with Type 1 Diabetes Mellitus. Furthermore, we enhance the controller with a new kernel function for the Gaussian Process and deal with noisy measurements, as well as, the noisy training data for the Gaussian Process, arising therefrom. This enables us to move the proposed control algorithm, a combination of Model Predictive Controller and a Gaussian Process, closer towards clinical application. Simulation results on the University of Virginia/Padova FDA-accepted metabolic simulator are presented for a meal schedule with random carbohydrate sizes and random times of carbohydrate uptake to show the performance of the proposed control scheme.

Learning Hidden Markov Models for Linear Gaussian Systems with Applications to Event-based State Estimation

This work attempts to approximate a linear Gaussian system with a finite-state hidden Markov model (HMM), which is found useful in solving sophisticated event-based state estimation problems. An indirect modeling approach is developed, wherein a state space model (SSM) is firstly identified for a Gaussian system and the SSM is then used as an emulator for learning an HMM. In the proposed method, the training data for the HMM are obtained from the data generated by the SSM through building a quantization mapping. Parameter learning algorithms are designed to learn the parameters of the HMM, through exploiting the periodical structural characteristics of the HMM. The convergence and asymptotic properties of the proposed algorithms are analyzed. The HMM learned using the proposed algorithms is applied to event-triggered state estimation, and numerical results on model learning and state estimation demonstrate the validity of the proposed algorithms.

Secure Analysis of Dynamic Networks under Pinning Attacks against Synchronization

In this paper, we first consider a pinning node selection and control gain co-design problem for complex networks. A necessary and sufficient condition for the synchronization of the pinning controlled networks at a homogeneous state is provided. A quantitative model is built to describe the pinning costs and to formulate the pinning node selection and control gain design problem for different scenarios into the corresponding optimization problems. Algorithms to solve these problems efficiently are presented. Based on the developed results, we take the existence of a malicious attacker into consideration and a resource allocation model for the defender and the malicious attacker is described. We set up a leader-follower Stackelberg game framework to study the behaviour of both sides and the equilibrium of this security game is investigated. Numerical examples and simulations are presented to demonstrate the main results.

Quickest Change Detection in Adaptive Censoring Sensor Networks

The problem of quickest change detection with communication rate constraints is studied. A network of wireless sensors with limited computation capability monitors the environment and sends observations to a fusion center via wireless channels. At an unknown time instant, the distributions of observations at all the sensor nodes change simultaneously. Due to limited energy, the sensors cannot transmit at all the time instants. The objective is to detect the change at the fusion center as quickly as possible, subject to constraints on false detection and average communication rate between the sensors and the fusion center. A minimax formulation is proposed. The cumulative sum (CuSum) algorithm is used at the fusion center and censoring strategies are used at the sensor nodes. The censoring strategies, which are adaptive to the CuSum statistic, are fed back by the fusion center. The sensors only send observations that fall into prescribed sets to the fusion center. This CuSum adaptive censoring (CuSum-AC) algorithm is proved to be an equalizer rule and to be globally asymptotically optimal for any positive communication rate constraint, as the average run length to false alarm goes to infinity. It is also shown, by numerical examples, that the CuSum-AC algorithm provides a suitable trade-off between the detection performance and the communication rate.