Automatica (Journal of IFAC)
Communication constraints in the average consensus problem
Automatica (Journal of IFAC)
Quantized Coordination Algorithms for Rendezvous and Deployment
SIAM Journal on Control and Optimization
Gossip consensus algorithms via quantized communication
Automatica (Journal of IFAC)
Distributed consensus algorithms in sensor networks: quantized data and random link failures
IEEE Transactions on Signal Processing
Stochastic consensus over noisy networks with Markovian and arbitrary switches
Automatica (Journal of IFAC)
Distributed Average Consensus With Dithered Quantization
IEEE Transactions on Signal Processing - Part I
Distributed consensus over digital networks with limited bandwidth and time-varying topologies
Automatica (Journal of IFAC)
Distributed Consensus for Multiagent Systems with Communication Delays and Limited Data Rate
SIAM Journal on Control and Optimization
Hi-index | 22.14 |
Existing works that deal with the problem of distributed average consensus with quantized information communication assume that the update matrices are doubly stochastic, which amounts to agents evolving on balanced directed networks with digital channels. This paper is concerned with the problem of seeking consensus via quantized information communication over a general unbalanced directed digital network. It is established that, by designing a protocol with a finite-level uniform quantization scheme, merely one bit quantized information transmitted along each connected digital channel suffices for achieving weighted average consensus with an exponential convergence rate, as long as the directed unbalanced network is strongly connected. An explicit characterization of the convergence rate of consensus is also given. By avoiding the double stochasticity assumption on the update matrix, the proposed quantized protocol is particularly suitable for the scenarios where no bidirectional and/or balanced information communication among agents is available.