From distributed coordination in multiagent systems to coverage in sensor networks
speaker: Ali Jadbabaie (University of Pennsylvania)abstract: In this talk we provide a unified view of several distributed coordination and consensus algorithms which have appeared in various disciplines such as 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, schooling, flocking and synchronization) using purely local interactions. Utilizing tools from spectral graph theory and control and dynamical systems theory, we provide a rigorous analysis of these algorithms.
In the second part of the talk we study the problem of coverage verification in mobile sensor networks. Using a set of recently developed tools from algebraic topology, we present a distributed algorithm for coverage verification in a mobile sensing network. The algorithm is based on extending the results of the first part of the talk on consensus algorithms using graph Laplacians to higher order Laplacian operators defined over certain topological spaces known as simplicial complexes. Finally we develop and explore interesting connections between graph theory, control and dynamical systems, algebraic topology and distributed systems.
timetable:
Fri 6 Apr, 12:00 - 12:30, Aula Dini
<< Go back