Set membership filtering for discrete saturated time‐varying networked systems with incomplete measurements under round‐robin protocol

Abstract

AbstractIn this paper, the set membership filtering problem is investigated for a class of discrete networked systems with time delay and state saturation under the round‐robin (RR) protocol, where the system noise is unknown but bounded. In order to reduce the communication burden, the RR protocol is used to schedule the measurement information of the system. In addition, the incompleteness of the measurement information is considered. A set membership filter is established based on incomplete measurements. The objective is to give a criterion that the filtering error is confined to the ellipsoidal set by using the recursive linear matrix inequality (RLMI) method. Moreover, a convex optimization method is proposed to minimize the obtained ellipsoids. Finally, a numerical simulation illustrates that the designed set membership filtering scheme is effective.