Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/32648| Title: | Zonotopic Set-Membership Fusion Estimation for Complex Networks: A Buffer-Aided Strategy |
| Authors: | Zhao, Z Wang, Z Liang, J Xu, W |
| Keywords: | buffer-aided strategy;complex networks (CNs);fusion estimation;zonotopic set-membership estimation (SME) |
| Issue Date: | 4-Nov-2025 |
| Publisher: | Institute of Electrical and Electronics Engineers (IEEE) |
| Citation: | Zhao, Z. et al. (2025) 'Zonotopic Set-Membership Fusion Estimation for Complex Networks: A Buffer-Aided Strategy', IEEE Transactions on Cybernetics, 0 (early access), pp. 1 - 14. doi: 10.1109/TCYB.2025.3626066. |
| Abstract: | This article is concerned with the zonotopic set-membership fusion estimation (SMFE) problem for a class of complex networks (CNs). The measurements of the CNs are transmitted to a remote fusion center through a shared communication network. Due to the limited network bandwidth, the transmissions of the measurement information occur intermittently, and the nodes’ transmission intervals may exceed their sampling periods. To enhance the utilization of the measurement information, each node of the CN is equipped with a buffer for real-time data storage, so that the fusion center can utilize more measurement information at time instants when the node’s transmission interval is larger than its sampling period. The aim of this article is to design SMFE algorithms based on both the parallel fusion scheme and the data-compression fusion scheme, respectively, using the data received at the fusion center. First, by iterating the state equation of the CN, a batch processing method is proposed to process the input data of the fusion center concurrently. Subsequently, by employing the zonotopic set-membership estimation (SME) technique, the desired SMFE algorithms are designed. Moreover, sufficient criteria are established to ensure that the sizes of the output zonotopes of the SMFE algorithms remain uniformly bounded. Finally, two numerical examples are presented to illustrate the effectiveness of the proposed algorithms. |
| URI: | https://bura.brunel.ac.uk/handle/2438/32648 |
| DOI: | https://doi.org/10.1109/TCYB.2025.3626066 |
| ISSN: | 2168-2267 |
| Other Identifiers: | ORCiD: Zhongyi Zhao https://orcid.org/0000-0002-8393-1008 ORCiD: Zidong Wang https://orcid.org/0000-0002-9576-7401 ORCiD: Jinling Liang https://orcid.org/0000-0001-6910-7285 ORCiD: Wenying Xu https://orcid.org/0000-0002-6110-9160 |
| Appears in Collections: | Dept of Computer Science Research Papers |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| FullText.pdf | For the purpose of open access, the author(s) have applied a Creative Commons Attribution (CC BY) license to any Accepted Manuscript version arising. | 2.68 MB | Adobe PDF | View/Open |
This item is licensed under a Creative Commons License