Communication constraints in the average consensus problem
By Ruggero Carli, Fabio Fagnani, Alberto Speranzon, Sandro Zampieri. at - Automatisierungstechnik, 2008
294 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Control and Systems Engineering
View Paper: https://www.semanticscholar.org/paper/f581cd3b74c411f6faefbba953b9f71c828915fe
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
- Francesco Bullo
- Jorge Cortés
- Angelia Nedić
- Ali H. Sayed
- Michael G. Rabbat
- Sonia Martínez
- Ruggero Carli
- José M. F. Moura
In Control and Systems Engineering
- Francesco Bullo
- Sandro Zampieri
- Paolo Frasca
- Ruggero Carli
- Luca Schenato
- Shengyuan Xu
- R. Evans
- G. Nair
Citations in the corpus
- Quantized Coordination Algorithms for Rendezvous and Deployment (2009, background): “In [4], time-invariant communication networks with the combined exchange of ideal and logarithmic quantized data exchange are analyzed.”
- Convergence Analysis of Quantized Primal-Dual Algorithms in Network Utility Maximization Problems (2016, background): “ommunications on the convergence behavior of consensus algorithms has been extensively studied in the literature. As this is not the main direction of our research, interested readers are referred to [11]-[13] and references therein for a thorough investigation of this topic. C. Contributions We con”
- On quantized consensus by means of gossip algorithm - Part II: Convergence time (2009, background): “The work [13] elaborates on the relationship between the amount of information exchanged by the agents and the rate of convergence to the consensus.”
- Stochastic Consensus Seeking With Noisy and Directed Inter-Agent Communication: Fixed and Randomly Varying Topologies (2010, background): “In [7], the effect of logarithmic quantization error was analyzed .”
- Coherence in Large-Scale Networks: Dimension-Dependent Limitations of Local Feedback (2011, unknown): “This difference leads to more severe asymptotic scalings in vehicular formations as will be shown in the sequel.”
- Communication‐based performance bounds in nonlinear coordinated control (2011, background): “1411 Furthermore, linear consensus algorithms are known to have a good robustness to time-delay [9–11] and to time-varying network topology and communication unreliability [9, 12].”
- A Gossip-Based Algorithm for Discrete Consensus Over Heterogeneous Networks (2010, background): “The study of consensus networks has recently stirred much interest in the control community with a particular focus on the deep connection between consensus and algebraic graph theory [1]–[6].”
- Stochastic consensus over noisy networks with Markovian and arbitrary switches (2010, background): “Fagnani and Zampieri (2009) studied average consensus with independent packet dropping and analyzed the effect of the loss probability on performance. However, in practical systems, the loss of connectivity usually occurs with correlations, and for random graph based consensus models, this correlati”
- Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms (2009, background): “, 2006; Zhu and Mart́ınez, 2008a), characterization of convergence rates and time complexity (Landau and Odlyzko, 1981; Olshevsky and Tsitsiklis, 2009; Cao et al., 2008; Carli et al., 2008).”
- Quantized Consensus by Means of Gossip Algorithm (2012, background): “The work [15] elaborates the relationship between the amount of information exchanged by the agents and the rate of”
- Quantized average consensus via dynamic coding/decoding schemes (2008, background): “It is worth noting that this situation is encountered in many practical situations [12], [2], [13].”
- Gossip Algorithms for Distributed Signal Processing (2010, background): “r can yield improved performance and lower cost; this is the tenet of the work in [78], [79], which analyzed a more general class of quantizers. They can be captured in a similar framework as that of [76] by adding an auxiliary state variable ij(t), which affects the state of the decoder only (see t”
- Distributed dual averaging method for multi-agent optimization with quantized communication (2012, background): “Recently, many papers have considered the quantization effects on the average consensus algorithms [17–19].”