Metraipolis › archive › dc_375ab170266f
Navigate or Relocate? Planning Among Movable Obstacles in Unknown Environments — arXiv:2609.19541
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.19541
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T05:25:26.539Z
- SHA-256 of the archived text
a3213ce8e756076455a748bbbe1b585df277112c79545327151b78001f406562- Stable URL of this page
https://metraipolis.com/documento/dc_375ab170266f
How to cite
Navigate or Relocate? Planning Among Movable Obstacles in Unknown Environments — arXiv:2609.19541 — arXiv (en), https://arxiv.org/abs/2609.19541 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_375ab170266f (Metraipolis archive dc_375ab170266f, sha256 a3213ce8e756076455a748bbbe1b585df277112c79545327151b78001f406562)
BibTeX
@misc{dc375ab170266f,
title = {Navigate or Relocate? Planning Among Movable Obstacles in Unknown Environments — arXiv:2609.19541},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.19541},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_375ab170266f; sha256 a3213ce8e756076455a748bbbe1b585df277112c79545327151b78001f406562},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.19541. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Conventional robot planning methods seek collision-free paths to a goal but fail when all paths are blocked. In these cases, the robot must determine which objects to relocate, in what order, and where to place them to clear a path---a problem known as Navigation Among Movable Obstacles (NAMO). Most NAMO planners assume a known environment, while existing approaches for unknown environments typically reason locally about relocations and cannot plan interdependent relocation sequences. We consider NAMO in unknown environments revealed through onboard sensing, where the robot must decide whether a blocked route requires relocation or a feasible path may exist through unexplored space. We propose an online framework that addresses this ambiguity by selecting between navigation and relocation using shortest paths that treat discovered movable objects as obstacles or as removable. Navigation relies on existing motion planners, while relocation uses a sampling-based approach that, unlike existing approaches for unknown environments, searches over \textit{interdependent} relocation sequences and uses an LLM to bias sampling. Numerical experiments demonstrate scalability to cluttered environments requiring interdependent relocations and improved plan quality over existing baselines.
Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-18 in cs.RO).
Categorie arXiv: Robotics (cs.RO).
Pagina del lavoro: https://arxiv.org/abs/2609.19541 — 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-10T04:47:38.830Z dalla pagina https://arxiv.org/catchup/cs.RO/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).