Abstract. We examine the scalability of multi-robot algorithms. In particular, we attempt to capture the idea that the less coordination a multi-robot system requires, the better it should scale to large numbers of robots. To that end, we introduce a notion of communication complexity of multi-robot (or more generally, distributed control) systems as a surrogate for coordination. We describe a formalism, called CCL, for specifying multi-robot systems and algorithms for which the definition of communication complexity arises naturally. We then analyze the communication complexity of several, in some cases novel, multi-robot communication schemes each representative of one of several natural complexity classes.
REF showed how to apply the theory of communication complexity to the study of multi-robot coordination algorithms.
Communication Complexity of Multi-Robot Systems
Algorithmic Foundations of Robotics V, volume 7 of Springer Tracts in Advanced Robotics
Computer Science