Resilient Consensus for Multi-agent Networks with Mobile Detectors
This paper investigates the problem of resilient consensus for multi-agent systems under malicious attacks. Compared with most of existing works, a more flexible network topology scheme is considered, where a kind of specific agents as the mobile detectors and builders of network robustness are adopted. Specifically, the mobile agents can perceive the message of their nearby agents in the dynamic network, and acquire both in-degree and state information of each node as characteristics to judge the network state as well as communication links between nodes. It is shown that even in poor network robustness, the non-faulty agents can still achieve a consensus in finite time with the help of mobile agents. Finally, the simulation results show the effectiveness of the proposed method.
KeywordsResilient consensus Network security Mobile detector
This work is supported by the cyberspace security Major Program in National Key Research and Development Plan of China under grant 2016YFB0800201, Natural Science Foundation of China under grants 61572165, 61702150 and 61803135, State Key Program of Zhejiang Province Natural Science Foundation of China under grant LZ15F020003, Key Research and Development Plan Project of Zhejiang Province under grants 2017C01062 and 2017C01065, and Zhejiang Provincial Basic Public Welfare Research Project under grant LGG18F020015.
- 4.Zhu, Y., Li, S., Ma, J., Zheng, Y.: Bipartite consensus in networks of agents with antagonistic interactions and quantization. IEEE Trans. Circ. Syst. II Express Briefs (2018). https://doi.org/10.1109/TCSII.2018.2811803
- 6.LeBlanc, H.J., Koutsoukos, X.D.: Consensus in networked multi-agent systems with adversaries. In: 14th International Conference on Hybrid Systems: Computation and Control, pp. 281–290. ACM (2011)Google Scholar
- 15.Vaidya, N.H., Tseng, L., Liang, G.: Iterative approximate byzantine consensus in arbitrary directed graphs. In: 2012 ACM Symposium on Principles of Distributed Computing, pp. 365–374. ACM (2012)Google Scholar
- 16.Zhang, H., Sundaram, S.: Robustness of information diffusion algorithms to locally bounded adversaries. In: 2012 American Control Conference (ACC 2012), pp. 5855–5861. IEEE (2012)Google Scholar