Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds

05/16/2022
by   Bahareh Banyassady, et al.
0

We consider the unlabeled motion-planning problem of m unit-disc robots moving in a simple polygonal workspace of n edges. The goal is to find a motion plan that moves the robots to a given set of m target positions. For the unlabeled variant, it does not matter which robot reaches which target position as long as all target positions are occupied in the end. If the workspace has narrow passages such that the robots cannot fit through them, then the free configuration space, representing all possible unobstructed positions of the robots, will consist of multiple connected components. Even if in each component of the free space the number of targets matches the number of start positions, the motion-planning problem does not always have a solution when the robots and their targets are positioned very densely. In this paper, we prove tight bounds on how much separation between start and target positions is necessary to always guarantee a solution. Moreover, we describe an algorithm that always finds a solution in time O(n log n + mn + m^2) if the separation bounds are met. Specifically, we prove that the following separation is sufficient: any two start positions are at least distance 4 apart, any two target positions are at least distance 4 apart, and any pair of a start and a target positions is at least distance 3 apart. We further show that when the free space consists of a single connected component, the separation between start and target positions is not necessary.

READ FULL TEXT

page 1

page 3

page 7

page 9

page 18

page 19

page 20

page 23

research
04/25/2020

Multi-robot motion planning of k-colored discs is PSPACE-hard

In the problem of multi-robot motion planning, a group of robots, placed...
research
09/30/2022

Multi-Robot Motion Planning for Unit Discs with Revolving Areas

We study the problem of motion planning for a collection of n labeled un...
research
04/14/2021

On the Complexity of a Family of Decoupled Multi-Robot Motion Planning Problems

In multi-robot motion planning (MRMP) the aim is to plan the motion of s...
research
07/14/2018

Motion Planning for Multiple Unit-Ball Robots in R^d

We present a decoupled algorithm for motion planning for a collection of...
research
03/28/2021

Coordinated Motion Planning Through Randomized k-Opt

This paper examines the approach taken by team gitastrophe in the CG:SHO...
research
06/08/2020

Space-Aware Reconfiguration

We consider the problem of reconfiguring a set of physical objects into ...
research
01/05/2018

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

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

Please sign up or login with your details

Forgot password? Click here to reset