Dynamic Resilient Consensus of Second-Order Multiagent Networks With a Time-Varying Malicious Agent Set

We address the problem of resilient consensus in second-order multiagent networks (MANs) with a time-varying set of malicious agents. Existing research typically assumes a static set of malicious agents. However, in real-world scenarios, network attacks and recoveries may lead to dynamic changes in the roles of agents. To overcome this challenge, a novel adaptive weighted subsequence reduction (AWSR) is proposed for resilient consensus in MANs with a dynamic malicious agent set. Based on the AWSR approach, a resilient consensus algorithm is designed for second-order MANs. Graph-theoretic conditions in the context of network robustness are derived to ensure resilient consensus in the considered MAN. We also extend the algorithm and analysis to MANs with communication delays. Finally, simulation experiments are conducted to demonstrate the effectiveness of the proposed algorithms.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Automatic Control
Published
2024-11-27
DOI
https://doi.org/10.1109/tac.2024.3507672
Citations
9
Primary Topic
Distributed Control Multi-Agent Systems
Type
article
Field-Weighted Citation Impact
3.14

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dynamic Resilient Consensus of Second-Order Multiagent Networks With a Time-Varying Malicious Agent Set

Lintao Ye, Ming Chi, Zhi-Wei Liu, Dingxin He et al.
9 citations
IEEE Transactions on Automatic Control
Distributed Control Multi-Agent Systems
3.14
article

Dynamic Resilient Consensus of Second-Order Multiagent Networks With a Time-Varying Malicious Agent Set

Lintao Ye, Ming Chi, Zhi-Wei Liu, Dingxin He, Ze-Qiang Liu
article en
9 citations

Abstract

We address the problem of resilient consensus in second-order multiagent networks (MANs) with a time-varying set of malicious agents. Existing research typically assumes a static set of malicious agents. However, in real-world scenarios, network attacks and recoveries may lead to dynamic changes in the roles of agents. To overcome this challenge, a novel adaptive weighted subsequence reduction (AWSR) is proposed for resilient consensus in MANs with a dynamic malicious agent set. Based on the AWSR approach, a resilient consensus algorithm is designed for second-order MANs. Graph-theoretic conditions in the context of network robustness are derived to ensure resilient consensus in the considered MAN. We also extend the algorithm and analysis to MANs with communication delays. Finally, simulation experiments are conducted to demonstrate the effectiveness of the proposed algorithms.

IEEE Transactions on Automatic ControlVol. 70(5)
Huazhong University of Science and Technology (CN)
National Natural Science Foundation of China
Climate action
Openalex Percentile: Top 7%
Distributed Control Multi-Agent Systems
3.14
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Dynamic Resilient Consensus of Second-Order Multiagent Networks With a Time-Varying Malicious Agent Set — Lintao Ye, Ming Chi, et al. · IEEE Transactions on Automatic Control (2024) | TGRS Research Map | TGRS