This is an introduction to multicast routing, which is the study of methods for routing from one
source to many destinations, or from many sources to many destinations. Multicast is …

In this paper we analyze the use of Chebyshev polynomials in distributed consensus
applications. It is well known that the use of polynomials speeds up the convergence to the …

Distributed algorithms based on pulse-coupled oscillators have been recently proposed in
[4],[14] for achieving desynchronization of a system of identical nodes. Though these …

We propose a novel distributed algorithm for one of the most fundamental problems in
networks: the average consensus. We view the average consensus as an optimization …

This paper considers the average-consensus problem in a network with arbitrary (but finite)
communication delays. A novel Distributed-Averaging (DA) algorithm is presented and …

Gossiping is a well-known approach to the distributed averaging problem whose purpose is
to enable the members of a group of autonomous agents to iteratively determine the …

The idea of a team of robots executing cooperative tasks in an autonomous manner is
everyday closer to become a reality. Multi-robot systems can perform complex tasks with …

In the past few years, the impressive growth of applications performing tasks in a distributed
fashion has been enabled by the availability of tiny, inexpensive devices which, in turn, has …

La idea de equipos de robots actuando con autonomía y de manera cooperativa está cada
día más cerca de convertirse en realidad. Los sistemas multi robot pueden ejecutar tareas …