DeepAI AI Chat
Log In Sign Up

Coordinating the Motion of Labeled Discs with Optimality Guarantees under Extreme Density

by   Rupesh Chinta, et al.
Rutgers University

We push the limit in planning collision-free motions for routing uniform labeled discs in two dimensions. First, from a theoretical perspective, we show that the constant-factor time-optimal routing of labeled discs can be achieved using a polynomial-time algorithm with robot density over 50% in the limit (i.e., over half of the workspace may be occupied by the discs). Second, from a more practical standpoint, we provide a high performance algorithm that computes near-optimal (e.g., 1.x) solutions under the same density setting.


page 1

page 2

page 3

page 4


SEAR: A Polynomial-Time Expected Constant-Factor Optimal Algorithmic Framework for Multi-Robot Path Planning

This work studies the labeled multi-robot path and motion planning probl...

SEAR: A Polynomial-Time Multi-Robot Path Planning Algorithm with Expected Constant-Factor Optimality Guarantee

We study the labeled multi-robot path planning problem in continuous 2D ...

Sub-1.5 Time-Optimal Multi-Robot Path Planning on Grids in Polynomial Time

Graph-based multi-robot path planning (MRPP) is NP-hard to optimally sol...

Efficiently Reconfiguring a Connected Swarm of Labeled Robots

When considering motion planning for a swarm of n labeled robots, we nee...

Connected Coordinated Motion Planning with Bounded Stretch

We consider the problem of coordinated motion planning for a swarm of si...

Rearrangement on Lattices with Pick-n-Swaps: Optimality Structures and Efficient Algorithms

We investigate a class of multi-object rearrangement problems in which a...