Metraipolis › archive › dc_9166ecc3577e
A complete analytical characterization of optimal collision-free motion for two robots — arXiv:2610.41558
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.41558
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-02T04:57:33.916Z
- SHA-256 of the archived text
23c14e227f8e72d642d3ec4842829986b449a6ad9d55ada77f438bb9b2c22312- Stable URL of this page
https://metraipolis.com/documento/dc_9166ecc3577e
How to cite
A complete analytical characterization of optimal collision-free motion for two robots — arXiv:2610.41558 — arXiv (en), https://arxiv.org/abs/2610.41558 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9166ecc3577e (Metraipolis archive dc_9166ecc3577e, sha256 23c14e227f8e72d642d3ec4842829986b449a6ad9d55ada77f438bb9b2c22312)
BibTeX
@misc{dc9166ecc3577e,
title = {A complete analytical characterization of optimal collision-free motion for two robots — arXiv:2610.41558},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.41558},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9166ecc3577e; sha256 23c14e227f8e72d642d3ec4842829986b449a6ad9d55ada77f438bb9b2c22312},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41558. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Collision-free motion planning for multi-agent robotic systems remains an active research area because of the complexity of coordinating robot trajectories, with applications ranging from coordinated drone shows to autonomous operations on land, in the air, and on water. Importantly, the analytical difficulty of nonconvex collision-avoidance constraints has so far driven the development of exclusively numerical methods. We derive a complete analytical characterization of the optimal trajectories for two robots that start and end at rest, under double-integrator dynamics and a squared-acceleration objective. We prove that these trajectories belong to eight distinct contact families and determine which family applies for each configuration of initial and final positions. We analyze the geometrical properties of the optimal trajectories, provide a numerical algorithm for computing them, and discuss how these insights may improve the performance of existing numerical trajectory optimizers. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno). Categorie arXiv: Robotics (cs.RO) ; Systems and Control (eess.SY); Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2610.41558 — 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-11-02T04:46:57.690Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).