arXiv:2510.20261cs.ROcs.CV2025-10NeurIPS被引 3

Kinaema让机器人在移动中自动记忆空间位置,无需显式存储历史。

Kinaema: a recurrent sequence model for memory and pose in motion

  • 用递归变换器隐式压缩视觉流,构建连续空间记忆。
  • 在预设目标场景中导航准确率超90%,且计算效率更高。
  • 适合长期移动的机器人导航任务,尤其擅长大场景记忆。

空间感知机器人需具备“定位自身”的能力。本文聚焦连续机器人操作场景,利用任务开始前的观测信息优化效率。提出新模型Kinaema及其智能体,可在移动过程中持续整合视觉输入,并在收到查询图像时,预测该空间相对于当前位置的相对位置。模型不显式存储观测历史,无上下文长度限制,通过递归更新的Transformer维护隐式潜在记忆,将传感器读数历史压缩为紧凑表示。我们在新任务Mem-Nav上评估该模型,结果表明:大容量递归模型能有效保持场景表征,在任务开始前已观察到的目标处实现高精度导航,且计算效率显著优于传统依赖历史注意力的Transformer。

原文摘要 · Abstract (English)

One key aspect of spatially aware robots is the ability to "find their bearings", ie. to correctly situate themselves in previously seen spaces. In this work, we focus on this particular scenario of continuous robotics operations, where information observed before an actual episode start is exploited to optimize efficiency. We introduce a new model, Kinaema, and agent, capable of integrating a stream of visual observations while moving in a potentially large scene, and upon request, processing a query image and predicting the relative position of the shown space with respect to its current position. Our model does not explicitly store an observation history, therefore does not have hard constraints on context length. It maintains an implicit latent memory, which is updated by a transformer in a recurrent way, compressing the history of sensor readings into a compact representation. We evaluate the impact of this model in a new downstream task we call "Mem-Nav". We show that our large-capacity recurrent model maintains a useful representation of the scene, navigates to goals observed before the actual episode start, and is computationally efficient, in particular compared to classical transformers with attention over an observation history.

机器人导航隐式记忆递归模型

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。