Metraipolis › archive › dc_3ca71479ac1a

FPTAS for Polygonal Multi-Robot Motion Planning — arXiv:2610.20244

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.20244
License (as archived)
CC0-1.0
Archived
2026-10-15T21:58:11.188Z
SHA-256 of the archived text
30c3d31c67a61868a769641c3f294cecd60758ebf35f7b7235a2fcc1158f179c
Stable URL of this page
https://metraipolis.com/documento/dc_3ca71479ac1a

How to cite

FPTAS for Polygonal Multi-Robot Motion Planning — arXiv:2610.20244 — arXiv (en), https://arxiv.org/abs/2610.20244 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3ca71479ac1a (Metraipolis archive dc_3ca71479ac1a, sha256 30c3d31c67a61868a769641c3f294cecd60758ebf35f7b7235a2fcc1158f179c)
BibTeX
@misc{dc3ca71479ac1a,
  title = {FPTAS for Polygonal Multi-Robot Motion Planning — arXiv:2610.20244},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.20244},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3ca71479ac1a; sha256 30c3d31c67a61868a769641c3f294cecd60758ebf35f7b7235a2fcc1158f179c},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.20244. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study multi-robot motion planning in a polygonal environment with polygonal robots. The setting of the problem consists of a polygonal domain $\mathcal{W}$ with $n$ vertices and $k$ robots $R_1,\dots,R_k$ translating in $\mathcal{W}$ each of which is represented by a polygon of constant complexity. Given a source configuration $\mathbf{s}$ and a target configuration $\mathbf{t}$ of the robots in $\mathcal{W}$, the goal of the problem is to find a collision-free motion plan from $\mathbf{s}$ to $\mathbf{t}$ that is shortest with respect to some cost function. We present the first fully polynomial-time approximation schemes (FPTAS) for motion planning with any fixed number $k$ of robots, under the min-sum objective, the min-max objective, and the min-makespan objective. Here, the min-sum variant aims to minimize the total traveling distance of all robots, the min-max variant aims to minimize the maximum traveling distance of a single robot, and the min-makespan variant aims to minimize the total time cost under the assumption that all robots move with a maximum speed $1$. The algorithm directly generalizes to the problem in any fixed dimension $d$, with a polytope environment and polytope robots. Our result settles an open question of Agarwal, Halperin, Sharir, Steiger [SODA'24] and Agarwal, Holmgren, Steiger [SODA'26], who gave an FPTAS for $k=2$ unit-square robots and a bicriteria-approximation algorithm for a fixed number $k$ of unit-square or unit-disk robots, respectively. Compared to the previous results, our algorithm is substantially simpler.

Tema degli esploratori: statistica e scienza dei dati (elenco arXiv cs.RO, nuovi lavori del giorno).
Categorie arXiv: Computational Geometry (cs.CG) ; Data Structures and Algorithms (cs.DS); Robotics (cs.RO).
Pagina del lavoro: https://arxiv.org/abs/2610.20244 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-15T21:38:44.524Z dalla pagina https://arxiv.org/list/cs.RO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).