2017
An Asymmetric Distributed Method for Sorting a Robot Swarm
RA-L 2017
We consider the problem of sorting a swarm of labeled robots in Euclidean space. Our goal is to organize the robots into a sorted and equally-spaced straight line between the robots with lowest and highest labels, while maintaining a connected communication network. We break the symmetry between the