Metraipolis › archive › dc_09ec11065170

Local-Minimum Escaper: Programmatic Subgoal Generation for Robust Navigation in Unknown Environments — arXiv:2609.38928

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.38928
License (as archived)
CC0-1.0
Archived
2026-10-07T15:11:47.258Z
SHA-256 of the archived text
108f84bd1a7acabedea7e458e13f37c8a4182604715ae585cb44fc6a795be5e1
Stable URL of this page
https://metraipolis.com/documento/dc_09ec11065170

How to cite

Local-Minimum Escaper: Programmatic Subgoal Generation for Robust Navigation in Unknown Environments — arXiv:2609.38928 — arXiv (en), https://arxiv.org/abs/2609.38928 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_09ec11065170 (Metraipolis archive dc_09ec11065170, sha256 108f84bd1a7acabedea7e458e13f37c8a4182604715ae585cb44fc6a795be5e1)
BibTeX
@misc{dc09ec11065170,
  title = {Local-Minimum Escaper: Programmatic Subgoal Generation for Robust Navigation in Unknown Environments — arXiv:2609.38928},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.38928},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_09ec11065170; sha256 108f84bd1a7acabedea7e458e13f37c8a4182604715ae585cb44fc6a795be5e1},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.38928. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Mapless navigation in unknown and partially observable environments remains challenging for mobile robots, particularly when local minima prevent the robot from making progress toward its goal. Existing local navigation methods often lack an explicit mechanism for escaping such situations, while deep reinforcement learning (DRL) approaches typically learn recovery behaviors implicitly through reward design and policy optimization. In this work, we propose \textbf{LME} (Local-Minimum Escaper), a programmatic hierarchical framework that explicitly generates and reasons subgoals to guide robots out of local-minimum regions. LME operates solely on local observations and selects candidate subgoals using interpretable heuristic criteria that account for both surrounding obstacle geometry and candidate-location safety. A local planner then generates low-level motion commands toward the selected subgoal. This design enables LME to handle environments both with and without local minima within a unified framework, while remaining independent of the underlying local planner and requiring no additional training. Extensive experiments in simulated and real-world environments demonstrate that LME provides robust navigation performance and generalizes to challenging unseen scenarios. Furthermore, the generated subgoals can be used to guide different local planners, substantially improving their ability to escape local minima. Successful deployments on both differential-drive and quadruped robots further demonstrate the practical applicability and generality of the proposed framework.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-10-01 in cs.RO).
Categorie arXiv: Robotics (cs.RO).
Pagina del lavoro: https://arxiv.org/abs/2609.38928 — 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-07T14:44:47.393Z dalla pagina https://arxiv.org/catchup/cs.RO/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).