Fall in! Sorting a Group of Robots with a Continuous Controller

  title={Fall in! Sorting a Group of Robots with a Continuous Controller},
  author={Yaroslav Litus and Richard T. Vaughan},
  journal={2010 Canadian Conference on Computer and Robot Vision},
  • Y. Litus, R. Vaughan
  • Published 31 May 2010
  • Computer Science
  • 2010 Canadian Conference on Computer and Robot Vision
This paper describes the first robotic system that solves a combinatorial computational problem by means of its own continuous dynamics. The goal of the system is to rearrange a set of robots on a line in a certain predefined order, thereby sorting them. Conventional pairwise between-robot rank comparisons suggested by traditional discrete state sorting algorithms are avoided by coupling robots in a Brockett double bracket flow system. A conventional multi-robot simulation with non-holonomic… 

Figures and Tables from this paper

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.
Using spatial embeddedness and physical embodiment for computation in multi-robot systems
This thesis shows that a multi-robot system can use physical embodiment and spatial embeddedness as computational resources for two types of problems: a continuous optimization problem of achieving optimal joint robot team configuration, and a combinatorial problem of sorting robots.
An Asymmetric Distributed Method for Sorting a Robot Swarm
This work considers the problem of sorting a swarm of labeled robots in Euclidean space, and breaks the symmetry between the minimum and maximum, in order to keep time, travel distance, and communication costs low, without using central control.
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.
"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.
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.
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 review: Pattern formation and adaptation in multirobot systems
This report has investigated how learning (life-long adaptation) is used to make multi-robot systems respond to changes in the environment as well in the capabilities of individual robots, and how evolution isused to generate group behaviors.
Pheromone Robotics
This work exploits the biologically inspired notion of a “virtual pheromone,” implemented using simple transceivers mounted atop each robot, that enables the robot collective to become a distributed computing mesh embedded within the environment, while simultaneously acting as a physical embodiment of the user interface.
Reducing spatial interference in robot teams by local-investment aggression
  • M. Zuluaga, R. Vaughan
  • Computer Science
    2005 IEEE/RSJ International Conference on Intelligent Robots and Systems
  • 2005
A new technique, local investment, for computing an aggression level that performs better than any previous method and relies only on local sensor data and is effective in a real-world robot implementation.
Distributed Gradient Optimization with Embodied Approximation
It is suggested that embodied approximations can be used by living distributed systems to find affordable solutions to the optimization tasks they face and are illustrated by giving solutions to two non-trivial realistic optimization tasks from the robotics domain.
Massively multi-robot simulation in stage
Stage’s scalability is examined to suggest that it may be useful for swarm robotics researchers who would otherwise use custom simulators, with their attendant disadvantages in terms of code reuse and transparency.
Dynamic Assignment in Distributed Motion Planning With Local Coordination
This paper addresses the challenge of motion planning algorithms that dynamically assign targets or destinations to multiple homogeneous agents, not relying on any a priori assignment of agents to destinations using two novel ideas: distributed multidestination potential fields and nearest neighbor coordination protocols.
Dynamical systems that sort lists, diagonalize matrices and solve linear programming problems
  • R. Brockett
  • Mathematics
    Proceedings of the 27th IEEE Conference on Decision and Control
  • 1988
The author establishes a number of properties associated with the dynamical system H=(H,(H,N)), where H and N are symmetric n-by-n matrices and (A,B)=AB-BA. The most important of these come from the
Morphological computation for adaptive behavior and cognition
Vibration of a Chain with Nonlinear Interaction
Vibration of a chain of particles interacting by nonlinear force is investigated. Using a transformation exact solutions to the equation of motion are aimed at. For a special type of interaction
Optimal control, optimization, and analytical mechanics
In this chapter we discuss some of the contributions of Roger Brockett to problems in optimal control theory, optimization, and analytical mechanics. In particular we consider how ideas in one field