Efficient quantization for average consensus
classification
🧮 math.OC
cs.SY
keywords
algorithmaverageconsensusefficientquantizationconnecteddigitalexponentially
read the original abstract
This paper presents an algorithm which solves exponentially fast the average consensus problem on strongly connected network of digital links. The algorithm is based on an efficient zooming-in/zooming-out quantization scheme.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.