Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/26724
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Li, J-Y | - |
dc.contributor.author | Wang, Z | - |
dc.contributor.author | Lu, R | - |
dc.contributor.author | Xu, Y | - |
dc.date.accessioned | 2023-06-26T07:00:05Z | - |
dc.date.available | 2023-06-26T07:00:05Z | - |
dc.date.issued | 2023-03-20 | - |
dc.identifier | ORCID iD: Zidong Wang https://orcid.org/0000-0002-9576-7401 | - |
dc.identifier | 110874 | - |
dc.identifier.citation | Li, J.-Y. et al. (2023) 'A component-based coding–decoding approach to set-membership filtering for time-varying systems under constrained bit rate', Automatica, 152, 110874, pp. 1 - 11. doi: 10.1016/j.automatica.2023.110874. | en_US |
dc.identifier.issn | 0005-1098 | - |
dc.identifier.uri | https://bura.brunel.ac.uk/handle/2438/26724 | - |
dc.description | The material in this paper was not presented at any conference. This paper was recommended for publication in revised form by Associate Editor Antonio Vicino under the direction of Editor Alessandro Chiuso. | - |
dc.description.abstract | 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. | en_US |
dc.description.sponsorship | This work was supported in part by the National Natural Science Foundation of China (62121004, 62206063, 62141606 and 61933007), the Local Innovative and Research Teams Project of Guangdong Special Support Program of China (2019BT02X353), the Guangdong Basic and Applied Basic Research Foundation of China (2021A1515110765), the China Postdoctoral Science Foundation (2022M710825 and 2022T150146), the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germany . | en_US |
dc.format.extent | 1 - 11 | - |
dc.format.medium | Print-Electronic | - |
dc.language | English | - |
dc.language.iso | en_US | en_US |
dc.publisher | Elsevier | en_US |
dc.rights | Copyright © 2023 Elsevier. All rights reserved. This is the accepted manuscript version of an article which has been published in final form at https://doi.org/10.1016/j.automatica.2023.110874, made available on this repository under a Creative Commons CC BY-NC-ND attribution licence (https://creativecommons.org/licenses/by-nc-nd/4.0/). | - |
dc.rights.uri | https://creativecommons.org/licenses/by-nc-nd/4.0/ | - |
dc.subject | constrained bit rate | en_US |
dc.subject | component-based coding–decoding | en_US |
dc.subject | set-membership filtering | en_US |
dc.subject | co-design problem | en_US |
dc.title | A component-based coding–decoding approach to set-membership filtering for time-varying systems under constrained bit rate | en_US |
dc.type | Article | en_US |
dc.identifier.doi | https://doi.org/10.1016/j.automatica.2023.110874 | - |
dc.relation.isPartOf | Automatica | - |
pubs.publication-status | Published | - |
pubs.volume | 152 | - |
dc.identifier.eissn | 1873-2836 | - |
dc.rights.holder | Elsevier | - |
Appears in Collections: | Dept of Computer Science Embargoed Research Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
FullText.pdf | Embargoed until 20 March 2024 | 988.07 kB | Adobe PDF | View/Open |
This item is licensed under a Creative Commons License