Resilient Consensus for Multi-Agent Systems Under Adversarial Spreading Processes
2022 (English)In: IEEE Transactions on Network Science and Engineering, E-ISSN 2327-4697, Vol. 9, no 5, p. 3316-3331Article in journal (Refereed) Published
Abstract [en]
This paper addresses novel consensus problems for multi-agent systems operating in an unreliable environment where adversaries are spreading. The dynamics of the adversarial spreading processes follows the susceptible-infected-recovered (SIR) model, where the infection induces faulty behaviors in the agents and affects their state values. Such a problem setting serves as a model of opinion dynamics in social networks where consensus is to be formed at the time of pandemic and infected individuals may deviate from their true opinions. To ensure resilient consensus among the noninfectious agents, the difficulty is that the number of infectious agents changes over time. We assume that a local policy maker announces the local level of infection in real-time, which can be adopted by the agent for its preventative measures. It is demonstrated that this problem can be formulated as resilient consensus in the presence of the socalled mobile malicious models, where the mean subsequence reduced (MSR) algorithms are known to be effective. We characterize sufficient conditions on the network structures for different policies regarding the announced infection levels and the strength of the epidemic. Numerical simulations are carried out for random graphs to verify the effectiveness of our approach.
Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE) , 2022. Vol. 9, no 5, p. 3316-3331
Keywords [en]
Heuristic algorithms, Behavioral sciences, Pandemics, Adaptation models, Social networking (online), Numerical models, Multi-agent systems, Epidemic malicious model, fault tolerant distributed algorithms, opinion dynamics, resilient consensus
National Category
Public Health, Global Health, Social Medicine and Epidemiology
Identifiers
URN: urn:nbn:se:kth:diva-319081DOI: 10.1109/TNSE.2022.3176214ISI: 000852246800031Scopus ID: 2-s2.0-85130825251OAI: oai:DiVA.org:kth-319081DiVA, id: diva2:1698849
Note
QC 20220926
2022-09-262022-09-262024-01-05Bibliographically approved