×

Resilient average consensus on general directed graphs in presence of cyber-attacks. (English) Zbl 1501.93146

Summary: This paper proposes a resilient distributed control scheme that ensures average consensus in multi-agent systems with continuous-time single-integrator kinematics in the presence of cyber-attacks. Potential cyber-attacks considered on such systems are in the form of unknown uniformly bounded false data injection (FDI) to control input channels (actuators) and also eavesdropping attacks. The purpose of such cyber-attacks is to disturb the average consensus in multi-agent systems and also to disclose the states of agents. The proposed resilient distributed average consensus protocol includes a set of virtual variables/states being exchanged via a communication network given by a general directed graph (digraph) and is designed to make the closed-loop system stable and preserve the average consensus regardless of the existence of cyber-attacks. Unlike the existing literature, the proposed distributed average consensus framework does not require any conditions on directed graphs to be strongly connected, balanced, or symmetric. A graph-theoretical approach, Lyapunov direct method, and LaSalle’s invariance principle are used to guarantee the rigorous stability of multi-agent systems augmented with the proposed distributed algorithm. Simulation results validate the theoretical contributions of this paper.

MSC:

93D50 Consensus
93A16 Multi-agent systems
93B70 Networked control

References:

[1] Cai, K.; Ishii, H., Average consensus on general strongly connected digraphs, Automatica, 48, 11, 2750-2761 (2012) · Zbl 1252.93004
[2] Charalambous, T.; Yuan, Y.; Yang, T.; Pan, W.; Hadjicostis, C. N.; Johansson, M., Distributed finite-time average consensus in digraphs in the presence of time delays, IEEE Trans. Control Netw. Syst., 2, 4, 370-381 (2015) · Zbl 1370.93169
[3] M.S. Chong, H. Sandberg, A.M.H. Teixeira, A tutorial introduction to security and privacy for cyber-physical systems, in: Proceedings of the 18th European Control Conference (ECC), Naples, Italy, 2019, pp. 968-978. 10.23919/ECC.2019.8795652
[4] Dong, H.; Li, C.; Zhang, Y., Resilient consensus of multi-agent systems against malicious data injections, J. Frankl. Inst., 357, 4, 2217-2231 (2020) · Zbl 1451.93352
[5] M. Franceschelli, A. Giua, C. Seatz, Consensus on the average on arbitrary strongly connected digraphsbased on broadcast gossip algorithms, in: Proceedings of the First IFAC Workshop on Estimation and Control of Networked Systems, Venice, Italy, 2009, pp. 66-71.
[6] Gusrialdi, A.; Qu, Z.; Simaan, M. A., Competitive interaction design of cooperative systems against attacks, IEEE Trans. Autom. Control, 63, 9, 3159-3166 (2018) · Zbl 1423.93267
[7] Kawamura, S.; Cai, K.; Ye, M.; Lin, Z., Tight bound on parameter of surplus-based averaging algorithm over balanced digraphs, Int. J. Control, 93, 8, 1859-1866 (2020) · Zbl 1453.93009
[8] Li, Z.; Li, Z.; Liu, Y., Resilient control design of the third-order discrete-time connected vehicle systems against cyber-attacks, IEEE Access, 8, 157470-157481 (2020)
[9] Liu, S.; Li, T.; Xie, L.; Fu, M.; Zhang, J.-F., Continuous-time and sampled-data-based average consensus with logarithmic quantizers, Automatica, 49, 11, 3329-3336 (2013) · Zbl 1315.93005
[10] Mustafa, A.; Modares, H., Attack analysis and resilient control design for discrete-time distributed multi-agent systems, IEEE Robot. Autom. Lett., 5, 2, 369-376 (2020)
[11] J. Ni, L. Liu, C. Liu, X. Hu, S. Li, Further improvement of fixed-time protocol for average consensus of multi-agent systems, in: Proceedings of the 20th IFAC World Congress, volume 50, Toulouse, France, 2017, pp. 2523-2529.
[12] Olfati-Saber, R.; Murray, R. M., Consensus problems in networks of agents with switching topology and time-delays, IEEE Trans. Autom. Control, 49, 9, 1520-1533 (2004) · Zbl 1365.93301
[13] Pultarova, T., Ukraine grid hack is wake-up call for network operators [news briefing], Eng. Technol., 11, 1, 12-13 (2005)
[14] Qu, Z.; Simaan, M. A., Modularized design for cooperative control and plug-and-play operation of networked heterogeneous systems, Automatica, 50, 9, 24052414 (2014) · Zbl 1297.93016
[15] Ren, W.; Beard, R. W.; Atkins, E. M., Information consensus in multivehicle cooperative control, IEEE Control Syst. Mag., 27, 2, 71-82 (2007)
[16] M.S. Sadabadi, A. Gusrialdi, On resilient design of cooperative systems in presence of cyber-attacks, in: Proceedings of the European Control Conference (ECC), 2021, pp. 946-951. 10.23919/ECC54610.2021.9654990
[17] Torre, G. D.L.; Yucelen, T., Adaptive architectures for resilient control of networked multiagent systems in the presence of misbehaving agents, Int. J. Control, 91, 3, 495-507 (2018) · Zbl 1396.93070
[18] Wang, A.; Liu, W.; Li, T.; Huang, T., Privacy-preserving weighted average consensus and optimal attacking strategy for multi-agent networks, J. Frankl. Inst., 358, 6, 3033-3050 (2021) · Zbl 1464.93073
[19] Shenzhen, China
[20] Wang, D.; Zheng, N.; Xu, M.; Wu, Y.; Hu, Q.; Wang, G., Resilient privacy-preserving average consensus for multi-agent systems under attacks, Proceedings of the 16th International Conference on Control, Automation, Robotics and Vision, 1399-1405 (2020), IEEE
[21] Yildirim, E.; Sarsilmaz, S. B.; Koru, A. T.; Yucelen, T., On control of multiagent systems in the presence of a misbehaving agent, IEEE Control Syst. Lett., 4, 2, 456-461 (2020)
[22] Zeng, W.; Chow, M., Resilient distributed control in the presence of misbehaving agents in networked control systems, IEEE Trans. Cybern., 44, 11, 2038-2049 (2014)
[23] Zhou, J.; Lv, Y.; Wen, G.; Yu, X., Resilient consensus of multiagent systems under malicious attacks: appointed-time observer-based approach, IEEE Trans. Cybern., 1-13 (2021)
[24] Zuo, S.; Yue, D., Resilient output formation containment of heterogeneous multigroup systems against unbounded attacks, IEEE Trans. Cybern., 52, 3, 1902-1910 (2022)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.