Metraipolis › archive › dc_629ccf25eb64
MeshSIPP: Efficient Lattice Planning in Dynamic Environment — arXiv:2610.09652
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.09652
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T11:09:29.259Z
- SHA-256 of the archived text
12ebc28380839d62898107e7fbd2f4187d3c8eff924feb625503d1d5f90e9a74- Stable URL of this page
https://metraipolis.com/documento/dc_629ccf25eb64
How to cite
MeshSIPP: Efficient Lattice Planning in Dynamic Environment — arXiv:2610.09652 — arXiv (en), https://arxiv.org/abs/2610.09652 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_629ccf25eb64 (Metraipolis archive dc_629ccf25eb64, sha256 12ebc28380839d62898107e7fbd2f4187d3c8eff924feb625503d1d5f90e9a74)
BibTeX
@misc{dc629ccf25eb64,
title = {MeshSIPP: Efficient Lattice Planning in Dynamic Environment — arXiv:2610.09652},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.09652},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_629ccf25eb64; sha256 12ebc28380839d62898107e7fbd2f4187d3c8eff924feb625503d1d5f90e9a74},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.09652. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Autonomous navigation in dynamic environments requires computing spatiotemporal trajectories that satisfy non-holonomic motion constraints. When the trajectories of the moving obstacles are predictable or known, a promising approach is to rely on the combination of state lattices constructed from precomputed feasible motion primitives and Safe Interval Path Planning -- a search-based algorithm with strong theoretical guarantees. While this approach yields feasible paths, the rich primitive sets needed for smooth navigation induce a large branching factor, which becomes costly when coupled with time-dependent obstacle intervals. To this end, we present MeshSIPP, an efficient planner that removes the computational bottleneck by exploiting the fact that many primitives sweep the same regions and can therefore be validated together. MeshSIPP propagates primitives as spatial bundles, screens them with lightweight bounding-interval checks, and defers the expensive exact departure-time search until a primitive reaches its terminal state. A time-aware pruning rule additionally discards redundant space-time branches early in the search. We prove that the resulting search is complete and optimal. Extensive experiments over more than 6,000 benchmark instances and real-time ROS~2 simulations show that MeshSIPP achieves up to a 3$\times$ speedup over state-of-the-art spatiotemporal planners. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno). Categorie arXiv: Artificial Intelligence (cs.AI) ; Robotics (cs.RO). Pagina del lavoro: https://arxiv.org/abs/2610.09652 — 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-08T10:14:05.952Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).