Resilient Consensus of Second-Order Agent Networks: Asynchronous Update Rules with Delays

  title={Resilient Consensus of Second-Order Agent Networks: Asynchronous Update Rules with Delays},
  author={Seyed Mehran Dibaji and Hideaki Ishii},

Figures from this paper

Resilient Consensus with Switching Networks and Double-Integrator Agents
This paper proposes a local neighbors’ information-based on distributed consensus protocol suitable for time-varying topologies to deal with the malicious attacks in the second-order multi-agent system communicating via switching networks.
Resilient Consensus Through Asynchronous Event-based Communication
Two update rules which can mitigate the influence of the malicious agents and at the same time reduce the necessary communication are developed which are stated in terms of the notion of graph robustness.
Resilient Consensus Through Event-Based Communication
We consider resilient versions of discrete-time multiagent consensus in the presence of faulty or even malicious agents in the network. In particular, we develop event-triggered update rules that can
Sampled‐data based resilient consensus of heterogeneous multiagent systems
This article studies consensus of a group of heterogeneous agents with first-order and second-order integrator dynamics in presence of malicious agents to guarantee resilient consensus in directed networks.
A Distributed Model Predictive Scheme for Resilient Consensus with Input Constraints
  • Yuan Wang, H. Ishii
  • Mathematics
    2019 IEEE Conference on Control Technology and Applications (CCTA)
  • 2019
An algorithm is derived which ignores the large and small value from neighbors to avoid the influence of malicious nodes and is guaranteed to attain resilient consensus under the topological condition expressed in terms of graph robustness.
Resilient Consensus Against Mobile Malicious Agents
An Event-Triggered Approach to Quantized Resilient Consensus
This work considers an event-triggered update scheme for the problem of multi-agent consensus in the presence of faulty and malicious agents within the network and describes the error bound on the achievable level of consensus among the agents as well as the necessary structure for the network in terms of the notion of robust graphs.
Resilient Impulsive Control for Second-Order Consensus Under Malicious Nodes
A resilient impulsive algorithm is proposed, in which the signal transmission among agents occurs with aperiodic intervals, and it is shown the influence of the malicious nodes on the normal ones would be limited by this manner.


Resilient consensus of second-order agent networks: Asynchronous update rules over robust graphs
This paper addresses the problem of resilient consensus of sampled-data multi-agent networks with doubleintegrator dynamics with an emphasis on networks of vehicles and presents topological conditions in terms of graph robustness.
Resilient Multi-Agent Consensus with Asynchrony and Delayed Information
Resilient consensus of double-integrator multi-agent networks with communication delays
A multi-agent network of second-order dynamics and study its resilient consensus taking account of cyber security issues with an emphasis on networks of vehicles is considered and topological conditions in terms of graph robustness are developed.
Consensus of second-order multi-agent systems in the presence of locally bounded faults
Resilient randomized quantized consensus
It will be shown that randomization is essential both in quantization and in the updating times when normal agents interact in an asynchronous manner.
Consensus Computation in Unreliable Networks: A System Theoretic Approach
This paper characterize the set of inputs that allow misbehaving agents to affect the consensus network while remaining undetected and/or unidentified from certain observing agents, and designs three algorithms to detect and identify misbehave agents.
Resilient asymptotic consensus in asynchronous robust networks
The asynchronous consensus algorithm studied here uses local strategies to ensure resilience against the adversary nodes and is robust, which is an important property for analyzing the behavior of resilient distributed algorithms that use only local information.
Distributed Function Calculation via Linear Iterative Strategies in the Presence of Malicious Agents
The topology of the network completely characterizes the resilience of linear iterative strategies to this kind of malicious behavior and it is shown that node xi is guaranteed to be able to calculate any arbitrary function of all node values when the number of malicious nodes is f or less.
Resilient Asymptotic Consensus in Robust Networks
This paper designs a consensus protocol based on local information that is resilient to worst-case security breaches, assuming the compromised nodes have full knowledge of the network and the intentions of the other nodes, and develops a novel graph-theoretic property referred to as network robustness.
Consensus of multiple double‐integrator agents with intermittent measurement
It is proved that consensus can be reached if the delays are small enough, and an admissible upper bound of delays is derived.