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},
  • Y. Zhou, R. Goldman, J. McLurkin
  • Published 2017
  • Mathematics, Computer Science
  • 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… CONTINUE READING


    Publications referenced by this paper.
    A parallel distributed strategy for arraying a scattered robot swarm
    • 5
    • Open Access
    A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots
    • 20
    Optimal strategies for maintaining a chain of relays between an explorer and a base camp
    • 37
    • Open Access
    Analysis and implementation of distributed algorithms for multi-robot systems
    • 60
    • Open Access
    Fall in! Sorting a Group of Robots with a Continuous Controller
    • 5
    • Open Access
    On the shape of a set of points in the plane
    • 1,241
    • Open Access
    Physical bubblesort
    • 2014