Sampling-based Kinodynamic Planning with World Models
TLDR
This paper integrates kinodynamic sampling-based planning with visual world models, using latent-space RRT/KPIECE to outperform CEM/MPPI in long-horizon tasks.
Reasoning
The paper addresses a clear limitation of optimizer-based planning with world models and proposes GPU-native sampling-based alternatives, with experiments in simulation and on a real robot. The main weakness visible from the abstract is the narrow evaluation setting and limited comparison to other planning baselines.
Read-first score
Read-first score 33.6, weighted from topical fit, citation, graph, method, reproducibility, and recency signals. Original total remains 44.
Field roles
Rank sensitivity
Stability: volatile; rank range: 337.
Keyword Scores
Deep Analysis
Innovations
- Revisits kinodynamic sampling-based motion planning for visual world models by using the learned model as the propagator of a tree search in latent space.
- Shows that sampling strategies from high-dimensional configuration-space planning apply directly to world-model latent spaces, enabling expansion through intermediate states that myopic optimizers miss.
- Introduces two latent-space exploration strategies: nearest-neighbor-guided RRT and projection-based KPIECE.
- Uses GPU-native batched expansion for efficient device utilization during planning.
Methodology
The method uses an off-the-shelf DINO-WM visual world model as the propagator for sampling-based tree search in latent space. It adapts kinodynamic planning strategies, specifically nearest-neighbor-guided RRT and projection-based KPIECE, with GPU-native batched expansion. Evaluation compares against CEM and MPPI on four simulated domains and a real-world block-pushing task using success rate and planning time.
Key Results
The proposed approaches match or exceed the success rate of CEM and MPPI at up to 13.8x lower planning time in simulation, and improve success rate by 20% on a real robot block-pushing task.