منابع مشابه
Quantized consensus in Hamiltonian graphs
The main contribution of this paper is an algorithm to solve an extended version of the quantized consensus problem over networks represented by Hamiltonian graphs, i.e., graphs containing a Hamiltonian cycle, which we assume to be known in advance. Given a network of agents, we assume that a certain number of tokens should be assigned to the agents, so that the total number of tokens weighted ...
متن کاملDiscontinuities and hysteresis in quantized average consensus
We consider continuous-time average consensus dynamics in which the agents’ states are communicated through uniform quantizers. Solutions to the resulting system are defined in the Krasowskii sense and are proven to converge to conditions of “practical consensus”. To cope with undesired chattering phenomena we introduce a hysteretic quantizer, and we study the convergence properties of the resu...
متن کاملAverage consensus on networks with quantized communication
This work presents a contribution to the solution of the average agreement problem on a network with quantized links. Starting from the well-known linear diffusion algorithm, we propose a simple and effective adaptation which is able to preserve the average of states and to drive the system near to the consensus value, when a uniform quantization is applied to communication between agents. The ...
متن کاملConsensus with quantized relative state measurements
In this paper, cooperative control of multi-agent systems under limited communication between neighboring agents is investigated. In particular, quantized values of the relative states are used as the control parameters. By taking advantage of tools from nonsmooth analysis, explicit convergence results are derived for both uniform and logarithmic quantizers under static and time-varying communi...
متن کاملGossip consensus algorithms via quantized communication
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 quanti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2018
ISSN: 0018-9286,1558-2523,2334-3303
DOI: 10.1109/tac.2017.2771363