Time-and event-driven communication process for networked control systems: A survey

Copyright © 2014 Lei Zou et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.In recent years, theoretical and practical research topics on networked control systems (NCSs) have gained an increasing interest from many researchers in a variety of disciplines owing to the extensive applications of NCSs in practice. In particular, an urgent need has arisen to understand the effects of communication processes on system performances. Sampling and protocol are two fundamental aspects of a communication process which have attracted a great deal of research attention. Most research focus has been on the analysis and control of dynamical behaviors under certain sampling procedures and communication protocols. In this paper, we aim to survey some recent advances on the analysis and synthesis issues of NCSs with different sampling procedures (time-and event-driven sampling) and protocols (static and dynamic protocols). First, these sampling procedures and protocols are introduced in detail according to their engineering backgrounds as well as dynamic natures. Then, the developments of the stabilization, control, and filtering problems are systematically reviewed and discussed in great detail. Finally, we conclude the paper by outlining future research challenges for analysis and synthesis problems of NCSs with different communication processes.This work was supported in part by the National Natural Science Foundation of China under Grants 61329301, 61374127, and 61374010, the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germany

Distributed filtering of networked dynamic systems with non-gaussian noises over sensor networks: A survey

summary:Sensor networks are regarded as a promising technology in the field of information perception and processing owing to the ease of deployment, cost-effectiveness, flexibility, as well as reliability. The information exchange among sensors inevitably suffers from various network-induced phenomena caused by the limited resource utilization and complex application scenarios, and thus is required to be governed by suitable resource-saving communication mechanisms. It is also noteworthy that noises in system dynamics and sensor measurements are ubiquitous and in general unknown but can be bounded, rather than follow specific Gaussian distributions as assumed in Kalman-type filtering. Particular attention of this paper is paid to a survey of recent advances in distributed filtering of networked dynamic systems with non-Gaussian noises over sensor networks. First, two types of widely employed structures of distributed filters are reviewed, the corresponding analysis is systematically addressed, and some interesting results are provided. The inherent purpose of adding consensus terms into the distributed filters is profoundly disclosed. Then, some representative models characterizing various network-induced phenomena are reviewed and their corresponding analytical strategies are exhibited in detail. Furthermore, recent results on distributed filtering with non-Gaussian noises are sorted out in accordance with different network-induced phenomena and system models. Another emphasis is laid on recent developments of distributed filtering with various communication scheduling, which are summarized based on the inherent characteristics of their dynamic behavior associated with mathematical models. Finally, the state-of-the-art of distributed filtering and challenging issues, ranging from scalability, security to applications, are raised to guide possible future research

Fault estimation for time-varying systems with Round-Robin protocol

summary:This paper is concerned with the design problem of finite-horizon $H_\infty$ fault estimator for a class of nonlinear time-varying systems with Round-Robin protocol scheduling. The faults are assumed to occur in a random way governed by a Bernoulli distributed white sequence. The communication between the sensor nodes and fault estimators is implemented via a shared network. In order to prevent the data from collisions, a Round-Robin protocol is utilized to orchestrate the transmission of sensor nodes. By means of the stochastic analysis technique and the completing squares method, a necessary and sufficient condition is established for the existence of fault estimator ensuring that the estimation error dynamics satisfies the prescribed $H_\infty$ constraint. The time-varying parameters of fault estimator are obtained by recursively solving a set of coupled backward Riccati difference equations. A simulation example is given to demonstrate the effectiveness of the proposed design scheme of the fault estimator

Deep Reinforcement Learning for Wireless Sensor Scheduling in Cyber-Physical Systems

In many Cyber-Physical Systems, we encounter the problem of remote state estimation of geographically distributed and remote physical processes. This paper studies the scheduling of sensor transmissions to estimate the states of multiple remote, dynamic processes. Information from the different sensors have to be transmitted to a central gateway over a wireless network for monitoring purposes, where typically fewer wireless channels are available than there are processes to be monitored. For effective estimation at the gateway, the sensors need to be scheduled appropriately, i.e., at each time instant one needs to decide which sensors have network access and which ones do not. To address this scheduling problem, we formulate an associated Markov decision process (MDP). This MDP is then solved using a Deep Q-Network, a recent deep reinforcement learning algorithm that is at once scalable and model-free. We compare our scheduling algorithm to popular scheduling algorithms such as round-robin and reduced-waiting-time, among others. Our algorithm is shown to significantly outperform these algorithms for many example scenarios

Optimized state estimation for nonlinear dynamical networks subject to fading measurements and stochastic coupling strength: An event-triggered communication mechanism

summary:This paper is concerned with the design of event-based state estimation algorithm for nonlinear complex networks with fading measurements and stochastic coupling strength. The event-based communication protocol is employed to save energy and enhance the network transmission efficiency, where the changeable event-triggered threshold is adopted to adjust the data transmission frequency. The phenomenon of fading measurements is described by a series of random variables obeying certain probability distribution. The aim of the paper is to propose a new recursive event-based state estimation strategy such that, for the admissible linearization error, fading measurements and stochastic coupling strength, a minimum upper bound of estimation error covariance is given by designing the estimator gain. Furthermore, the monotonicity relationship between the trace of the upper bound of estimation error covariance and the fading probability is pointed out from the theoretical aspect. Finally, a simulation example is used to show the effectiveness of developed state estimation algorithm

Communication-protocol-based analysis and synthesis of networked systems: progress, prospects and challenges

In recent years, the communication-protocol-based synthesis and analysis issues have gained substantial research interest owing mainly to their significance in networked systems. In this work, we survey the control and filtering problems of networked systems under the effects induced by communication protocols. First, we introduce the engineering background of networked systems as well as the theoretical frameworks established to deal with the communication-protocol-based analysis and synthesis problems. Then, recent advances (especially the latest results) are reviewed on the stability analysis issue subject to protocol scheduling. Subsequently, the particular effort is devoted to presenting the latest progress on various communication-protocol-based control and filtering problems according to the characteristics of networked systems (e.g. time-varying nature, random behaviours, types of parameter uncertainties, and kinds of distributed structure). After that, we provide a systematic review of the communication-protocol-based fault diagnosis problems. Finally, some research challenges of communication-protocol-based control and filtering problems are outlined for future research

Non-fragile estimation for discrete-time T-S fuzzy systems with event-triggered protocol

summary:This paper investigates the non-fragile state estimation problem for a class of discrete-time T-S fuzzy systems with time-delays and multiple missing measurements under event-triggered mechanism. First of all, the plant is subject to the time-varying delays and the stochastic disturbances. Next, a random white sequence, the element of which obeys a general probabilistic distribution defined on $[0,1]$, is utilized to formulate the occurrence of the missing measurements. Also, an event generator function is employed to regulate the transmission of data to save the precious energy. Then, a non-fragile state estimator is constructed to reflect the randomly occurring gain variations in the implementing process. By means of the Lyapunov-Krasovskii functional, the desired sufficient conditions are obtained such that the Takagi-Sugeno (T-S) fuzzy estimation error system is exponentially ultimately bounded in the mean square. And then the upper bound is minimized via the robust optimization technique and the estimator gain matrices can be calculated. Finally, a simulation example is utilized to demonstrate the effectiveness of the state estimation scheme proposed in this paper

Mobile robot localization under stochastic communication protocol

summary:In this paper, the mobile robot localization problem is investigated under the stochastic communication protocol (SCP). In the mobile robot localization system, the measurement data including the distance and the azimuth are received by multiple sensors equipped on the robot. In order to relieve the network burden caused by network congestion, the SCP is introduced to schedule the transmission of the measurement data received by multiple sensors. The aim of this paper is to find a solution to the robot localization problem by designing a time-varying filter for the mobile robot such that the filtering error dynamics satisfies the $H_{\infty}$ performance requirement over a finite horizon. First, a Markov chain is introduced to model the transmission of measurement data. Then, by utilizing the stochastic analysis technique and completing square approach, the gain matrices of the desired filter are designed in term of a solution to two coupled backward recursive Riccati equations. Finally, the effectiveness of the proposed filter design scheme is shown in an experimental platform

Variance-Constrained H∞H_{\infty } finite-horizon filtering for multi-rate time-varying networked systems based on stochastic protocols

summary:In this paper, the variance-constrained $H_\infty$ finite-horizon filtering problem is investigated for a class of time-varying nonlinear system under muti-rate communication network and stochastic protocol (SP). The stochastic protocol is employed to determine which sensor obtains access to the muti-rate communication network in order to relieve communication burden. A novel mapping technology is applied to characterize the randomly switching behavior of the data transmission resulting from the utilization of the SP in muti-rate communication network. By using relaxation method, sufficient conditions are derived for the existence of the finite-horizon filter satisfying both the prescribed $H_\infty$ performance and the covariance requirement of filtering errors, and the solutions of filters satisfying the above indexes are obtained by using linear matrix inequalities. Finally, the validity and effectiveness of the proposed filter scheme are verified by numerical simulation