Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/23554
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLiu, H-
dc.contributor.authorWang, Z-
dc.contributor.authorFei, W-
dc.contributor.authorDong, H-
dc.date.accessioned2021-11-19T13:18:41Z-
dc.date.available2021-11-19T13:18:41Z-
dc.date.issued2021-01-20-
dc.identifier.citationLiu, H., Wang , Z., Fei, W. and Dong, H. (2021) 'On State Estimation for Discrete Time-Delayed Memristive Neural Networks Under the WTOD Protocol: A Resilient Set-Membership Approach', IEEE Transactions on Systems, Man, and Cybernetics: Systems, 0 (in press), pp. 1-11. doi: 10.1109/TSMC.2021.3049306.en_US
dc.identifier.issn2168-2216-
dc.identifier.urihttps://bura.brunel.ac.uk/handle/2438/23554-
dc.description.abstractIn this article, a resilient set-membership approach is put forward to deal with the state estimation problem for a sort of discrete-time memristive neural networks (DMNNs) with hybrid time delays under the weighted try-once-discard protocol (WTODP). The WTODP is utilized to mitigate unnecessary network congestion occurring in the channel between DMNNs and the state estimator. In order to ensure resilience against possible realization errors, the estimator gain is permitted to undergo some norm-bounded parameter drifts. Our objective is to design a resilient set-membership estimator (RSME) that is capable of resisting gain variations and unknown-but-bounded noises by confining the estimation error to certain ellipsoidal regions. By resorting to the recursive matrix inequality technique, sufficient conditions are acquired for the existence of the expected RSME and, subsequently, an optimization problem is formalized by minimizing the constraint ellipsoid (with respect to the estimation error) under WTODP. Finally, numerical simulation is carried out to validate the usefulness of RSME.en_US
dc.description.sponsorship10.13039/501100001809-National Natural Science Foundation of China (Grant Number: 61873058, 61873148 and 61933007); AHPU Youth Top-Notch Talent Support Program of China (Grant Number: 2018BJRC009); Natural Science Foundation of Universities in Anhui Province of China (Grant Number: gxyqZD2019053); Heilongjiang Postdoctoral Sustentation Fund of China (Grant Number: LBH-Z19048); Royal Society of the U.K.; Alexander von Humboldt Foundation of Germany.en_US
dc.format.extent1 - 11 (11)-
dc.format.mediumPrint-Electronic-
dc.language.isoen_USen_US
dc.publisherIEEEen_US
dc.rights© 2021 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.-
dc.subjectdiscrete-time memristive neural networks (DMNNs)en_US
dc.subjecthybrid time delays (HTDs)en_US
dc.subjectresilient state estimationen_US
dc.subjectset-membership state estimationen_US
dc.subjectweighted try-once-discarden_US
dc.subjectprotocol (WTODP)en_US
dc.titleOn State Estimation for Discrete Time-Delayed Memristive Neural Networks Under the WTOD Protocol: A Resilient Set-Membership Approachen_US
dc.typeArticleen_US
dc.identifier.doihttps://doi.org/10.1109/TSMC.2021.3049306-
dc.relation.isPartOfIEEE Transactions on Systems, Man, and Cybernetics: Systems-
pubs.publication-statusPublished-
pubs.volume0-
dc.identifier.eissn2168-2232-
Appears in Collections:Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdf© 2021 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.414.7 kBAdobe PDFView/Open


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