|
||||||||
| Web Mail Mailing Lists Computing Resources Site Map |
Distributed Coordination and Consensus algorithms with boundary: from flocking and synchronization to geographic routing in adhoc networks Dr. Ali Jadbabaie, University of Pennsylvania Wednesday, May 24, 20062:00 PM to 3:00 PM 070 Moore In this talk we provide a unified view of several distributed coordination and consensus algorithms which have appeared in various disciplines such as distributed systems, statistical physics, biology, computer graphics, robotics, and control theory over the past 2 decades. These algorithms have been proposed as a mechanism for demonstrating emergence of a global collective behavior (such as social aggregation in animals, schooling, flocking and synchronization) using purely local interactions. Utilizing tools from spectral graph theory and control and dynamical systems theory, we provide an analysis of these algorithms. Furthermore, we show that by imposing fixed boundary conditions (e.g., designating a leader in a swarm) , one can obtain algorithms for a wide range of applications, from leader-follower swarms to synchronization in oscillator networks, and from shortest path routing to geographic routing without location information. Finally, we describe a one-parameter family of distributed consensus algorithms with boundary conditions, which at one extreme, recovers the well-known Bellman-Ford Algorithm for shortest-path routing, and at the other, results in a routing scheme based on diffusion, and mean-first passage times. Connections between these algorithms and harmonic functions, electric networks, and discrete Dirichlet problems are also discussed. |
|||||||
|