On synchronous robotic networks Part II:
Time complexity of rendezvous and deployment algorithms

Sonia Martínez, Francesco Bullo, Jorge Cortés and Emilio Frazzoli
Proceedings of the 44th IEEE Int. Conf. Decision and Control, Seville, Spain, December 2005

Abstract:

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.

File: main.pdf

Bib-tex entry:

@InProceedings{SM-FB-JC-EF:05partII,
author = {S. Mart{\'\i}nez and F. Bullo and J. Cort\'es and E. Frazzoli},
booktitle = {44th IEEE International Conference on Decision and Control},
title = {On synchronous robotic networks Part II: Time complexity of rendezvous and deployment algorithms},
year = {2005},
address = {Seville, Spain}
}