首页 | 本学科首页   官方微博 | 高级检索  
     


Gossip consensus algorithms via quantized communication
Authors:Ruggero Carli [Author Vitae]  Sandro Zampieri [Author Vitae]
Affiliation:a Center for Control, Dynamical Systems and Computation, University of California, Santa Barbara, CA 93106, USA
b Dipartimento di Matematica, Politecnico di Torino, C.so Duca degli Abruzzi, 24, 10129 Torino, Italy
c D.E.I., Università di Padova, Via Gradenigo 6/a, 35131 Padova, Italy
d D.I.I.M.A., Università di Salerno, Italy
e Istituto per le Applicazioni del Calcolo, C.N.R., Roma, Italy
Abstract:This paper considers the average consensus problem on a network of digital links, and proposes a set of algorithms based on pairwise “gossip” communications and updates. We study the convergence properties of such algorithms with the goal of answering two design questions, arising from the literature: whether the agents should encode their communication by a deterministic or a randomized quantizer, and whether they should use, and how, exact information regarding their own states in the update.
Keywords:Average consensus  Quantization  Control under communication constraints  Markov chain
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号