.png){kind=icon}
.png){kind=icon}
Return
Distributed set-membership filtering for time-varying systems: A coding-decoding-based approach
.png){kind=icon}
PRE
AI
DOI：10.1016/j.automatica.2021.109684.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, the distributed set-membership filtering problem is studied for a class of discrete time-varying systems over digital wireless sensor networks. In order to make full utilization of limited bandwidth of the communication channels connecting sensor nodes, a new coding-decoding communication strategy is implemented to regulate the data transmission between individual nodes. Under the scheduling of the proposed communication strategy, the transmitted signal will be converted to certain codewords belonging to a finite set before transmission according to the corresponding coding rules. Sufficient criteria are firstly established for the solvability of the addressed filtering problem in terms of a series of matrix inequalities. Subsequently, a sub-optimal problem is presented with the purpose of seeking the locally optimal distributed filter. Finally, two simulation examples are given to demonstrate the proposed filtering algorithm. (C) 2021 Elsevier Ltd. All rights reserved.
Keywords:
Set-membership filtering
Wireless sensor network
Digital communication
Coding-decoding strategy
Distributed filtering
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.