arXiv:2609.22684v1 Announce Type: cross
Abstract: Memory-dependent robotic manipulation often requires later actions to use information from earlier interactions. Existing vision-language-action (VLA...
By Wenzhuo Li, Qiongfeng Shi, Yi Zhou
arXiv:2609.36595v1 Announce Type: cross
Abstract: Visual-memory systems commonly retain or compress past observations. Robot control additionally requires interaction-derived state that no individual...
By Yuyou Zhang, Yunbei Zhang, Miao Li, Janet Wang, Zijian Jin, Shilong Liu, Ding Zhao
RMBench is a simulation benchmark featuring nine robotic manipulation tasks that vary in memory complexity, designed to systematically evaluate how well policies use memory. The authors also introduce Mem-0, a modular policy with explicit memory components that allows controlled ablation studies. Experiments in simulation and the real world reveal memory-related limitations in current policies and show how architectural choices affect memory performance.
By Tianxing Chen, Yuran Wang, Mingleyang Li, Yan Qin, Hao Shi, Zixuan Li, Yifan Hu, Yingsheng Zhang, Kaixuan Wang, Yue Chen, Hongcheng Wang, Junjie Wang, Tianhang Yang, Renjing Xu, Ruihai Wu, Yao Mu, Yaodong Yang, Hao Dong, Ping Luo
arXiv:2610.14406v1 Announce Type: cross
Abstract: It is widely appreciated that robotic policies require long-term memory to perform complex tasks. However, directly conditioning policies on all past...
By Yilin Wu, Rutav Shah, Shuaiyi Huang, Sumedh A. Sontakke, Homanga Bharadhwaj, Andrea Bajcsy, Max Simchowitz, Guanya Shi
arXiv:2608.29537v1 Announce Type: cross
Abstract: Frozen vision-language-action (VLA) policies offer broad manipulation skills but execute open-loop action chunks without tracking task progress, so t...
By Hongbo Gao, Zeyu Ni, Xin Wen, Siyu Xu, Ruifeng Li
arXiv:2609.32453v2 Announce Type: replace-cross
Abstract: Robotic manipulation is inherently history-dependent, yet most pretrained robotic policies condition on only the current observation or a sho...
By Xinyu Zhao, Yixiang Shan, Tao Yang, Runyu Lei, Yiming Zhao, Jiaxin Fan, Zongbao Feng, Peng Jia
The paper introduces Latent Transition Memory (LTM), a method that stores interaction history as compact latent transitions between consecutive observations for vision‑language‑action models. Implemented as LTM‑π on the π₀.₅ architecture, it uses a frozen latent action encoder, a lightweight adapter, and causal KV caching to enable incremental inference without external reasoning models or memory‑specific annotations. Experiments on RoboMME and LIBERO‑Mem show that LTM‑π achieves state‑of‑the‑art success rates (58.54% and 80.5% respectively), and scaling the dataset or applying a 200‑token memory budget still yields high performance, demonstrating the method’s scalability and efficiency in real‑world robotic tasks.
By Qixin Sun, WenLong Gao, Xiansheng Chen, Zhongyuan Wang, Si Liu, Pengwei Wang
arXiv:2610.23372v1 Announce Type: cross
Abstract: When we say that a robot uses memory, does that memory actually play a role? Success-rate ablations alone cannot establish the use of task-relevant f...
By Keyuan Luo, Yi Xie, Wanyun Ling, Yuanzhe Li, Ziyue Li, Zhuoqi Zeng
arXiv:2604. 18933v2 Announce Type: replace-cross Abstract: Robotic manipulation tasks exhibit varying memory requirements, ranging from Markovian tasks that require no memory to non-Markovian tasks that demand in-context memorization of historical information within a single trial or in-context adaptation based on the outcomes of multiple past trials.
By Yihuai Gao, Jeff Jinyun Liu, Shuang Li, Shuran Song
The paper introduces Divide-and-Remember (D&R), a recursive memory method for vision-language-action (VLA) policies that optimises memory by maximizing the conditional mutual information between actions and memory given observations. D&R recursively divides the full history into top‑K selections over 2K tokens, using a shared lightweight selector across all recursion blocks to handle unbounded histories efficiently. Evaluated on the RoboMME benchmark of 16 long‑horizon manipulation tasks, D&R achieves state‑of‑the‑art success rates with consistent gains across all suites while using only 64 tokens, and similar improvements are observed in real‑robot experiments.
By Xuehui Yu, Eason Yu, Meiyi Wang, Haozhe Du, Stefano V. Albrecht, Harold Soh
The paper introduces the workspace token, a lightweight latent memory representation for robotic manipulation that captures task-relevant historical information. By training with VLM queries only during training, the token can be queried efficiently at deployment, replacing full observations. Experiments in simulation and on hardware show that policies using the workspace token solve memory-intensive tasks without in‑loop VLM reasoning and even outperform heavier approaches.
By Nitish Dashora, Douglas Chen, Idan Shenfeld, John Marangola, Pulkit Agrawal, Max Simchowitz
arXiv:2607. 14252v1 Announce Type: cross Abstract: Long-horizon robot planning requires more than predicting what actions will do next; it also requires memory of the embodied experience that makes future goals interpretable.
By Zihao Yu, Xiu Yuan, Chongjie Zhang