A Fully Distributed Robust Secure Consensus Protocol for Linear Multi-Agent Systems
Jingyao Wang, Yige Li, Zhisheng Duan, Jianping Zeng
Abstract
This brief analyzes the robust secure consensus control problem for linear multi-agent systems under random Denial-of-Service (DoS) attacks and external disturbances. When agents communicate with its neighbors, a malicious attacker randomly carries out DoS attacks to certain communication channels in the network, thereby causing the communication topology to be Markovian switching. Solely depending on the immediate partial information per node rather than global information, a fully distributed robust secure consensus protocol is put forward under DoS attacks and external disturbances by using the Lyapunov function analysis. A simulation case of leader-follower formation is taken to explain the efficiency of the consensus algorithm.