This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
—In many application scenarios sensors need to calculate the average of some local values, e.g. of local measurements. A possible solution is to rely on consensus algorithms. In ...
Konstantin Avrachenkov, Mahmoud El Chamie, Giovann...
Abstract-- This paper presents greedy gossip with eavesdropping (GGE), a new average consensus algorithm for wireless sensor network applications. Consensus algorithms have recentl...
This paper analyzes two classes of consensus algorithms in presence of bounded measurement errors. The considered protocols adopt an updating rule based either on constant or vani...
We consider a consensus algorithm in which every node in a time-varying undirected connected graph assigns equal weight to each of its neighbors. Under the assumption that the deg...
Convergence analysis of consensus algorithms is revisited in the light of the Hilbert distance. The Lyapunov function used in the early analysis by Tsitsiklis is shown to be the Hi...
Rodolphe Sepulchre, Alain Sarlette, Pierre Rouchon
Robotic swarms, like all spatial computers, are a challenging environment for the execution of distributed consensus algorithms due to their scale, diameter, and frequent failures...
Abstract-- This paper studies distributed coordination algorithms for multiple fractional-order systems over a directed communication graph. A general fractional-order consensus mo...
We consider the effect of network throughput on the convergence of a specific class of distributed averaging algorithms, called consensus algorithms. These algorithms rely on itera...
Abstract— The present paper considers distributed consensus algorithms for agents evolving on a connected compact homogeneous (CCH) manifold. The agents track no external referen...