Affordable Access

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

Authors
Publication Date
Source
eScholarship - University of California
Keywords
  • Circumcenter And Centroid Laws
  • Coordination Algorithms
  • Deployment
  • Rendezvous
  • Robotic Networks
  • Time Complexity
External links

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.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments