Reachable set estimation of multi-agent systems under packet losses and deception attacks

This paper considers the problem of estimating reachable set in leaderless consensus for multi-agent systems with Lipschitz nonlinear dynamics and bounded external disturbances. Initially, a sampled-data control is introduced to address the consensus of nonlinear multi-agent systems vulnerable to deception attacks and packet dropouts, which occur randomly during sampling intervals. Then, aperiodic sampling in various degrees is taken into account in the primary Lyapunov term. Sufficient conditions to guarantee that all the actual states of the multi-agent, starting from the initial state, can be bounded within a given ellipsoid set are established by designing a suitable controller. Moreover, the consensus control design is established as linear matrix inequalities, utilizing a two-sided looped functional and Wirtinger’s inequality-based discontinuous Lyapunov–Krasovskii functional. Finally, the numerical section validates the applicability of the proposed control method.