Abstract
In the average consensus problem the states of a set of agents, linked according to a directed graph, have to be driven to their average. When the communication between neighbors is uniformly quantized, such a problem can not be exactly solved by a linear time-invariant algorithm. In this work, we propose a probabilistic estimate of the error from the agreement, in terms of the eigenvalues of the evolution matrix describing the algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have