DeepAI AI Chat
Log In Sign Up

Optimal Physical Sorting of Mobile Agents

by   Dmitry Rabinovich, et al.

Given a collection of red and blue mobile agents located on two grid rows, we seek to move all the blue agents to the far left side and all the red agents to the far right side, thus physically sorting them according to color. The agents all start on the bottom row. They move simultaneously at discrete time steps and must not collide. Our goal is to design a centralized algorithm that controls the agents so as to sort them in the least number of time steps. We derive an exact lower bound on the amount of time any algorithm requires to sort a given initial configuration of agents. We find an instance optimal algorithm that provably matches this lower bound, attaining the best possible sorting time for any initial configuration. Surprisingly, we find that whenever the leftmost agent is red and the rightmost agent is blue, a straightforward decentralized and local sensing-based algorithm is at most 1 time step slower than the centralized instance-optimal algorithm.


page 1

page 2

page 3

page 4


Lower bound on the running time of Pop-Stack Sorting on a random permutation

Pop-Stack Sorting is an algorithm that takes a permutation as an input a...

Multi-Agent Pathfinding (MAPF) with Continuous Time

MAPF is the problem of finding paths for multiple agents such that every...

Deterministic Rendezvous in Infinite Trees

The rendezvous task calls for two mobile agents, starting from different...

Distributed Pattern Formation in a Ring

Motivated by concerns about diversity in social networks, we consider th...

Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data

We empirically study sorting in the evolving data model. In this model, ...

On Geometric Shape Construction via Growth Operations

In this work, we investigate novel algorithmic growth processes. In part...

Pricing group membership

We consider a model where agents differ in their `types' which determine...