Multi-robot motion planning is a core problem in robotics, asking how several moving agents can navigate a shared space without collision. The new paper studies this in a polygonal setting, where both the environment and the robots are represented as polygons, and the robots translate through the domain.

The main contribution is a fully polynomial-time approximation scheme (FPTAS). Such an algorithm returns a solution within a factor of (1 + ε) of optimal, for any chosen ε > 0, while running in time polynomial in the input size and 1/ε. This is a strong theoretical guarantee, especially for problems that are likely computationally hard in their exact form.

The abstract specifies a polygonal domain with n vertices and k robots, but does not give further details on the algorithm's complexity or constraints. The work appears to be a step toward practical approximations for a notoriously difficult coordination problem, though the full implications will depend on the complete paper.