TY - JOUR
T1 - Resilient Cluster Consensus of Multiagent Systems
AU - Shang, Yilun
N1 - Funding information: This work was supported in part by UoA Flexible Fund under Grant 201920A1001.
PY - 2022/1/1
Y1 - 2022/1/1
N2 - We investigate the problems of resilient cluster consensus in directed networks under three types of multiagent dynamics, namely, continuous-time multiagent systems, discrete-time multiagent systems, and switched multiagent systems composed of both continuous-time and discrete-time components. Resilient cluster censoring strategies are proposed to ensure cluster consensus against locally bounded Byzantine nodes in a purely distributed manner, where neither the number/identity of Byzantine nodes nor the division of clusters is assumed. We do not require complicated algebraic conditions or any balance conditions over intercluster structures, distinguishing the current work from previous results on cluster consensus problems besides a fortiori the attack-tolerant feature. Sufficient conditions are established in all the three scenarios based on the graph robustness. Furthermore, we solve the heterogenous cluster robustness problems and resilient scaled cluster consensus problems as extensions. The theoretical results are illustrated through numerical examples including the Santa Fe collaboration network.
AB - We investigate the problems of resilient cluster consensus in directed networks under three types of multiagent dynamics, namely, continuous-time multiagent systems, discrete-time multiagent systems, and switched multiagent systems composed of both continuous-time and discrete-time components. Resilient cluster censoring strategies are proposed to ensure cluster consensus against locally bounded Byzantine nodes in a purely distributed manner, where neither the number/identity of Byzantine nodes nor the division of clusters is assumed. We do not require complicated algebraic conditions or any balance conditions over intercluster structures, distinguishing the current work from previous results on cluster consensus problems besides a fortiori the attack-tolerant feature. Sufficient conditions are established in all the three scenarios based on the graph robustness. Furthermore, we solve the heterogenous cluster robustness problems and resilient scaled cluster consensus problems as extensions. The theoretical results are illustrated through numerical examples including the Santa Fe collaboration network.
KW - Cluster consensus
KW - Clustering algorithms
KW - Heuristic algorithms
KW - Multi-agent systems
KW - Network topology
KW - Nickel
KW - Robustness
KW - Switches
KW - continuous time
KW - discrete time
KW - robustness
KW - switched multiagent system
UR - http://www.scopus.com/inward/record.url?scp=85086724940&partnerID=8YFLogxK
U2 - 10.1109/TSMC.2020.2997855
DO - 10.1109/TSMC.2020.2997855
M3 - Article
SN - 1083-4427
SN - 2168-2216
SN - 2168-2232
VL - 52
SP - 346
EP - 356
JO - IEEE Transactions on Systems, Man and Cybernetics: Systems
JF - IEEE Transactions on Systems, Man and Cybernetics: Systems
IS - 1
ER -