Resilient average consensus on general directed graphs in presence of cyber-attacks
From MaRDI portal
Publication:2095296
DOI10.1016/J.EJCON.2022.100669zbMath1501.93146OpenAlexW4282939039MaRDI QIDQ2095296
Mahdieh S. Sadabadi, Azwirman Gusrialdi
Publication date: 9 November 2022
Published in: European Journal of Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejcon.2022.100669
Related Items (1)
Cites Work
- Modularized design for cooperative control and plug-and-play operation of networked heterogeneous systems
- Average consensus on general strongly connected digraphs
- Privacy-preserving weighted average consensus and optimal attacking strategy for multi-agent networks
- Resilient consensus of multi-agent systems against malicious data injections
- Continuous-time and sampled-data-based average consensus with logarithmic quantizers
- Adaptive architectures for resilient control of networked multiagent systems in the presence of misbehaving agents
- Competitive Interaction Design of Cooperative Systems Against Attacks
- Tight bound on parameter of surplus-based averaging algorithm over balanced digraphs
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Distributed Finite-Time Average Consensus in Digraphs in the Presence of Time Delays
This page was built for publication: Resilient average consensus on general directed graphs in presence of cyber-attacks