Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/32648
Full metadata record
DC FieldValueLanguage
dc.contributor.authorZhao, Z-
dc.contributor.authorWang, Z-
dc.contributor.authorLiang, J-
dc.contributor.authorXu, W-
dc.date.accessioned2026-01-15T12:07:59Z-
dc.date.available2026-01-15T12:07:59Z-
dc.date.issued2025-11-04-
dc.identifierORCiD: Zhongyi Zhao https://orcid.org/0000-0002-8393-1008-
dc.identifierORCiD: Zidong Wang https://orcid.org/0000-0002-9576-7401-
dc.identifierORCiD: Jinling Liang https://orcid.org/0000-0001-6910-7285-
dc.identifierORCiD: Wenying Xu https://orcid.org/0000-0002-6110-9160-
dc.identifier.citationZhao, 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.en_US
dc.identifier.issn2168-2267-
dc.identifier.urihttps://bura.brunel.ac.uk/handle/2438/32648-
dc.description.abstractThis 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.en_US
dc.description.sponsorship10.13039/501100001809-National Natural Science Foundation of China (Grant Number: 62373103, 62403130 and 62573121); Jiangsu Provincial Scientific Research Center of Applied Mathematics of China (Grant Number: BK20233002); Natural Science Foundation of Jiangsu Province of China (Grant Number: BK20241286); Jiangsu Funding Program for Excellent Postdoctoral Talent of China (Grant Number: 2024ZB601); China Postdoctoral Science Foundation-China Coal Technology and Engineering Group (CCTEG) Joint Support Program (Grant Number: 2025T055ZGMK); 10.13039/501100000288-Royal Society of UK; Alexander von Humboldt Foundation of Germany.en_US
dc.format.extent1 - 14-
dc.format.mediumPrint-Electronic-
dc.languageEnglish-
dc.language.isoen_USen_US
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en_US
dc.rightsCreative Commons Attribution 4.0 International-
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/-
dc.subjectbuffer-aided strategyen_US
dc.subjectcomplex networks (CNs)en_US
dc.subjectfusion estimationen_US
dc.subjectzonotopic set-membership estimation (SME)en_US
dc.titleZonotopic Set-Membership Fusion Estimation for Complex Networks: A Buffer-Aided Strategyen_US
dc.typeArticleen_US
dc.date.dateAccepted2025-10-23-
dc.identifier.doihttps://doi.org/10.1109/TCYB.2025.3626066-
dc.relation.isPartOfIEEE Transactions on Cybernetics-
pubs.issue0-
pubs.publication-statusPublished-
pubs.volume00-
dc.identifier.eissn2168-2275-
dc.rights.licensehttps://creativecommons.org/licenses/by/4.0/legalcode.en-
dcterms.dateAccepted2025-10-23-
dc.rights.holderThe Author(s)-
dc.contributor.orcidZhao, Zhongyi [0000-0002-8393-1008]-
dc.contributor.orcidWang, Zidong [0000-0002-9576-7401]-
dc.contributor.orcidLiang, Jinling 0000-0001-6910-7285]-
dc.contributor.orcidXu, Wenying [0000-0002-6110-9160]-
Appears in Collections:Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdfFor 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 MBAdobe PDFView/Open


This item is licensed under a Creative Commons License Creative Commons