An Asymmetric Distributed Method for Sorting a Robot Swarm

  title={An Asymmetric Distributed Method for Sorting a Robot Swarm},
  author={Yu Xiang Zhou and Ron Goldman and James 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… 
Collision avoiding decentralized sorting of robotic swarm
Together both the algorithms allow robot swarm to sort themselves in a straight line while avoiding collision simultaneously.
Optimal Physical Sorting of Mobile Agents
The goal is to design a centralized algorithm that controls the agents so as to sort them in the least number of time steps, and derives an exact lower bound on the amount of time any algorithm requires to sort a given initial configuration of agents.
Shape Self-Assembly for a Swarm of Agents
A distributed algorithm to demonstrate the self-assembly of an agent swarm to form a square shape is proposed and experiments with different scales of swarm by simulation validate the feasibility and performance of the proposed algorithm.
"What to Do With Two Lanes?": Optimal Physical Sorting of Mobile Vehicles
The sorting algorithm found is instance optimal, attaining the best possible sorting time for any initial configuration, and derived an exact lower bound for the amount of time it takes to sort the vehicles given any staring configuration.
Dynamic Peloton Formation Configuration Algorithm of Swarm Robots for Aerodynamic Effects Optimization
It was shown that the adaptation of peloton behavior in artificial agents brought efficient formation and foraging trajectories and behaviors.
Design of a Robot Controller for Peloton Formation Using Fuzzy Logic
The controller developed is a fuzzy-logic controller for each of the robotic agent in order for them to perform a peloton formation which results to a more efficient and robust swarm system.
Building Fractals with a Robot Swarm
This work develops a set of methods to generate fractals with a swarm of robots by using robots as vertices, and line segments between selected robots as edges, and generalizes the algorithms so that new fractals can be built with only a few parameters.


A parallel distributed strategy for arraying a scattered robot swarm
A distributed method to accomplish sorting and navigation of a scattered group of n robots in two-dimensional space, without using central control, while also keeping time, travel distance and communication cost at a minimum.
A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots
This paper begins the study of continuous local strategies: the robots may perpetually observe the relative positions of their neighbors, and may perpetually adjust their speed and direction in response to these observations.
Local Strategies for Connecting Stations by Small Robotic Networks
Two strategies for dimensionless, identical, oblivious and disoriented relays with limited viewing radius for constructing a communication network between stations consisting of as few relays as possible are presented.
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
This paper describes the first robotic system that solves a combinatorial computational problem by means of its own continuous dynamics, and can withstand perturbations introduced into the ideal dynamics by the physical limitations of real robots.
K-Redundant Trees for Safe and Efficient Multi-robot Recovery in Complex Environments
This paper presents a self-stabilizing distributed algorithm to recover a large number of robots safely and efficiently in a goal location that provides k-connectivity in the network, meaning that each robot is connected to the goal location through k trees.
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
The robot speed ratio is introduced, a dimensionless measure of robot speed relative to message speed in networks that rely on multi-hop communication and navigation, and captures key relationships between communications bandwidth, mobility, and algorithm accuracy.
Local strategies for maintaining a chain of relay stations between an explorer and a base station
A new strategy, the Chase-Explorer strategy, is introduced, which needs more advanced robots than Go-To-The-Middle, but achieves near-optimal performance and is extended to exploring terrains with obstacles.
On the shape of a set of points in the plane
A generalization of the convex hull of a finite set of points in the plane leads to a family of straight-line graphs, "alpha -shapes," which seem to capture the intuitive notions of "fine shape" and "crude shape" of point sets.
Physical bubblesort
  • 2014, presented at International Symposium on Distributed Autonomous Robotic Systems (DARS), November 2–5, Daejeon Convention Center, Daejeon, Korea.
  • 2014