Article

Fully Polynomial-Time Approximation Scheme (FPTAS) for Multi-Robot Motion Planning

This work presents the first fully polynomial-time approximation scheme (FPTAS) for the multi-robot motion planning problem, for a fixed number k of translating polygonal robots in a polygonal environment, covering the min-sum, min-max, and min-makespan objectives. The algorithm generalizes to polytope environments and polytope robots in any fixed dimension d, and it resolves the open problem raised by Agarwal et al. on an FPTAS for k=2 unit-square and unit-disk robots, while being simpler than existing results. The paper will be published at SODA 2027.

Part of the event: First FPTAS for Multi-Robot Motion Planning to Be Presented at SODA 2027

This page provides a summary and source link only.