We study the average consensus problem of multi-agent systems for general network
topologies with unidirectional information flow. We propose two linear distributed algorithms …

Distributed averaging deals with a network of n> 1 agents and the constraint that each agent
is able to communicate only with its neighbors. The purpose of the distributed averaging …

With the continuous development of the global economic level, global energy consumption
is also on the rise, and the global power industry is faced with a number of formidable …

This note studies the problem of distributed estimation for jump Markov nonlinear systems
(JMNLSs) in a not fully connected sensor network. Based on the consensus theory, a …

The alternating direction multipliers method (ADMM) has been recently proposed as a
practical and efficient algorithm for distributed computing. We discuss its applicability to the …

We describe a protocol for the average consensus problem on any fixed undirected graph
whose convergence time scales linearly in the total number nodes n. The protocol relies …

Distributed averaging describes a class of network algorithms for the decentralized
computation of aggregate statistics. Initially, each node has a scalar data value, and the goal …

We describe a protocol for the average consensus problem on any fixed undirected graph
whose convergence time scales linearly in the total number nodes $ n $. The protocol is …

This paper studies the problem of distributed estimation for a class of discrete-time nonlinear
non-Gaussian systems in a not fully connected sensor network environment. The non …

Gossiping is a distributed process whose purpose is to enable the members of a group of n>
1 autonomous agents to asymptotically determine in a decentralized manner, the average of …