Distributed Consensus With Limited Communication Data Rate
By Tao Li, M. Fu, Lihua Xie, Ji-feng Zhang. 2011
536 citations recorded by the source corpus.
Subfields: Computer Networks and Communications
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
Citations in the corpus
- Decentralized Stochastic Optimization and Gossip Algorithms with Compressed Communication (2019, methodology): “In order to converge, adaptive schemes (with varying compression accuracy) have been proposed (Carli et al., 2010a; Fang & Li, 2010; Li et al., 2011; Thanou et al., 2013).”
- The blockchain: a new framework for robotic swarm systems (2016, background): “Finally, limitations and possible future problems that arise from the combination of these two technologies are described.”
- Distributed consensus of linear multi-agent systems with adaptive dynamic protocols (2011, unknown): “Consensus algorithms are designed in [7, 13] for a group of agents with quantized communication links and limited data rate.”
- Distributed averaging on digital erasure networks (2011, background): “In fact, some recent work has addressed the cases of quantized communication [2, 8, 13, 3, 15], or transmission affected by additive noise [11, 17, 12].”
- Distributed robust consensus control of multi-agent systems with heterogeneous matching uncertainties (2013, background): “Consensus algorithms are designed in [8,17] for multi-agent systems with quantized communication links.”
- Network Topology and Communication Data Rate for Consensusability of Discrete-Time Multi-Agent Systems (2011, background): “By Lemmas A.1–A.2 [18], an upper bound of the eigenratio is immediately obtained, i.e. 2) For the average consensus problem in [33], the state of each agent is scalar and .”
- Design and analysis of distributed averaging with quantized communication (2014, background): “In [21] the distributed averaging problem with quantized communication is formulated as a feedback control design problem for coding/decoding schemes; the paper shows that with an appropriate scaling function and some carefully chosen control gain, the proposed protocol can solve the distributed ave”
- Consensus of Multi-Agent Systems With General Linear and Lipschitz Nonlinear Dynamics Using Distributed Adaptive Protocols (2011, background): “Consensus algorithms are designed in [8], [9] for a group of agents with quantized communication links and limited data rate.”
- Discontinuities and hysteresis in quantized average consensus (2010, unknown): “A number of publications have discussed –mostly in discretetime systems– several options to deal with the quantization constraint, namely uniform deterministic quantizers [13,18], uniform randomized quantizers [2], logarithmic quantizers [5], and adaptive quantizers [17].”
- Designing Fully Distributed Consensus Protocols for Linear Multi-Agent Systems With Directed Graphs (2013, background): “h as spacecraft formation flying, sensor networks, and cooperat ive surveillance [1], the consensus control problem has been addressed by many researchers from various perspectives; see [1], [2], [3], [4], [5] and the references therein. Existing consensus algorithms can be roughly categorized into t”
- Distributed Average Consensus With Quantization Refinement (2013, methodology): “We propose a recurrence relation for computing the quantization parameters that depend on the network topology and the communication rate.”
- Robust semi‐global coordinated tracking of linear multi‐agent systems with input saturation (2015, background): “In previous studies, the coordinated tracking problem was first discussed for singleintegrator kinematics [14], [15], [16], and then generalized to double-integrator dynamics [17], [18], [19], [20], [21], [22] and general linear or nonlinear dynamics [23], [24], [25], [26], [27], [28], [29], [30].”
- Finite Rate Quantized Distributed optimization with Geometric Convergence (2018, background): “While distributed average consensus problems using quantized communications have been extensively studied in the literature–examples are [10]–[12]–distributed optimization algorithms along with their rate guarantees in the presence of quantized communications are less understood.”