Memory, Benchmark & Robots: A Benchmark for Solving Complex Tasks with Reinforcement Learning

Egor Cherepanov, Nikita Kachaev, Alexey K. Kovalev, Aleksandr I. Panov
2/14/2025
cs.LGcs.AIcs.RO

No official code found. Best implementation: CognitiveAISystems/MIKASA-Robo (140 stars, MIT, last commit 2026-04-14).

Abstract

Memory is crucial for enabling agents to tackle complex tasks with temporal and spatial dependencies. While many reinforcement learning (RL) algorithms incorporate memory, the field lacks a universal benchmark to assess an agent's memory capabilities across diverse scenarios. This gap is particularly evident in tabletop robotic manipulation, where memory is essential for solving tasks with partial observability and ensuring robust performance, yet no standardized benchmarks exist. To address this, we introduce MIKASA (Memory-Intensive Skills Assessment Suite for Agents), a comprehensive benchmark for memory RL, with three key contributions: (1) we propose a comprehensive classification framework for memory-intensive RL tasks, (2) we collect MIKASA-Base -- a unified benchmark that enables systematic evaluation of memory-enhanced agents across diverse scenarios, and (3) we develop MIKASA-Robo (pip install mikasa-robo-suite) -- a novel benchmark of 32 carefully designed memory-intensive tasks that assess memory capabilities in tabletop robotic manipulation. Our work introduces a unified framework to advance memory RL research, enabling more robust systems for real-world use. MIKASA is available at https://tinyurl.com/membenchrobots.

View on arXivView PDF

Code Implementations(1)

MIT

🔥 [ICLR 2026] Benchmark for robotic tabletop manipulation memory-intensive tasks

14017Shell, PythonFeb 19, 20256 months agoMIT
benchmarkmaniskillmemorypomdppython+2 more

Similar Papers

Cite this paper

@article{cherepanov2025memory,
  title  = {Memory, Benchmark & Robots: A Benchmark for Solving Complex Tasks with Reinforcement Learning},
  author = {Egor Cherepanov and Nikita Kachaev and Alexey K. Kovalev and Aleksandr I. Panov},
  year   = {2025},
  eprint = {2502.10550},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2502.10550v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2502.10550.svg)](https://codeofpaper.com/paper/2502.10550)

Discussion