Coordinated Motion Planning is FPT on Discretized Simple Polygons

Argyrios Deligkas, Eduard Eiben, Robert Ganian +1

In the coordinated motion planning problem, we are given a graph together with the starting and destination vertices of $k$ robots. At each time step, any subset of robots may move…