Automatica (Journal of IFAC)
Communication constraints in the average consensus problem
Automatica (Journal of IFAC)
Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
SIAM Journal on Control and Optimization
SIAM Journal on Control and Optimization
Average consensus problems in networks of agents with delayed communications
Automatica (Journal of IFAC)
Brief paper: Consensus protocols for discrete-time multi-agent systems with time-varying delays
Automatica (Journal of IFAC)
IEEE Transactions on Signal Processing
SIAM Journal on Control and Optimization
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 in Multi-vehicle Cooperative Control: Theory and Applications
Distributed Consensus in Multi-vehicle Cooperative Control: Theory and Applications
Distributed consensus for multi-agent systems with delays and noises in transmission channels
Automatica (Journal of IFAC)
Coding With Side Information for Rate-Constrained Consensus
IEEE Transactions on Signal Processing - Part I
Consensus seeking over directed networks with limited information communication
Automatica (Journal of IFAC)
Continuous-time and sampled-data-based average consensus with logarithmic quantizers
Automatica (Journal of IFAC)
Hi-index | 0.01 |
This paper considers the average consensus problem for multiagent networks with communication delays and limited data rate. On one hand, communication delays often exist in information acquisition and transmission; on the other hand, only limited state information of agents can be transmitted to their neighbors at each time step due to bandwidth constraints. The average consensus problem becomes much more complicated when both delays and data-rate constraints are to be considered. In this paper, a distributed consensus protocol is proposed based on dynamic encoding and decoding. It is shown that for a connected network, as long as the time delays are bounded, the average consensus can be achieved with a finite communication data rate. In particular, it is shown that merely a one-bit information exchange between each pair of adjacent agents at each time step suffices to guarantee the average consensus.