Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/32447
Full metadata record
DC FieldValueLanguage
dc.contributor.authorWang, Y-A-
dc.contributor.authorWang, Z-
dc.contributor.authorZou, L-
dc.contributor.authorWang, F-
dc.contributor.authorDong, H-
dc.date.accessioned2025-12-04T15:28:29Z-
dc.date.available2025-12-04T15:28:29Z-
dc.date.issued2025-09-29-
dc.identifierORCiD: Yu-Ang Wang https://orcid.org/0000-0002-0952-1465-
dc.identifierORCiD: Zidong Wang https://orcid.org/0000-0002-9576-7401-
dc.identifierORCiD: Lei Zou https://orcid.org/0000-0002-0409-7941-
dc.identifierORCiD: Fan Wang https://orcid.org/0000-0002-0772-9801-
dc.identifierORCiD: Hongli Dong https://orcid.org/0000-0001-8531-6757-
dc.identifier.citationWang, Y.-A. et al. (2025) 'Recursive State Estimation for Nonlinear Cyber-Physical Systems under Random Access Protocol: A Token Bucket Strategy', IEEE Transactions on Systems Man and Cybernetics Systems, 55 (12), pp. 8915 - 8926. doi: 10.1109/TSMC.2025.3612590.en_US
dc.identifier.issn2168-2216-
dc.identifier.urihttps://bura.brunel.ac.uk/handle/2438/32447-
dc.description.abstractThis article investigates the recursive state estimation problem for a class of nonlinear cyber-physical systems (CPSs) operating under a token bucket strategy regulated by a random access protocol (RAP). Communication between sensor nodes and the remote estimator takes place over a shared network, where only one sensor node is permitted to access the network at each time instant to prevent data collisions. The transmission sequence of sensor nodes is governed by RAP scheduling, which is modeled as a sequence of independent and identically distributed variables representing the selected node granted network access. To efficiently manage limited communication resources, a token bucket strategy is employed. The measurement signal from the selected node is transmitted to the estimator only if a sufficient number of tokens are available in the bucket to meet the required token consumption. The objective is to design a state estimation algorithm that minimizes the estimation error covariance (EEC) by appropriately determining the estimator gain at each time step. The desired estimator gain is computed recursively by solving two Riccati-like difference equations. Finally, an illustrative example is presented to validate the effectiveness of the proposed estimation method.en_US
dc.description.sponsorship10.13039/501100001809-National Natural Science Foundation of China (Grant Number: 61933007, 62273087 and U21A2019); Shanghai Pujiang Program of China (Grant Number: 22PJ1400400); Hainan Province Science and Technology Special Fund of China (Grant Number: ZDYF2022SHFZ105); 10.13039/501100000288-Royal Society of the U.K.; Alexander von Humboldt Foundation of Germany.en_US
dc.format.extent8915 - 8926-
dc.format.mediumPrint-Electronic-
dc.languageEnglish-
dc.language.isoen_USen_US
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en_US
dc.subjectcyber-physical systems (CPSs)en_US
dc.subjectnonlinear stochastic systemsen_US
dc.subjectrandom access protocol (RAP)en_US
dc.subjectrecursive state estimationen_US
dc.subjecttoken bucket strategyen_US
dc.titleRecursive State Estimation for Nonlinear Cyber-Physical Systems under Random Access Protocol: A Token Bucket Strategyen_US
dc.typeArticleen_US
dc.date.dateAccepted2025-09-15-
dc.identifier.doihttps://doi.org/10.1109/TSMC.2025.3612590-
dc.relation.isPartOfIEEE Transactions on Systems Man and Cybernetics Systems-
pubs.issue12-
pubs.publication-statusPublished-
pubs.volume55-
dc.identifier.eissn2168-2232-
dcterms.dateAccepted2025-09-15-
Appears in Collections:Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdfCopyright © 2025 Institute of Electrical and Electronics Engineers (IEEE). Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works ( https://journals.ieeeauthorcenter.ieee.org/become-an-ieee-journal-author/publishing-ethics/guidelines-and-policies/post-publication-policies/ ).968.87 kBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.