Francesco Bullo
University of California, Santa Barbara
520 Papers
6K Citations
Francesco Bullo is an academic researcher from University of California, Santa Barbara. The author has contributed to research in topics: Computer science & Distributed algorithm. The author has an hindex of 81, co-authored 484 publications. Previous affiliations of Francesco Bullo include California Institute of Technology & University of California.
Chat about Author
Papers
•Posted Content
Synchronization of Kuramoto Oscillators via Cutset Projections
Saber Jafarpour,Francesco Bullo +1 more
TL;DR: In this paper, the authors propose a family of sufficient synchronization conditions for Kuramoto oscillators, which rigorously identify the correct functional form of the trade-off between coupling strength and oscillator heterogeneity.
20
Robotic surveillance and Markov chains with minimal first passage time
Pushkarini Agharkar,Rushabh Patel,Francesco Bullo +2 more
- 01 Dec 2014
TL;DR: It is shown that both the Kemeny constant and its heterogeneous counterpart can be formulated as convex optimization problems and, moreover, can be expressed as semidefinite programs (SDPs) for reversible Markov chains.
20
Adaptive and Distributed Coordination Algorithms for Mobile Sensing Networks
Francesco Bullo,Jorge E. Cortes +1 more
- 01 Jan 2005
TL;DR: This paper addresses the questions surrounding interaction laws of strikingly simple dynamical systems whose behavior remains largely unknown and is of any engineering use in robotic coordination problems and the design of mobile sensor networks.
20
Competitive Propagation: Models, Asymptotic Behavior and Quality-Seeding Games
Wenjun Mei,Francesco Bullo +1 more
TL;DR: A class of propagation models for multiple competing products over a social network, corresponding to the chronological order of social and self conversions, is proposed and, based on the independence approximation, two Markov-chain models are developed, approximate them with two corresponding difference equations systems.
20
Multiagent coverage algorithms with gossip communication: Control systems on the space of partitions
Paolo Frasca,Ruggero Carli,Francesco Bullo +2 more
- 10 Jun 2009
TL;DR: This work proposes novel deployment and partitioning algorithms that require only asynchronous pairwise (so-called gossip) communication, and describes the coverage control problem as a control system on the space of partitions, rather than the evolution of the agents' positions.