Results 1  10
of
11
Gossip consensus algorithms via quantized communication
, 2009
"... 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 literatur ..."
Abstract

Cited by 34 (5 self)
 Add to MetaCart
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.
Quantized consensus in Hamiltonian graphs
 Automatica
, 2011
"... 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 certai ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
(Show Context)
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 by their sizes is the same for all the agents. The algorithm is proved to converge almost surely to a finite set containing the optimal solution. A worst case study of the expected convergence time is carried out, thus proving the efficiency of the algorithm with respect to other solutions recently presented in the literature. Moreover, the algorithm has a decentralized stop criterion once the convergence set is reached.
Consensus Algorithms for Estimation and Discrete Averaging in Networked Control Systems.
, 2010
"... Dedicated to my parents In this thesis several topics on consensus and gossip algorithms for multiagent systems are addressed. An agent is a dynamical system and a multiagent system is a network of agents whose pattern of interactions or couplings is described by a graph. Consensus problems in mu ..."
Abstract
 Add to MetaCart
Dedicated to my parents In this thesis several topics on consensus and gossip algorithms for multiagent systems are addressed. An agent is a dynamical system and a multiagent system is a network of agents whose pattern of interactions or couplings is described by a graph. Consensus problems in multiagent systems consist in the study of local interaction rules between the agents such that as global emergent behavior the network converges to the so called "consensus " or "agreement " state where the value of each agent’s state is the same and it is possibly a function of the initial network state, for instance the average. A consensus algorithm is thus a set of local interaction rules that solve the consensus problem under some assumptions on the network topology. A gossip algorithm is a set of local state update rules between the agents that, disregarding their objective, are supposed to be implemented in
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 literatu ..."
Abstract
 Add to MetaCart
(Show Context)
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.
unknown title
"... Driven by fundamental technological achievements like the digital revolution in communication and computing and the miniaturization of electronic components, a growing interest in the field of networked systems has appeared, in recent years, in different scientific areas like physics, communicati ..."
Abstract
 Add to MetaCart
(Show Context)
Driven by fundamental technological achievements like the digital revolution in communication and computing and the miniaturization of electronic components, a growing interest in the field of networked systems has appeared, in recent years, in different scientific areas like physics, communication and control engineering, economy, and lately, mathematics. Besides differences among the various approaches, the basic model consists of a certain number of agents, namely, systems living in a common environment and which communicate among each other according to some prespecified communication pattern. Such a pattern may be fixed or varying according to their physical position, to their internal state and can possibly be affected by noises. The evolution law of each system typically depends on the information obtained through its communication links and is, in general, modeled by a difference or differential equation. For this type of models, the interest is, in general, in studying time evolution, asymptotic behaviors, and in for
On the Convergence Time of Asynchronous Distributed Quantized Averaging Algorithms
"... [6] J. P. Hespanha, “Uniform stability of switched linear systems: Exten ..."
Abstract
 Add to MetaCart
(Show Context)
[6] J. P. Hespanha, “Uniform stability of switched linear systems: Exten
DRAFT
"... In this paper we study the problem of fault diagnosis for sensor networks. We examine faults that involve an anomalous behavior of the sensor and investigate their diagnosis only through the local interaction between faulty nodes and healthy ones. We provide heuristics to actively diagnose faults an ..."
Abstract
 Add to MetaCart
In this paper we study the problem of fault diagnosis for sensor networks. We examine faults that involve an anomalous behavior of the sensor and investigate their diagnosis only through the local interaction between faulty nodes and healthy ones. We provide heuristics to actively diagnose faults and recover the nominal behavior. Published as:
Gossip consensus algorithmsvia 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 literatu ..."
Abstract
 Add to MetaCart
(Show Context)
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.
1Convergence Time Analysis of Quantized Gossip Consensus on Digraphs
"... We have recently proposed quantized gossip algorithms which solve the consensus and averaging problems on directed graphs with the least restrictive connectivity requirements. In this paper we study the convergence time of these algorithms. To this end, we investigate the shrinking time of the small ..."
Abstract
 Add to MetaCart
We have recently proposed quantized gossip algorithms which solve the consensus and averaging problems on directed graphs with the least restrictive connectivity requirements. In this paper we study the convergence time of these algorithms. To this end, we investigate the shrinking time of the smallest interval that contains all states for the consensus algorithm, and the decay time of a suitable Lyapunov function for the averaging algorithm. The investigation leads us to characterizing the convergence time by the hitting time in certain special Markov chains. We simplify the structures of state transition by considering the special case of complete graphs, where every edge can be activated with an equal probability, and derive polynomial upper bounds on convergence time. I.