Moving Horizon Estimation for Networked Time-Delay Systems Under Round-Robin Protocol

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.