An Asymmetric Distributed Method for Sorting a Robot Swarm

  title={An Asymmetric Distributed Method for Sorting a Robot Swarm},
  author={Y. Zhou and R. Goldman and J. McLurkin},
  journal={IEEE Robotics and Automation Letters},
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 minimum and maximum, in order to keep time, travel distance, and communication costs low, without using central control. We run in parallel a set of functions, including leader election, tree… Expand
Collision avoiding decentralized sorting of robotic swarm
Shape Self-Assembly for a Swarm of Agents
Dynamic Peloton Formation Configuration Algorithm of Swarm Robots for Aerodynamic Effects Optimization
Design of a Robot Controller for Peloton Formation Using Fuzzy Logic
Building Fractals with a Robot Swarm


A parallel distributed strategy for arraying a scattered robot swarm
A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots
Fall in! Sorting a Group of Robots with a Continuous Controller
  • Y. Litus, R. Vaughan
  • Computer Science
  • 2010 Canadian Conference on Computer and Robot Vision
  • 2010
Optimal strategies for maintaining a chain of relays between an explorer and a base camp
Analysis and implementation of distributed algorithms for multi-robot systems
On the shape of a set of points in the plane
Physical bubblesort
  • 2014, presented at International Symposium on Distributed Autonomous Robotic Systems (DARS), November 2–5, Daejeon Convention Center, Daejeon, Korea.
  • 2014