Metraipolis › archive › dc_7dd92dda3069
Motion planning in high dimensional spaces hybridizing RRT and HAR via position-direction decoupling — arXiv:2609.16810
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.16810
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T21:30:30.877Z
- SHA-256 of the archived text
5aff888a39334c29f1975a5c8f663c823a4ea4eeb88c06a1cd5a432535ff4708- Stable URL of this page
https://metraipolis.com/documento/dc_7dd92dda3069
How to cite
Motion planning in high dimensional spaces hybridizing RRT and HAR via position-direction decoupling — arXiv:2609.16810 — arXiv (en), https://arxiv.org/abs/2609.16810 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7dd92dda3069 (Metraipolis archive dc_7dd92dda3069, sha256 5aff888a39334c29f1975a5c8f663c823a4ea4eeb88c06a1cd5a432535ff4708)
BibTeX
@misc{dc7dd92dda3069,
title = {Motion planning in high dimensional spaces hybridizing RRT and HAR via position-direction decoupling — arXiv:2609.16810},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.16810},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7dd92dda3069; sha256 5aff888a39334c29f1975a5c8f663c823a4ea4eeb88c06a1cd5a432535ff4708},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.16810. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The exploration of high-dimensional spaces remains a challenging problem, in particular in the presence of narrow passages and small clearances. We propose novel sampling-based path-planning methods for high-dimensional spaces combining Rapidly-exploring Random Trees (RRT) and Hit-and-Run (HAR) random walks by decoupling the point being extended from the direction of extension. We also show that RRT and HAR appear as special cases of a generic algorithm coupling the biases used for the point and direction extension, respectively. We further study a sparse-move strategy in which only a fraction p_r of the robots is moved at each step, helping both RRT and the proposed HAR algorithms handle cluttered instances. Tests are presented for two families of models: classical piano mover problems in 3D, and complex molecular systems involving tens of rigid domains moving relatively to one another -- the latter viewed as independent robots exploring the motion space SE(3)N . Within seconds on a standard laptop, our algorithms solve instances with up to 64 robots and 384 degrees of freedom. We conclude by suggesting one of our methods, HARF, as the method of choice for complex multi-robot planning problems, being up to two orders of magnitude faster than the classical RRT moving all robots at each step--when it succeeds at all, and still up to 2.4 fold faster on most instances when both use their best p_r. Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-16 in cs.RO). Categorie arXiv: Robotics (cs.RO). Pagina del lavoro: https://arxiv.org/abs/2609.16810 — 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:30:17.340Z dalla pagina https://arxiv.org/catchup/cs.RO/2026-09-16?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).