4.7 Article

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

期刊

AUTOMATICA
卷 152, 期 -, 页码 -

出版社

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.automatica.2023.110874

关键词

Constrained bit rate; Set -membership filtering; Co -design problem; Component-based coding-decoding

向作者/读者索取更多资源

This paper addresses the set-membership filtering problem for discrete time-varying systems under bit rate constraints and unknown-but-bounded noises. The communication between sensor nodes and filters is implemented through a wireless digital communication network with limited bandwidth. A component-based coding-decoding procedure is proposed to decode messages from different components scattered in different physical locations. A recursive set-membership filtering scheme is developed, and the co-design issue of the bit rate allocation protocol and the filter gain is solved using particle swarm optimization and recursive filtering algorithms. Numerical simulations validate the effectiveness of the proposed approach.
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.(c) 2023 Elsevier Ltd. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据