Resilient Leader-Follower Consensus of Discrete-Time High-Order Multi-Agent Systems with Time-Varying Graphs

This paper addresses the resilient leader-follower consensus problem for discrete-time high-order multi-agent systems with time-varying graphs. A resilient control law is proposed for each normally functioning follower to effectively mitigate the disruptive effects of malicious agents. Under the proposed control law, resilient leader-follower consensus is achieved exponentially, given that the graph is jointly strongly $(2 f+1)$-robust, significantly reducing the communication burden at each time step. Finally, the effectiveness of the proposed approach is validated through a numerical simulation.