Resilient Randomized Quantized Consensus
From MaRDI portal
Abstract: We consider the problem of multi-agent consensus where some agents are subject to faults/attacks and might make updates arbitrarily. The network consists of agents taking integer-valued (i.e., quantized) states under directed communication links. The goal of the healthy normal agents is to form consensus in their state values, which may be disturbed by the non-normal, malicious agents. We develop update schemes to be equipped by the normal agents whose interactions are asynchronous and subject to non-uniform and time-varying time delays. In particular, we employ a variant of the so-called mean subsequence reduced (MSR) algorithms, which have been long studied in computer science, where each normal agent ignores extreme values from its neighbors. We solve the resilient quantized consensus problems in the presence of totally/locally bounded adversarial agents and provide necessary and sufficient conditions in terms of the connectivity notion of graph robustness. Furthermore, it will be shown that randomization is essential both in quantization and in the updating times when normal agents interact in an asynchronous manner. The results are examined through a numerical example.
Recommendations
- Quantized consensus
- Quantized Consensus by Means of Gossip Algorithm
- An event-triggered approach to quantized resilient consensus
- Distributed dynamic consensus under quantized communication data
- Communication-efficient randomized consensus
- Fast, robust, quantizable approximate consensus
- General resilient consensus algorithms
- Quantised near-consensus via quantised communication links
Cited in
(36)- Resilience against misbehaving nodes in asynchronous networks
- Robust quantized consensus of discrete multi-agent systems under input saturation
- Observer-based distributed fault detection and isolation for second-order multi-agent systems using relative information
- Resilient self/event-triggered consensus based on ternary control
- Resilient multi-dimensional consensus in adversarial environment
- Non-oscillating quantized average consensus over dynamic directed topologies
- Multi-armed bandit based distributed resilient consensus and its applications in social networks
- Randomized transmission protocols for protection against jamming attacks in multi-agent consensus
- Resilient consensus for multi-agent systems subject to differential privacy requirements
- Determining \(r\)- and \((r,s)\)-robustness of digraphs using mixed integer linear programming
- Resilient synchronization of distributed multi-agent systems under attacks
- Resilient consensus of second-order agent networks: asynchronous update rules with delays
- Consensus with quantized relative state measurements
- Resiliency in dynamic leader-follower multiagent systems
- Secure consensus with distributed detection via two-hop communication
- Resilient group consensus in the presence of Byzantine agents
- Effects of topology knowledge and relay depth on asynchronous appoximate consensus
- Quantized Consensus by Means of Gossip Algorithm
- General resilient consensus algorithms
- Differentially private resilient distributed cooperative online estimation over digraphs
- Graph-theoretic approaches for analyzing the resilience of distributed control systems: a tutorial and survey
- Finite-time consensus for leader-follower and leaderless swarms in the presence of malicious agents
- Resilient interval consensus in robust networks
- Cooperative distributed state estimation: resilient topologies against smart spoofers
- Resilient consensus of high-order networks against collusive attacks
- Event‐triggered control for discrete‐time multi‐agent average consensus
- The bottleneck and ceiling effects in quantized tracking control of heterogeneous multi-agent systems under DoS attacks
- Mixed self/event-triggered ternary control for resilient consensus against mobile adversarial agents
- Resilient distributed averaging: adversary detection and topological insights
- Resilient tracking consensus over dynamic random graphs: a linear system approach
- Asynchronous approximate Byzantine consensus: a multi-hop relay method and tight graph conditions
- Resilient bipartite consensus for delayed multi-agent systems with privacy requirements
- Resilient quantised consensus of multiagent systems under malicious attacks
- Privacy preserving resilient consensus for delayed multi-agent systems: a scheme via trusted nodes
- Resilient and privacy-preserving consensus for multi-agent systems
- A rolling horizon game considering network effect in cluster forming for dynamic resilient multiagent systems
This page was built for publication: Resilient Randomized Quantized Consensus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4682299)
