Metraipolis › archive › dc_f8636e349261

Towards Kinematic Actionable Infeasibility Detection in Motion Planning — arXiv:2609.32806

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.32806
License (as archived)
CC0-1.0
Archived
2026-10-08T00:17:00.652Z
SHA-256 of the archived text
ff1470bd3b4635cae160291f990a9a323147b3fe0615522bd151feb64c73e52f
Stable URL of this page
https://metraipolis.com/documento/dc_f8636e349261

How to cite

Towards Kinematic Actionable Infeasibility Detection in Motion Planning — arXiv:2609.32806 — arXiv (en), https://arxiv.org/abs/2609.32806 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f8636e349261 (Metraipolis archive dc_f8636e349261, sha256 ff1470bd3b4635cae160291f990a9a323147b3fe0615522bd151feb64c73e52f)
BibTeX
@misc{dcf8636e349261,
  title = {Towards Kinematic Actionable Infeasibility Detection in Motion Planning — arXiv:2609.32806},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.32806},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f8636e349261; sha256 ff1470bd3b4635cae160291f990a9a323147b3fe0615522bd151feb64c73e52f},
  year = {2026}
}

Archived text

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

Motion planning in robotics requires not only computing collision-free paths but also certifying infeasibility when no such path exists. Complete methods are limited to low-dimensional spaces, while sampling-based planners scale efficiently but cannot provide finite-time infeasibility certificates, leaving this problem largely unresolved in high-dimensional spaces. In this letter, we present a geometry-driven framework for certifying infeasibility through an explicit resolution-dependent analysis of configuration space topology. Leveraging signed distance field representations, the proposed method traces separating manifolds induced by obstacle boundaries directly in configuration space, enabling both detection of infeasibility and identification of the specific geometric cause. To address computational challenges, we develop a parallel frontier-expansion algorithm that exploits GPU acceleration for efficient simplicial reconstruction in high-dimensional spaces. We validate the approach on 4-DOF and 5-DOF robot scenarios, certifying infeasibility within seconds for 4-DOF cases and under four minutes for 5-DOF cases. We further discuss avenues for improving scalability to higher-dimensional spaces.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-29 in cs.RO).
Categorie arXiv: Robotics (cs.RO) ; Computational Geometry (cs.CG).
Pagina del lavoro: https://arxiv.org/abs/2609.32806 — 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-07T23:52:16.435Z dalla pagina https://arxiv.org/catchup/cs.RO/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).