Two Techniques That Enhance the Performance of Multi-robot Prioritized Path Planning

05/03/2018
by   Anton Andreychuk, et al.
0

We introduce and empirically evaluate two techniques aimed at enhancing the performance of multi-robot prioritized path planning. The first technique is the deterministic procedure for re-scheduling (as opposed to well-known approach based on random restarts), the second one is the heuristic procedure that modifies the search-space of the individual planner involved in the prioritized path finding.

READ FULL TEXT

page 1

page 2

page 3

research
08/03/2023

Multi-robot Path Planning with Rapidly-exploring Random Disjointed-Trees

Multi-robot path planning is a computational process involving finding p...
research
09/10/2021

Optimizing Space Utilization for More Effective Multi-Robot Path Planning

We perform a systematic exploration of the principle of Space Utilizatio...
research
02/25/2021

LES: Locally Exploitative Sampling for Robot Path Planning

Sampling-based algorithms solve the path planning problem by generating ...
research
10/31/2011

Exploiting Subgraph Structure in Multi-Robot Path Planning

Multi-robot path planning is difficult due to the combinatorial explosio...
research
06/19/2021

Learning Space Partitions for Path Planning

Path planning, the problem of efficiently discovering high-reward trajec...

Please sign up or login with your details

Forgot password? Click here to reset