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.
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. (en)