UC San Diego
On synchronous robotic networks - Part II: Time complexity of rendezvous and deployment algorithms
- Author(s): Frazzoli, Emilio
- Bullo, Francesco
- Cortes, Jorge
- Martinez, Sonia
- et al.
This paper analyzes a number of basic coordination algorithms running on synchronous robotic networks. We provide upper and lower bounds on the time complexity of the move-toward-average and circumcenter laws, both achieving rendezvous, and of the centroid law, achieving deployment over a region of interest. The results are derived via novel analysis methods, including a set of results on the convergence rates of linear dynamical systems defined by tridiagonal Toeplitz and circulant matrices.
Many UC-authored scholarly publications are freely available on this site because of the UC Academic Senate's Open Access Policy. Let us know how this access is important for you.