We present 3D-Anchored Lookahead Planning (3D-ALP), a System 2 reasoning engine for robotic manipulation that combines Monte Carlo Tree Search (MCTS) with a 3D-consistent world model as the rollout oracle. Unlike reactive policies that evaluate actions from the current camera frame only, 3D-ALP maintains a persistent camera-to-world (c2w) anchor that survives occlusion, enabling accurate replanning to object positions that are no longer directly observable. On a 5-step sequential reach task requiring spatial memory (Experiment E3), 3D-ALP achieves 0.650 0.109 success rate on memory-required steps versus 0.006 0.008 for a greedy reactive baseline (Δ=+0.645), while step 5 success reaches 0.822 against 0.000 for greedy. An ablation study (30 episodes, 3 seeds) isolates tree search spatial memory as the primary driver (+0.533, 82% of gain) with additional benefit from deeper lookahead (+0.111, 17%). We also identify and resolve four structural failure modes in applying UCT-MCTS (Upper Confidence Bounds applied to Trees [10]) to continuous robotic manipulation.
Figures & tables
Figure 1: 3D-ALP overview. Left: The memory gap between reactive policies and 3D-ALP on occluded-object tasks. Greedy reactive agents collapse to 0.6% SR; 3D-ALP’s persistent SE(3) anchor enables 82.2% SR on the hardest chained-memory step. Right: The 3D-ALP architecture: a persistent SE(3) spatial anchor updated via FK, a world-model-based MCTS tree that imagines future frames, and a hybrid geometric-semantic scorer that corrects VLM depth blindness. The line chart confirms the performance gap is concentrated on memory-required steps 4–5, where the greedy baseline collapses to zero.
Variant
Non-Mem SR
Memory SR
Δ
Step 5
Greedy
0.748±0.029
0.006±0.008
—
0.000
MCTS D=1
0.389±0.024
0.539±0.064
+0.533
0.622
3D-ALP D=2
0.463±0.064
0.650±0.109
+0.645
0.822
Table 1: Ablation study: 30 episodes × 3 seeds (mean ± std). Non-Mem SR = steps 1–3; Memory SR = steps 4–5. Δ is vs. greedy. Bold = best.
Figure 2: 3D-ALP qualitative results. Top row: MCTS planning tree at steps 1, 3, and 5 ( ★ ). Each node is a candidate c2w pose; colour encodes Q-value (blue=low, teal=high); edge width = visit count; gold border = selected action. At step 5 ( ★ ), the planner navigates to a position that is no longer visible in the current frame — the c2w anchor retains its coordinates in the persistent tree. Bottom left: 3D EE trajectory; ★ = memory steps 4–5; red crosses = target positions (occluded at steps 4–5). Bottom right: Per-step SR; gold shading = memory-required steps where greedy collapses to zero while 3D-ALP maintains 60–83% SR via persistent 3D spatial memory.
Mainstream robotic policies often adopt a Markovian formulation, but many complex real-world manipulation tasks are inherently non-Markovian, requiring long-horizon memory beyond the current observation. Existing memory mechanisms often rely on language summaries, growing visual windows, or their combinations, and may therefore lose fine-grained visual evidence or face a trade-off between history coverage and execution efficiency. We introduce MaP-WAM, a Memory-as-Plans framework that decomposes memory-dependent world-action modeling into memory-grounded planning and plan-conditioned execution, and uses long-term multimodal episodic context as planning-time evidence rather than repeatedly conditioning the executor on the full history. MaP-WAM represents memory as completed segment records containing language instructions and sparse visual context, and converts this episodic memory into compact plans comprising the next segment-level language plan and corresponding visual guidance. A World-Action-Progress (WAP) model executes each plan over an unknown duration by jointly predicting action chunks and corresponding execution progress at inference time, calibrating predicted progress through plan-observation alignment for adaptive segment transitions and closed-loop context updates. MaP-WAM keeps the executor context length fixed, while structured attention further enables key-value caching in both planning and execution. MaP-WAM achieves state-of-the-art performance on RMBench with an 83.3% success rate and attains 78.0% success on real-robot tasks, while maintaining approximately constant executor inference latency as task history grows.
Sizhe Zhao, Haozhe Xie, Weiyu Zhao +5
Harbin Institute of Technology, China · Nanyang Technological University, Singapore · Shandong University, China +1
Long-horizon robotic manipulation fundamentally relies on persistent spatial memory. However, existing 3D memory systems function merely as passive recorders: they store observations using fixed, hand-crafted rules, treating every scene element--whether a critical grasp target or an irrelevant background wall--with equal importance. In this paper, we propose a paradigm shift from passive storage to active, task-driven spatial memory. We argue that a robot's memory should not simply record what it sees, but actively learn how to remember--discovering which objects to track precisely, how aggressively to update them, and what to discard, all learned end-to-end without hand-designed rules. Crucially, this active paradigm is realized by unifying memory update and readout as two sides of the same cognitive process, enabling bidirectional flow where task needs shape update strategies and vice versa. To instantiate this vision, we introduce GaussMemory, which leverages 3D Gaussian Splatting as a persistent geometric substrate. On LIBERO, GaussMemory outperforms MemoryVLA on Goal and Long-10; on VLABench, it surpasses π0-FAST by +5.2% (Track 1) and +6.0% (Track 6).
Zhiqiang Hu, Shouren Huang, Masatoshi Ishikawa
Research Institute for Science & Technology, Tokyo University of Science
Enabling reliable long-horizon robotic manipulation is a crucial step toward open-world embodied intelligence. However, VLM-based planners treat each step as an isolated observation-to-action mapping, forcing them to reinfer scene geometry from raw pixels at every decision point while remaining unaware of how prior actions have reshaped the environment. Despite strong short-horizon performance, these systems lack the spatio-temporal reasoning required for persistent geometric anchoring and memory of action-triggered state transitions. Without persistent state tracking, perceptual errors accumulate across the execution horizon, temporarily occluded objects are catastrophically forgotten, and these compounding failures lead to precondition violations that cascade through subsequent steps. In contrast, humans maintain a persistent mental model that continuously tracks spatial relations and action consequences across interactions rather than reconstructing them at each instant. Inspired by this human capacity for causal spatio-temporal reasoning with persistent memory, we propose RoboStream, a training-free framework that achieves geometric anchoring through Spatio-Temporal Fusion Tokens (STF-Tokens), which bind visual evidence to 3D geometric attributes for persistent object grounding, and maintains causal continuity via a Causal Spatio-Temporal Graph (CSTG) that records action-triggered state transitions across steps. This design enables the planner to trace causal chains and preserve object permanence under occlusion without additional training or fine-tuning. RoboStream achieves 90.5% on long-horizon RLBench and 44.4% on challenging real-world block-building tasks, where both SoFar and VoxPoser score 11.1%, demonstrating that spatio-temporal reasoning and causal memory are critical missing components for reliable long-horizon manipulation.
Yuzhi Huang, Jie Wu, Weijue Bu +9
Shenzhen International Graduate School, Tsinghua University · YuanxingGuangnian Robotics · China University of Mining and Technology +3