A Novel Approach to Path Planning for Multiple Robots in Bi-connected Graphs

Abstract

The class of multi-robot path planning problem with bi-connected graphs is studied. A novel polynomial-time solving algorithm for this class of problem is proposed.

Keywords

• Path Planning
• Multiple Robots
• Bi-connected Graph