Making Solutions of Multi-robot Path Planning Problems Shorter Using Weak Transpositions and Critical Path Parallelism

Abstract

Two techniques for shortening solutions of multi-robot path planning problem are presented in this paper. The first presented solution shortening technique is based on the use of optimal macros of which the overall solution is composed.

The second technique is trying to increase parallelism within the resulting solutions by the method of critical path.

Keywords

• Making
• Solutions
• Multi-robot
• Planning
• Problems
• Shorter
• Using
• Transpositions
• Critical
• Parallelism