Metraipolis › archive › dc_84aafdcf095c

Learning Navigation from Multimodal Demonstrations with Geometric Candidate Modes — arXiv:2610.20241

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.20241
License (as archived)
CC0-1.0
Archived
2026-10-15T21:58:03.027Z
SHA-256 of the archived text
918c85b43ba7afb5baf5834a7425da1e280b522e2ce12649a93dc94e682346cc
Stable URL of this page
https://metraipolis.com/documento/dc_84aafdcf095c

How to cite

Learning Navigation from Multimodal Demonstrations with Geometric Candidate Modes — arXiv:2610.20241 — arXiv (en), https://arxiv.org/abs/2610.20241 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_84aafdcf095c (Metraipolis archive dc_84aafdcf095c, sha256 918c85b43ba7afb5baf5834a7425da1e280b522e2ce12649a93dc94e682346cc)
BibTeX
@misc{dc84aafdcf095c,
  title = {Learning Navigation from Multimodal Demonstrations with Geometric Candidate Modes — arXiv:2610.20241},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.20241},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_84aafdcf095c; sha256 918c85b43ba7afb5baf5834a7425da1e280b522e2ce12649a93dc94e682346cc},
  year = {2026}
}

Archived text

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

Offline navigation demonstrations are multimodal, because one observation often allows several valid actions, such as passing an obstacle on either side. Behavior cloning averages these actions, potentially leading to unsafe routes. Multimodal policies must discover the alternatives from the data, but similar states can lead to different routes whose current actions overlap. In navigation, the alternatives have a geometric cause and can be computed from one observation. We propose a hierarchical neural-network policy that computes candidate modes from local geometry and learns from demonstrations which mode to follow and how. A high-level policy selects a mode using the goal and its previous choice among a set of candidate modes, and a low-level policy turns it into an action. In simulation, the policy succeeds in over 95\% of seen and unseen test cases, compared with at most 43\% and 20\% for four offline learning baselines and 79\% and 67\% for a heuristic that uses the same modes without learning. The simulation-trained policy also transfers to a LimX Tron 1 bipedal robot.

Tema degli esploratori: statistica e scienza dei dati (elenco arXiv cs.RO, nuovi lavori del giorno).
Categorie arXiv: Robotics (cs.RO).
Pagina del lavoro: https://arxiv.org/abs/2610.20241 — 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:38:44.499Z dalla pagina https://arxiv.org/list/cs.RO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).