Classical distributed algorithms for asymptotic average consensus typically assume timely
and reliable exchange of information between neighboring components of a given multi …

Most algorithms for distributed averaging only guarantee asymptotic convergence. This
paper introduces a distributed protocol that allows nodes to find the exact average of the …

We consider a multi-component system in which each component (node) can send/receive
information to/from sets of neighboring nodes via communication links (edges) that form a …

In this paper, we propose a novel continuous-time protocol that solves the consensus
problem on the median value, ie, it provides distributed agreement in networked multi-agent …

We have recently proposed a “surplus-based” algorithm which solves the multi-agent
average consensus problem on general strongly connected and static digraphs. The …

Rapid developments in digital system and networking technologies have led to the
emergence of complex systems that are de facto managed and controlled over cyber …

We address the average consensus problem for a distributed system whose components
(nodes) can exchange information via interconnections (links) that form an arbitrary, strongly …

We propose a class of distributed iterative algorithms that enable the asymptotic scaling of a
primitive column stochastic matrix, with a given sparsity structure, to a doubly stochastic …

Output formation-containment control problems for general linear time-invariant multi-agent
systems with directed topologies are dealt with. Output formation-containment means that …

Distributed estimation of the average value over a Wireless Sensor Network has recently
received a lot of attention. Most papers consider single variable sensors and …