Metraipolis › archive › dc_8f5ff350bd13
Rapidly-Iterating Grid-Based Near-Optimal Kinodynamic Motion Planning — arXiv:2609.22733
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.22733
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T22:23:35.318Z
- SHA-256 of the archived text
1e8c197f6bcfe8f96dbb5eb20fabad96f8fdd78c5a7c9cc800d46d2c670c51b9- Stable URL of this page
https://metraipolis.com/documento/dc_8f5ff350bd13
How to cite
Rapidly-Iterating Grid-Based Near-Optimal Kinodynamic Motion Planning — arXiv:2609.22733 — arXiv (en), https://arxiv.org/abs/2609.22733 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8f5ff350bd13 (Metraipolis archive dc_8f5ff350bd13, sha256 1e8c197f6bcfe8f96dbb5eb20fabad96f8fdd78c5a7c9cc800d46d2c670c51b9)
BibTeX
@misc{dc8f5ff350bd13,
title = {Rapidly-Iterating Grid-Based Near-Optimal Kinodynamic Motion Planning — arXiv:2609.22733},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.22733},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8f5ff350bd13; sha256 1e8c197f6bcfe8f96dbb5eb20fabad96f8fdd78c5a7c9cc800d46d2c670c51b9},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.22733. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This paper develops the Rapidly-iterating kinoDynamic Grid (RDG) algorithm, an asymptotically near-optimal kinodynamic motion planning algorithm that produces high quality solutions through rapid iteration. The algorithm leverages a state space grid decomposition to perform node selection, dynamics propagation, and graph revision in constant time complexity with respect to the number of nodes in the trajectory tree. Through a covering ball sequence induction proof, the algorithm is shown to be asymptotically near-optimal and probabilistically complete. Different subsystems of the algorithm are evaluated against common nearest-neighbor search-based methods at generating exploration bias. The RDG algorithm is evaluated through simulated trials in complex, kinodynamic motion planning problem environments up to 10 DOF relative to similar sparse, kinodynamic planning algorithms with optimality guarantees, SST and DIRT. The RDG algorithm outperforms both SST and DIRT in mean final solution quality by up to 104% and 40% respectively. Additionally, RDG maintained a 100% success rate, even on a 10-DOF test case where both SST and DIRT did not. Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-22 in cs.RO). Categorie arXiv: Robotics (cs.RO). Pagina del lavoro: https://arxiv.org/abs/2609.22733 — 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-09T21:59:59.468Z dalla pagina https://arxiv.org/catchup/cs.RO/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).