Robust set-membership filtering for two-dimensional systems with sensor saturation under the Round-Robin protocol

In this paper, the set-membership filtering problem is investigated for a class of polytopic uncertain two-dimensional shift-varying systems with delays and sensor saturation. The measurement information is transmitted between the sensors and the filter through a shared communication network. To avoid data congestions, the Round-Robin (R-R) protocol is employed to regulate the data transmission order. This paper aims to design a robust set-membership filter such that the real system states are always contained in the state estimate ellipsoid in the presence of the state delays, the sensor saturation, the parameter uncertainties, the R-R protocol and the unknown-but-bounded external perturbations. By using the mathematical induction, sufficient condition for the existence of the desired robust set-membership filter is given in the form of recursive linear matrix inequalities, and a convex optimisation method is also proposed to determine the optimal state estimation ellipsoid in the trace sense. One numerical example is also given to illustrate effectiveness of the proposed filtering strategy.

Automated summary

This paper investigates the set-membership filtering problem for a class of polytopic uncertain two-dimensional shift-varying systems with delays and sensor saturation. It aims to design a robust set-membership filter to ensure that the real system states are always contained in the state estimate ellipsoid under various uncertainties and perturbations. The paper provides sufficient conditions for the existence of the desired filter and proposes a convex optimization method to determine the optimal state estimation ellipsoid, with a numerical example to illustrate the effectiveness of the proposed strategy.