In this paper, the event-triggered state estimation problem is investigated for a class of complex networks with mixed time delays using sampled data information. A novel state estimator is presented to estimate the network states. A new event-triggered transmission scheme is proposed to reduce unnecessary network traffic between the sensors and the estimator, where the sampled data is transmitted to the estimator only when the so-called “event-triggered condition” is satisfied. The purpose of the problem addressed is to design an estimator for the complex network such that the estimation error is ultimately bounded in mean square. By utilizing Lyapunov theory combined with the stochastic analysis approach, sufficient conditions are established to guarantee the ultimate boundedness of the estimation error in mean square. Then, the desired estimator gain matrices are obtained via solving a convex problem. Finally, a numerical example is given to illustrate the effectiveness of the results.

This paper is concerned with the state estimation problem for a class of nonlinear dynamical networks with time-varying delays subject to the round-robin protocol. The communication between the state estimator and the nodes of the dynamical networks is implemented through a shared constrained network, in which only one node is allowed to send data at each time instant. The round-robin protocol is utilized to orchestrate the transmission order of nodes. By using a switch-based approach, the dynamics of the estimation error is modeled by a periodic parameter-switching system with time-varying delays. The purpose of the problem addressed is to design an estimator, such that the estimation error is exponentially ultimately bounded with a certain asymptotic upper bound in mean square subject to the process noise and exogenous disturbance. Furthermore, such a bound is subsequently minimized by the designed estimator parameters. A novel Lyapunov-like functional is employed to deal with the dynamics analysis issue of the estimation error. Sufficient conditions are established to guarantee the ultimate boundedness of the estimation error in mean square by applying the stochastic analysis approach. Then, the desired estimator gains are characterized by solving a convex problem. Finally, a numerical example is given to illustrate the effectiveness of the estimator design scheme.

This paper is concerned with the ultimate boundedness control problem for a class of networked nonlinear systems subject to the try-once-discard (TOD) protocol scheduling and uniform quantization effects. To prevent the transmission data from collisions, the communication between sensor nodes and the controller is implemented via a constrained communication channel, where only one sensor node is permitted to transmit data at each time instant. The TOD protocol is utilized to regulate the signal transmission over the communication network under which the scheduling behavior is described by a special switching function. On the other hand, the uniform quantization effects of the network are characterized by a round function (i.e., the nearest integer function). The purpose of the addressed problem is to design an observer-based controller for the networked nonlinear systems such that, in the presence of TOD protocol and uniform quantization effects, the closed-loop system is ultimately bounded and the controlled output is locally minimized. Sufficient conditions are established to guarantee the ultimate boundedness of the dynamics of the closed-loop system in mean square by applying the stochastic analysis approach. Furthermore, the desired controller gains are derived by solving a convex optimization problem. Finally, a numerical example is given to illustrate the effectiveness of the proposed controller design scheme.

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.

This paper is concerned with the moving horizon estimation problem for a class of discrete time-delay systems under the Round-Robin (RR) protocol. The communication between the sensor nodes and the remote state estimator is implemented via a shared network, where only one sensor node is permitted to transmit data at each time instant for the purpose of preventing data collisions. The RR protocol is utilized to orchestrate the transmission order of sensor nodes, under which the selected node obtaining access to the network could be modeled by a periodic function. A lifting technology is introduced to reformulate the system model into a linear system without delays. The aim of the addressed problem is to develop a moving horizon estimator such that the estimation error is ultimately bounded. A sufficient condition is established to ensure the ultimate boundedness in terms of a matrix inequality. Within the established theoretical framework, two optimization problems are proposed to calculate the corresponding estimator parameters according to two different performance requirements (e.g., the smallest ultimate bound and the fastest decay rate). Finally, simulation examples are given to illustrate the effectiveness of the estimator design scheme.