Search

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. [ABSTRACT FROM AUTHOR]

This paper is concerned with the recursive filtering problem for a class of networked linear time-varying systems subject to the scheduling of the random access protocol (RAP). The communication between the sensor nodes and the remote filter is implemented via a shared network. For the purpose of preventing the data from collisions, only one sensor node is allowed to get access to the network at each time instant. The transmission order of sensor nodes is orchestrated by the RAP scheduling, under which the selected nodes obtaining access to the network could be characterized by a sequence of independent and identically-distributed variables. The aim of the addressed filtering problem is to design a recursive filter such that the filtering error covariance could be minimized by properly designing the filter gain at each time instant. The desired filter gain is calculated recursively by solving two Riccati-like difference equations. Furthermore, the boundedness issue of the corresponding filtering error covariance is investigated. Sufficient conditions are obtained to ensure the lower and upper bounds of the filtering error covariance. Two illustrative examples are given to demonstrate the correctness and effectiveness ofour developed recursive filtering approach. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM PUBLISHER]