Resilient Average Consensus on General Directed Graphs in Presence of Cyber-Attacks

Mahdieh S. Sadabadi, Azwirman Gusrialdi

Research output: Contribution to journalArticleScientificpeer-review

21 Downloads (Pure)


This paper proposes a resilient distributed control scheme that ensures average consensus in multi-agent systems with continuous-time single-integrator kinematics in the presence of cyber-attacks. Potential cyber-attacks considered on such systems are in the form of unknown uniformly bounded false data injection (FDI) to control input channels (actuators) and also eavesdropping attacks. The purpose of such cyber-attacks is to disturb the average consensus in multi-agent systems and also to disclose the states of agents. The proposed resilient distributed average consensus protocol includes a set of virtual variables/states being exchanged via a communication network given by a general directed graph (digraph) and is designed to make the closed-loop system stable and preserve the average consensus regardless of the existence of cyber-attacks. Unlike the existing literature, the proposed distributed average consensus framework does not require any conditions on directed graphs to be strongly connected, balanced, or symmetric. A graph-theoretical approach, Lyapunov direct method, and LaSalle’s invariance principle are used to guarantee the rigorous stability of multi-agent systems augmented with the proposed distributed algorithm. Simulation results validate the theoretical contributions of this paper.
Original languageEnglish
Article number100669
Number of pages9
JournalEuropean Journal of Control
Early online date2022
Publication statusPublished - 2022
Publication typeA1 Journal article-refereed

Publication forum classification

  • Publication forum level 1


Dive into the research topics of 'Resilient Average Consensus on General Directed Graphs in Presence of Cyber-Attacks'. Together they form a unique fingerprint.

Cite this