Sampled-data-based event-triggered secure bipartite tracking consensus of linear multi-agent systems under DoS attacks

Sampled‐data bipartite consensus control of nonlinear multi‐agent systems under denial‐of‐service attacks

“…Remark Similar to the DoS attack model in the works of Cong et al 24 and Feng and Tesi, 30 we assume DoS attacks cause all channels to be corrupted synchronously, which implies that, for each agent, its neighbor information cannot be used in attacked time. Recently, the secure control problems with DoS attacks corrupting different channels individually have been effectively solved in the works of Lu and Yang, 25,26 Sun and Yang 27,28 .…”

“…Then, a sampled‐data output feedback secure control protocol is designed. It is quite different from the state feedback secure control strategy adopted in the works of Zhang et al, 20 Cong et al, 24 and Shi et al 29 Based on piecewise Lyapunov function method and average dwell time method, the influence of DoS attacks can be overcome effectively, and the secure control protocol is designed to make the system achieve bipartite consensus while maintaining the tolerance to DoS attacks. Moreover, compared with the works of An and Yang, 21 Guo et al 23 the celebrated backstepping design method is not utilized, the steps of constructing controller are simpler and the controller form is clearer.…”

“…An improved average dwell time method was utilized to study a class of strict‐feedback CPSs in the work of An and Yang 21 . Then, the decentralized sampled‐data controller was constructed for nonstrict‐feedback CPSs in the work of Li et al 22 Based on a novel switching‐type observer, the event‐triggered secure consensus problem was investigated for nonlinear MASs in the work of Guo et al 23 For linear MASs under cyber attacks considered in the work of Cong et al 24 the bipartite consensus tracking problem was solved based on state feedback control scheme. Recently, a more practical design framework against the various DoS attacks models was developed in the works of Lu and Yang 25,26 .…”

“…Case 1 t ∈ [T 2s , T 2s+1 ) ⊆ T o (t 0 , t) Substituting ( 23), (24), and ( 27) into ( 21), one gets…”

Leader‐following consensus of multiple uncertain Euler–Lagrange systems under denial‐of‐service attacks

“…Furthermore, the DoS attacks mentioned therein can lead to degradation of system performance, and in severe cases, even direct failure of the system to work at all. However, in the current research on the theory of complex systems, we find that in the field of multi-agent systems with small cluster samples, one's protection against DoS attacks is only limited to first-order linear systems, 25 there is not even a relevant study in the ELSs, [26][27][28][29][30][31] and it leads to results of little practical significance due to over-simplified and idealized models. In this article, we discuss how to protect against DoS attacks in more complex and practically applicable ELSs.…”