Fixed‐time consensus of networked Euler–Lagrange systems over event‐based communication under DoS attacks

Abstract

This article focuses on fixed‐time consensus of networked Euler–Lagrange systems (NELSs) over event‐based communication under denial‐of‐service (DoS) attacks. First of all, a basic fixed‐time consensus algorithm is developed for NELSs, where a general fixed‐time communication triggering scheme through error decomposition method is designed for decreasing communication frequencies while avoiding singularity. Then, to fulfil the consensus problem of NELSs in the presence of DoS attacks, a novel fixed‐time resilient algorithm is further presented by the basic algorithm, where the effective attack interval is redefined for carrying out the algorithm design. Furthermore, a hierarchical fixed‐time control framework with privacy preservation is introduced for the consensus problem of NELSs under DoS attacks. Meanwhile, a self‐triggered scheme is employed for the above algorithms to lower the update frequencies of control inputs. The stated algorithms possess a uniformly constrained upper bound on the convergence time, and are resilient as well as responsive to DOS attacks while saving control resources significantly. Finally, numerous illustrative examples are given for demonstrating the efficacy of the derived schemes.