A component-based coding–decoding approach to set-membership filtering for time-varying systems under constrained bit rate

• Published in: Automatica (Oxford) Vol. 152; p. 110874
• Main Authors: Li, Jun-Yi, Wang, Zidong, Lu, Renquan, Xu, Yong
• Format: Journal Article
• Language: English
• Published: Elsevier Ltd 01.06.2023
• Subjects: Co-design problem; Component-based coding–decoding; Constrained bit rate; Set-membership filtering; Set-membership filtering; Constrained bit rate; Co-design problem; Component-based coding–decoding
• ISSN: 0005-1098; 1873-2836
• DOI: 10.1016/j.automatica.2023.110874

This paper is concerned with the set-membership filtering (SMF) problem for a class of discrete time-varying systems with unknown-but-bounded noises under bit rate constraints. The communication between sensor nodes and filters is implemented through a wireless digital communication network with limited bandwidth. A bit rate constraint is first established to quantify the extent to which the network is constrained. A component-based coding–decoding procedure is proposed that enables individual decoder to decode messages from different components scattering in different physical locations. Based on this procedure, a decoded-measurement-based recursive SMF scheme with a prediction–correction structure is put forward. The desired parameters of the set-membership filter can be calculated recursively by the proposed recursive SMF scheme. Furthermore, the co-design issue of the bit rate allocation protocol and the filter gain is converted into the mixed-integer nonlinear programming problem that is solved by means of the particle swarm optimization and the recursive filtering algorithms. Finally, numerical simulations on two scenarios are conducted to validate the effectiveness of the proposed SMF approach.