analiza aiqbench
This research addresses the safety risks of standard behavior cloning in offline navigation by proposing a hierarchical neural-network policy that leverages local geometry to select distinct candidate modes. The method successfully learns from demonstrations to choose between valid alternatives, achieving over 95% success rates in simulation and demonstrating transferability to bipedal robots.
Learning Navigation from Multimodal Demonstrations with Geometric Candidate Modes
arXiv:2610.20241v1 Announce Type: new Abstract: 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.
Abstract: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.
Robotics (cs.RO)
arXiv:2610.20241 [cs.RO]
(or arXiv:2610.20241v1 [cs.RO] for this version)
https://doi.org/10.48550/arXiv.2610.20241 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 263 cuvinte
Subiecte conexe

Bypassing inference bottlenecks: Accelerating complex AI search with Retrieve-for-Train
Google Research · 15 sept. 2026
NaviAIS: A Scenario-Level Vessel Trajectory Prediction Dataset withVectorized Lane Priors and the NaviLane Forecasting Framework
arXiv · 23 iul. 2026

The art and science of hyperparameter optimization on Amazon Nova Forge
AWS · 2 iun. 2026
Conditional Trajectory Peaks: Single-Pass Multimodal Policies over Action Chunks
arXiv · 6 oct. 2026