Polynomial Time Near-Time-Optimal Multi-Robot Path Planning in Three Dimensions with Applications to Large-Scale UAV Coordination

07/06/2022
by   Teng Guo, et al.
0

For enabling efficient, large-scale coordination of unmanned aerial vehicles (UAVs) under the labeled setting, in this work, we develop the first polynomial time algorithm for the reconfiguration of many moving bodies in three-dimensional spaces, with provable 1.x asymptotic makespan optimality guarantee under high robot density. More precisely, on an m_1× m_2 × m_3 grid, m_1≥ m_2≥ m_3, our method computes solutions for routing up to m_1m_2m_3/3 uniquely labeled robots with uniformly randomly distributed start and goal configurations within a makespan of m_1 + 2m_2 +2m_3+o(m_1), with high probability. Because the makespan lower bound for such instances is m_1 + m_2+m_3 - o(m_1), also with high probability, as m_1 →∞, m_1+2m_2+2m_3/m_1+m_2+m_3 optimality guarantee is achieved. m_1+2m_2+2m_3/m_1+m_2+m_3∈ (1, 5/3], yielding 1.x optimality. In contrast, it is well-known that multi-robot path planning is NP-hard to optimally solve. In numerical evaluations, our method readily scales to support the motion planning of over 100,000 robots in 3D while simultaneously achieving 1.x optimality. We demonstrate the application of our method in coordinating many quadcopters in both simulation and hardware experiments.

READ FULL TEXT

page 1

page 2

page 3

page 4

page 5

page 6

page 7

page 8

research
01/22/2022

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...
research
05/11/2021

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

We investigate a class of multi-object rearrangement problems in which a...
research
09/24/2017

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 ...
research
09/24/2017

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...
research
07/09/2018

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

We push the limit in planning collision-free motions for routing uniform...
research
04/02/2019

Coordinating Large-Scale Robot Networks with Motion and Communication Uncertainties for Logistics Applications

In this paper, we focus on the problem of task allocation, cooperative p...
research
03/21/2020

Multi-Robot Association-Path Planning in Millimeter-Wave Industrial Scenarios

The massive exploitation of robots for industry 4.0 needs advanced wirel...

Please sign up or login with your details

Forgot password? Click here to reset