http://nova.newcastle.edu.au/vital/access/services/Feed ${session.getAttribute("locale")} 5 http://nova.newcastle.edu.au/vital/access/manager/Repository/uon:8699 Expander networks are highly connected sparse graphs, which play an important role in designing efficient communication networks. In this paper, we consider consensus control of discrete-time first-order agents with the communication graph being an expander network. Each agent has a real-valued state but can only exchange symbolic data with its neighbors. A distributed protocol is designed based on dynamic encoding and decoding with finite level uniform quantizers. The choice of the control parameters only depends on the number of agents, the maximum degree and the isoperimetric constant of the network. It is shown that under the protocol designed, average-consensus can be achieved with an exponential convergence rate based on a single-bit information exchange between each pair of adjacent nodes at each time step. A performance index is given to characterize the total communication energy cost to achieve average-consensus and it is shown that the minimization of the communication energy cost leads to a tradeoff between the convergence rate and the number of quantization levels. 2013-02-28T06:00:33.745Z ]]> http://nova.newcastle.edu.au/vital/access/manager/Repository/uon:8698 This paper is concerned with consensus control of undirected networks of discrete time first order agents under quantized communication. A distributed protocol is proposed based on dynamic encoding and decoding with finite level uniform quantizers. It is shown that under the protocol designed, for a connected network, average-consensus can be achieved with an exponential convergence rate based on a single-bit information exchange between each pair of adjacent nodes at each time step. As the number of agents increases, the explicit form of the asymptotic convergence rate is given in relation to the number of nodes, the number of the quantization levels and the ratio between the algebraic connectivity and the spectral radius of the Laplacian of the communication graph. 2013-02-28T05:40:12.026Z ]]>