arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2610.20241cs.RO

基于几何候选模式的多模态演示学习导航

Learning Navigation from Multimodal Demonstrations with Geometric Candidate Modes

The Ohio State University(俄亥俄州立大学)

Chengyang Peng, Zhihao Zhang, Upama Pant, Yiming Wang, Keith A. Redmill, Ayonga Hereid

AI总结:

该研究针对离线导航演示多模态导致行为克隆路径不安全的问题,提出分层神经网络策略,从局部几何计算候选模式,仿真测试成功率超95%且可迁移至双足机器人。

摘要:

离线导航演示具有多模态特性,因为同一观测结果往往对应多个有效动作,例如从障碍物两侧通过。行为克隆会对这些动作取平均,可能导致不安全的路径。多模态策略必须从数据中发现这些备选方案,但相似状态可能导致不同路径,其当前动作存在重叠。在导航场景中,这些备选方案具有几何成因,可从单一观测结果计算得出。我们提出一种分层神经网络策略,该策略从局部几何计算候选模式,并从演示中学习应遵循哪种模式以及如何执行。高层策略利用目标和其在一组候选模式中的先前选择来选择模式,低层策略将该模式转化为具体动作。在仿真环境中,该策略在已见和未见测试案例中的成功率超过95%,而四个离线学习基线的成功率最高分别为43%和20%,采用相同模式但不进行学习的启发式方法的成功率最高分别为79%和67%。经仿真训练的策略还可迁移至LimX Tron 1双足机器人。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑