Efficiently Reconfiguring a Connected Swarm of Labeled Robots

by   Sandor P. Fekete, et al.

When considering motion planning for a swarm of n labeled robots, we need to rearrange a given start configuration into a desired target configuration via a sequence of parallel, continuous, collision-free robot motions. The objective is to reach the new configuration in a minimum amount of time; an important constraint is to keep the swarm connected at all times. Problems of this type have been considered before, with recent notable results achieving constant stretch for not necessarily connected reconfiguration: If mapping the start configuration to the target configuration requires a maximum Manhattan distance of d, the total duration of an overall schedule can be bounded to 𝒪(d), which is optimal up to constant factors. However, constant stretch could only be achieved if disconnected reconfiguration is allowed, or for scaled configurations (which arise by increasing all dimensions of a given object by the same multiplicative factor) of unlabeled robots. We resolve these major open problems by (1) establishing a lower bound of Ω(√(n)) for connected, labeled reconfiguration and, most importantly, by (2) proving that for scaled arrangements, constant stretch for connected reconfiguration can be achieved. In addition, we show that (3) it is NP-hard to decide whether a makespan of 2 can be achieved, while it is possible to check in polynomial time whether a makespan of 1 can be achieved.


page 5

page 8

page 9

page 10

page 14

page 15

page 16

page 23


Connected Coordinated Motion Planning with Bounded Stretch

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

Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch

We present a number of breakthroughs for coordinated motion planning, in...

Space-Aware Reconfiguration

We consider the problem of reconfiguring a set of physical objects into ...

Computing Coordinated Motion Plans for Robot Swarms: The CG:SHOP Challenge 2021

We give an overview of the 2021 Computational Geometry Challenge, which ...

Multi-Robot Motion Planning for Unit Discs with Revolving Areas

We study the problem of motion planning for a collection of n labeled un...

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

We push the limit in planning collision-free motions for routing uniform...

Compacting Squares

Edge-connected configurations of squares are a common model for modular ...

Please sign up or login with your details

Forgot password? Click here to reset