Please use this identifier to cite or link to this item: https://bura.brunel.ac.uk/handle/2438/33846
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBan, Jie-
dc.contributor.authorGuo, Liangdong-
dc.contributor.authorWang, Zidong-
dc.contributor.authorZou, Lei-
dc.date.accessioned2026-09-10T12:19:12Z-
dc.date.available2026-09-10T12:19:12Z-
dc.date.issued2026-06-15-
dc.identifier.citationBan, J. et al. (2026) 'Finite-Horizon <i>H</i><sub>∞</sub> Consensus Control for IoT-Enabled Multi-Agent Systems With Stochastic Scheduling and Relay-Assisted Communications', IEEE Internet of Things Journal, 13(17), pp. 38709–38720. doi: 10.1109/jiot.2026.3703716.en_US
dc.identifier.urihttps://bura.brunel.ac.uk/handle/2438/33846-
dc.description.abstractThe Internet of Things (IoT) increasingly relies on large-scale networked agents that cooperate over bandwidth-limited and unreliable wireless links. This paper studies the finite-horizon H<inf>∞</inf> consensus control problem for a class of discrete-time IoT-enabled multi-agent systems subject to random parameters, stochastic communication scheduling, and relay-assisted transmissions. To reflect practical IoT communication constraints, a novel transmission framework is considered that integrates a stochastic communication protocol with a decode-and-forward relay mechanism under random packet losses. Within this framework, only a subset of sensing information is scheduled for transmission, encoded, decoded, and forwarded by relay nodes to improve communication reliability and coverage. Based on the resulting networked system model, a distributed consensus controller is designed to attenuate the effects of disturbances and communication uncertainties over a finite time horizon. Sufficient conditions guaranteeing finite-horizon H<inf>∞</inf> consensus are derived in terms of recursive linear matrix inequalities, and a corresponding controller synthesis algorithm is developed. Simulation results illustrate the effectiveness of the proposed approach in achieving robust consensus for IoT-enabled multi-agent systems operating over stochastic relay-assisted communication networks.en_US
dc.description.sponsorship10.13039/501100001809-National Natural Science Foundation of China (Grant Number: 61773013); 10.13039/501100001809-Royal Society of U.K.; Alexander von Humboldt Foundation of Germany.en_US
dc.format.extentpp. 38709–38720-
dc.format.mediumElectronic-
dc.languageEnglishen_US
dc.language.isoen_USen_US
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en_US
dc.rightsRe-use licence for this version: CC BY-
dc.rightsLicence for published version: Publisher's own licence-
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/-
dc.subject<i>H</i><sub>∞</sub> consensus controlen_US
dc.subjectdecode-and-forward (DaF) relayen_US
dc.subjectmultiagent systemsen_US
dc.subjectpacket lossesen_US
dc.subjectstochastic communication protocol (SCP)en_US
dc.subject.other0805 Distributed Computing-
dc.subject.other1005 Communications Technologies-
dc.titleFinite-Horizon <i>H</i><sub>∞</sub> Consensus Control for IoT-Enabled Multi-Agent Systems With Stochastic Scheduling and Relay-Assisted Communicationsen_US
dc.typeArticleen_US
dc.date.dateAccepted2026-06-10-
dc.identifier.doihttps://doi.org/10.1109/jiot.2026.3703716-
dc.relation.isPartOfIEEE Internet of Things Journalen_US
pubs.issue17-
pubs.publication-statusPublished-
pubs.volume13-
dc.identifier.eissn2327-4662-
dc.rights.licensehttps://creativecommons.org/licenses/by/4.0/legalcode.en-
dcterms.dateAccepted2026-06-10-
dcterms.issued2026-06-15-
dc.date.updated2026-09-02T21:36:59Z-
dc.rights.holderInstitute of Electrical and Electronics Engineers (IEEE)-
dc.contributor.orcidBan, Jie [0009-0006-8856-0695]-
dc.contributor.orcidWang, Zidong [0000-0002-9576-7401]-
dc.contributor.orcidZou, Lei [0000-0002-0409-7941]-
Appears in Collections:Department of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdfCopyright ‘For the purpose of open access, the author has applied a ‘Creative Commons Attribution (CC BY) licence to any Author Accepted Manuscript version arising.’1.05 MBAdobe PDFView/Open


This item is licensed under a Creative Commons License Creative Commons