Accelerated Patch Sorting by a Robotic Swarm
Andrew Vardy · 2012
We introduce a new method for distributed object sorting by a swarm of robots. The patch sorting task involves pushing randomly distributed objects into homogeneous clusters. Most existing methods do not make use of vision and are therefore restricted to sensing the objects that lie immediately in front of the robot. We utilize vision both to sense the presence of a cluster and judge its homogeneity, and to seek out distant clusters or isolated objects to pick up. The objects to be sorted are coloured pucks. We present results using a realistic simulation which shows that a simple guidance strategy based on the size of distant clusters can dramatically accelerate the sorting process.