Quantized Coordination Algorithms for Rendezvous and Deployment

Authors:
Publisher website
Google Scholar
Abstract
In this paper we study motion coordination problems for groups of robots that exchange information through a rate-constrained communication network. For one-dimensional rendezvous and deployment problems with communication path graphs, we propose an integrated control and communication scheme combining a logarithmic coder/decoder with linear coordination algorithms. We show that the closed-loop performance is comparable to that achievable in the quantization-free model: the time complexity is, asymptotically on the size of the network, unchanged, and the exponential convergence factor degrades smoothly as the quantization accuracy becomes coarser.

This publication has 21 references indexed in Scilit: