Metraipolis › archive › dc_905af543cb01
Path Planning with Motion Primitives in Dynamic Environments: SIPP on Lattices — arXiv:2609.31803
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.31803
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T00:16:49.370Z
- SHA-256 of the archived text
6584bbdacfa466629e3e25505af418e20b9756fe98737510b57173133dad588a- Stable URL of this page
https://metraipolis.com/documento/dc_905af543cb01
How to cite
Path Planning with Motion Primitives in Dynamic Environments: SIPP on Lattices — arXiv:2609.31803 — arXiv (en), https://arxiv.org/abs/2609.31803 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_905af543cb01 (Metraipolis archive dc_905af543cb01, sha256 6584bbdacfa466629e3e25505af418e20b9756fe98737510b57173133dad588a)
BibTeX
@misc{dc905af543cb01,
title = {Path Planning with Motion Primitives in Dynamic Environments: SIPP on Lattices — arXiv:2609.31803},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.31803},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_905af543cb01; sha256 6584bbdacfa466629e3e25505af418e20b9756fe98737510b57173133dad588a},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.31803. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Autonomous navigation in dynamic environments is a critical challenge, particularly when spaces are shared with other mobile agents whose future trajectories are known. While traditional grid-based planners efficiently find collision-free paths, their reliance on stop-and-turn mechanics over $2^k$-connected grids produces piecewise-linear trajectories that are kinodynamically highly sub-optimal for differentially constrained robots. In this paper, we present an adaptation of Safe Interval Path Planning (SIPP) that operates on state lattices, utilizing precomputed, kinodynamically smooth motion primitives. To efficiently handle dynamic environments, we rasterize the spatiotemporal swept volumes of moving obstacles directly onto the grid, treating grid cells as atomic units of space, whose resolution is typically dictated by inherent localization noise. We perform a comprehensive comparative analysis between our lattice-based approach and $2^k$-connected grid planners across diverse topological environments. Our evaluation considers a broad spectrum of performance metrics, including planning time, path angularity, cumulative heading change (angle-over-length), and bending energy. The results demonstrate that while the expanded state space of lattice-based search increases computational overhead, it yields trajectories with significantly superior kinodynamic properties. Specifically, our method achieves a reachability comparable to highly connected grids while ensuring smooth, continuous, and physically executable paths ready for real-world deployment. Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-29 in cs.RO). Categorie arXiv: Robotics (cs.RO). Pagina del lavoro: https://arxiv.org/abs/2609.31803 — 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.376Z 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).