Seminar Details
2011-04-05 (15.00) : Graph coverings and gossip coverage control
At Euler building
Organized by Mathematical Engineering
Speaker :
Frasca, Paolo
Abstract :
Problems of unsupervised deployment of robotic networks and optimal partitioning of large complex environments are important
in engineering applications and open up interesting theoretical challenges. Classical techniques, based on Voronoi partitions, rely on two
assumptions: the environment to apportion is convex, and communication is synchronous and reliable along the edges of the Delaunay graph
induced by the robots' positions. In this talk I will present a novel solution which allows the robots to optimally deploy in non-convex
environments by using unreliable gossip communication. Joint work with R. Carli (University of Padova), J. W. Durham and F. Bullo (UCSB)