Gossip consensus algorithms via quantized communication
From MaRDI portal
Publication:985266
DOI10.1016/J.AUTOMATICA.2009.10.032zbMATH Open1214.93122arXiv0907.0748OpenAlexW2028201344MaRDI QIDQ985266FDOQ985266
Authors: Ruggero Carli, Fabio Fagnani, Paolo Frasca, Sandro Zampieri 
Publication date: 20 July 2010
Published in: Automatica (Search for Journal in Brave)
Abstract: This paper considers the average consensus problem on a network of digital links, and proposes a set of algorithms based on pairwise gossip communications and updates. We study the convergence properties of such algorithms with the goal of answering two design questions, arising from the literature: whether the agents should encode their communication by a deterministic or a randomized quantizer, and whether they should use, and how, exact information regarding their own states in the update.
Full work available at URL: https://arxiv.org/abs/0907.0748
Recommendations
- Average consensus on networks with quantized communication
- Distributed average consensus via gossip algorithm with real-valued and quantized data for \(0<q<1\)
- Quantized consensus of multi-agent systems via broadcast gossip algorithms
- Quantized consensus
- Convergence time analysis of quantized gossip consensus on digraphs
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Decentralized systems (93A14) Design techniques (robust design, computer-aided design, etc.) (93B51)
Cites Work
- Quantized consensus
- Consensus and Cooperation in Networked Multi-Agent Systems
- A Necessary and Sufficient Condition for Consensus Over Random Networks
- Title not available (Why is that?)
- On Distributed Averaging Algorithms and Quantization Effects
- Average Consensus with Packet Drop Communication
- Distributed Consensus Algorithms in Sensor Networks: Quantized Data and Random Link Failures
- Average consensus on networks with quantized communication
- Decentralized Estimation in an Inhomogeneous Sensing Environment
- Distributed Average Consensus With Dithered Quantization
- Quantized average consensus via dynamic coding/decoding schemes
- Quantized Consensus by Means of Gossip Algorithm
Cited In (70)
- Broadcast Gossip Algorithms for Consensus
- Gossip consensus algorithm based on time-varying influence factors and weakly connected graph for opinion evolution in social networks
- Distributed learning of average belief over networks using sequential observations
- Asynchronous Distributed Algorithms for Heading Consensus of Multi-Agent Systems with Communication Delay
- Quantized Consensus by Means of Gossip Algorithm
- Adaptive finite-time control for formation tracking of multiple nonholonomic unmanned aerial vehicles with quantized input signals
- Robust gossiping with an application to consensus
- Quantized average consensus via dynamic coding/decoding schemes
- Average consensus of continuous-time multi-agent systems with quantized communication
- Distributed average consensus via gossip algorithm with real-valued and quantized data for \(0<q<1\)
- Gossip algorithms
- Consensus of second-order and high-order discrete-time multi-agent systems with random networks
- Average consensus on networks with quantized communication
- Distributed computation of exact average degree and network size in finite time under quantized communication
- Continuous-time quantized consensus: convergence of Krasovskii solutions
- Distributed subgradient method for multi-agent optimization with quantized communication
- Distributed quantized consensus for agents on directed networks
- Modal consensus, synchronization and formation control with distributed endogenous internal models
- Discontinuities and hysteresis in quantized average consensus
- State estimation for linear discrete-time systems using quantized measurements
- Gossip algorithm for multi-agent systems via random walk
- Fast discrete consensus based on gossip for makespan minimization in networked systems
- Quantized consensus on first-order integrator networks
- On robust and optimal imperfect information state equipartitioning for network systems
- Almost-optimal gossip-based aggregate computation
- Analysis of accelerated gossip algorithms
- Consensus in time-delayed multi-agent systems with quantized dwell times
- Nonlinear gossip
- Average consensus on general strongly connected digraphs
- Reaching consensus in unbalanced networks with coarse information communication
- Performance analysis of averaging based distributed estimation algorithm with additive quantization model
- Quantized consensus
- Convergence of gossip algorithms for consensus in wireless sensor networks with intermittent links and mobile nodes
- Adaptive coordinated tracking of multi-agent systems with quantized information
- Consensus control for directed networks under quantized information exchange
- Model based peer-to-peer estimator over wireless sensor networks with lossy channels
- Quantized consensus over directed networks with switching topologies
- Request-based gossiping without deadlocks
- Distributed consensus over digital networks with limited bandwidth and time-varying topologies
- Symmetrizing quantum dynamics beyond gossip-type algorithms
- Convergence time analysis of quantized gossip consensus on digraphs
- Resilient self/event-triggered consensus based on ternary control
- Gossip based asynchronous and randomized distributed task assignment with guaranteed performance on heterogeneous networks
- Quantised consensus of multi-agent systems with nonlinear dynamics
- Non-oscillating quantized average consensus over dynamic directed topologies
- Title not available (Why is that?)
- Quantized consensus in Hamiltonian graphs
- Gossip algorithms in quantum networks
- Quantized consensus of multi-agent systems via broadcast gossip algorithms
- Distributed state and fault estimation over sensor networks with probabilistic quantizations: the dynamic event-triggered case
- Nonlinear gossip algorithms for wireless sensor networks
- Consensus for heterogeneous multi-agent systems under fixed and switching topologies
- Average consensus with weighting matrix design for quantized communication on directed switching graphs
- An asynchronous randomized gossip consensus algorithm with nonuniform-selected probability and optimization
- Distributed primal-dual stochastic subgradient algorithms for multi-agent optimization under inequality constraints
- Quantized tracking control for a multi-agent system with high-order leader dynamics
- Formation tracking for nonlinear multi-agent systems with input and output quantization via adaptive output feedback control
- A variation of the Newton-Pepys problem and its connections to size-estimation problems
- Extending robustness and randomization from consensus to symmetrization algorithms
- Distributed randomized algorithms for opinion formation, centrality computation and power systems estimation: a tutorial overview
- Mixed self/event-triggered ternary control for resilient consensus against mobile adversarial agents
- Quantized iterative learning control for nonlinear multi-agent systems with initial state error
- Phase transitions in distributed control systems with multiplicative noise
- Quantized iterative learning control for nonlinear multi-agent systems with limited information communication and input saturation
- An enhanced Gossip algorithm based on superposition coding
- Quantised consensus by using the PD-like protocols in directed networks
- Corrections to ``Quantized consensus by the ADMM: probabilistic versus deterministic quantizers
- Gossip algorithm with nonuniform clock distribution: optimization over classical and quantum networks
- Distributed approximation and tracking using selective gossip
- Optimal gossip algorithms for exact and approximate quantile computations
This page was built for publication: Gossip consensus algorithms via quantized communication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q985266)
