让机器人通过学习推物动力学,实现未知物体的精准规划。
Learning Attentive Neural Processes for Planning with Pushing Actions
- 用注意力神经过程建模未知物理属性的信念
- 在复杂推物场景中比传统方法快且规划更优
- 适合需要自适应物理推理的机器人操作任务
本文旨在让机器人规划一系列桌面推物动作,将具有未知物理特性的方块推至目标位姿。采用部分可观测马尔可夫决策过程(POMDP)建模,机器人可观察每次推动物体的结果,但其决定运动动态的物理属性未知。传统方法依赖监督学习训练观测模型,需已知物理属性,而本文不作此假设。此外,粒子滤波进行信念更新计算成本高。为此,提出学习一种注意力神经过程,基于动作历史计算对关键物理属性的潜在表示上的信念。结合双级渐进宽采样策略,构建神经过程树(NPT-DPW)。仿真结果表明,该方法在复杂推物场景下生成性能更优的计划,且速度优于使用监督训练观测模型的粒子滤波方法。
原文摘要 · Abstract (English)
Our goal is to enable robots to plan sequences of tabletop actions to push a block with unknown physical properties to a desired goal pose. We approach this problem by learning the constituent models of a Partially-Observable Markov Decision Process (POMDP), where the robot can observe the outcome of a push, but the physical properties of the block that govern the dynamics remain unknown. A common solution approach is to train an observation model in a supervised fashion, and do inference with a general inference technique such as particle filters. However, supervised training requires knowledge of the relevant physical properties that determine the problem dynamics, which we do not assume to be known. Planning also requires simulating many belief updates, which becomes expensive when using particle filters to represent the belief. We propose to learn an Attentive Neural Process that computes the belief over a learned latent representation of the relevant physical properties given a history of actions. To address the pushing planning problem, we integrate a trained Neural Process with a double-progressive widening sampling strategy. Simulation results indicate that Neural Process Tree with Double Progressive Widening (NPT-DPW) generates better-performing plans faster than traditional particle-filter methods that use a supervised-trained observation model, even in complex pushing scenarios.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。