Results 1  10
of
393,307
Efficient quantization for average consensus
, 2009
"... 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 zoomingin/zoomingout quantization scheme. 1 ..."
Abstract
 Add to MetaCart
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 zoomingin/zoomingout quantization scheme. 1
Topology for global average consensus
 in 40th Asilomar Conference on Signals, Systems, and Computers
, 2006
"... We consider the problem of global averageconsensus in a network of sensors. The communication among sensors is restricted by the underlying network, where each sensor can exchange information only with its neighbors. We analyze the influence of the network topology on the convergence speed of the i ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
We consider the problem of global averageconsensus in a network of sensors. The communication among sensors is restricted by the underlying network, where each sensor can exchange information only with its neighbors. We analyze the influence of the network topology on the convergence speed
Distributed average consensus with leastmeansquare deviation
 Journal of Parallel and Distributed Computing
, 2005
"... We consider a stochastic model for distributed average consensus, which arises in applications such as load balancing for parallel processors, distributed coordination of mobile autonomous agents, and network synchronization. In this model, each node updates its local variable with a weighted averag ..."
Abstract

Cited by 201 (5 self)
 Add to MetaCart
We consider a stochastic model for distributed average consensus, which arises in applications such as load balancing for parallel processors, distributed coordination of mobile autonomous agents, and network synchronization. In this model, each node updates its local variable with a weighted
AVERAGE CONSENSUS WITH PACKET DROP COMMUNICATION
, 2009
"... Average consensus consists in the problem of determining the average of some quantities by means of a distributed algorithm. It is a simple instance of problems arising when designing estimation algorithms operating on data produced by sensor networks. Simple solutions based on linear estimation a ..."
Abstract

Cited by 55 (8 self)
 Add to MetaCart
Average consensus consists in the problem of determining the average of some quantities by means of a distributed algorithm. It is a simple instance of problems arising when designing estimation algorithms operating on data produced by sensor networks. Simple solutions based on linear estimation
Discretetime dynamic average consensus
, 2009
"... We propose a class of discretetime dynamic average consensus algorithms that allow a group of agents to track the average of their reference inputs. The convergence results rely on the inputtooutput stability properties of static average consensus algorithms and require that the union of communic ..."
Abstract

Cited by 23 (9 self)
 Add to MetaCart
We propose a class of discretetime dynamic average consensus algorithms that allow a group of agents to track the average of their reference inputs. The convergence results rely on the inputtooutput stability properties of static average consensus algorithms and require that the union
A scheme for robust distributed sensor fusion based on average consensus
 PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON INFORMATION PROCESSING IN SENSOR NETWORKS (IPSN
, 2005
"... We consider a network of distributed sensors, where each sensor takes a linear measurement of some unknown parameters, corrupted by independent Gaussian noises. We propose a simple distributed iterative scheme, based on distributed average consensus in the network, to compute the maximumlikelihoo ..."
Abstract

Cited by 250 (3 self)
 Add to MetaCart
We consider a network of distributed sensors, where each sensor takes a linear measurement of some unknown parameters, corrupted by independent Gaussian noises. We propose a simple distributed iterative scheme, based on distributed average consensus in the network, to compute the maximum
Communication Constraints in the Average Consensus Problem
, 2007
"... The interrelationship between control and communication theory is becoming of fundamental importance in many distributed control systems, such as the coordination of a team of autonomous agents. In such a problem, communication constraints impose limits on the achievable control performance. We cons ..."
Abstract

Cited by 82 (20 self)
 Add to MetaCart
consider as instance of coordination the consensus problem. The aim of the paper is to characterize the relationship between the amount of information exchanged by the agents and the rate of convergence to the consensus. We show that timeinvariant communication networks with circulant symmetries yield
Optimal strategies in the average consensus problem
 in Proceedings of the IEEE Conference on Decision and Control
, 2007
"... Abstract — We prove that for a set of communicating agents to compute the average of their initial positions (average consensus problem), the optimal topology of communication is given by a de Bruijn’s graph. Consensus is then reached in a finitely many steps. A more general family of strategies, co ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
Abstract — We prove that for a set of communicating agents to compute the average of their initial positions (average consensus problem), the optimal topology of communication is given by a de Bruijn’s graph. Consensus is then reached in a finitely many steps. A more general family of strategies
ON SPATIAL GOSSIP ALGORITHMS FOR AVERAGE CONSENSUS
"... This paper investigates the use of spatial gossip to compute the average consensus in networks such as grids or random geometric graphs, where connectivity is a function of proximity. Randomized gossip is a framework for distributed computation where, at each iteration, a random pair of nodes exchan ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
This paper investigates the use of spatial gossip to compute the average consensus in networks such as grids or random geometric graphs, where connectivity is a function of proximity. Randomized gossip is a framework for distributed computation where, at each iteration, a random pair of nodes
Average consensus on digital noisy networks
 In Proc. of 1st IFAC Workshop on Estimation and Control of Networked Systems (NecSys’09
, 2009
"... Abstract: We propose a class of distributed algorithms for computing arithmetic averages (average consensus) over networks of agents connected through digital noisy broadcast channels. Our algorithms do not require the agents to have knowledge of the network structure, nor do they assume any noisele ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract: We propose a class of distributed algorithms for computing arithmetic averages (average consensus) over networks of agents connected through digital noisy broadcast channels. Our algorithms do not require the agents to have knowledge of the network structure, nor do they assume any
Results 1  10
of
393,307