Network-Based Consensus Averaging With General Noisy Channels
From MaRDI portal
Abstract: This paper focuses on the consensus averaging problem on graphs under general noisy channels. We study a particular class of distributed consensus algorithms based on damped updates, and using the ordinary differential equation method, we prove that the updates converge almost surely to exact consensus for finite variance noise. Our analysis applies to various types of stochastic disturbances, including errors in parameters, transmission noise, and quantization noise. Under a suitable stability condition, we prove that the error is asymptotically Gaussian, and we show how the asymptotic covariance is specified by the graph Laplacian. For additive parameter noise, we show how the scaling of the asymptotic MSE is controlled by the spectral gap of the Laplacian.
Cited in
(12)- Average consensus problems in networks of agents with fixed and switching topology and unknown control direction
- Nonlinear robustified stochastic consensus seeking
- Consensus tracking for nonlinear multi-agent systems with unknown disturbance by using model free adaptive iterative learning control
- Robust consensus for multi-agent systems over unbalanced directed networks
- Approximate consensus in the dynamic stochastic network with incomplete information and measurement delays
- Stochastic approximation based consensus dynamics over Markovian networks
- Distributed Averaging With Random Network Graphs and Noises
- On privacy vs. cooperation in multi-agent systems
- Finite-time median-related group consensus over directed networks
- Leader-follower coherence of the weighted recursive tree networks
- Distributed averaging on digital erasure networks
- Distributed non-linear robust consensus-based sensor calibration for networked control systems
This page was built for publication: Network-Based Consensus Averaging With General Noisy Channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4572768)
