AdaReP:Adaptive Re-Planning under Model Mismatch for Neural World-Model Predictive Control
TLDR
AdaReP adaptively adjusts replanning tolerance in neural world-model MPC, reducing computation by over 80% on real-world robots without modifying the model.
Reasoning
The paper presents a practical, training-free method to reduce computational overhead in world-model-based MPC by dynamically adjusting replanning frequency based on prediction mismatch and local dynamics sensitivity. Strengths include real-world robotic validation and significant query reduction; weaknesses are limited discussion of failure cases or comparison to other adaptive methods.
Read-first score
Read-first score 50.1, weighted from topical fit, citation, graph, method, reproducibility, and recency signals. Original total remains 36.
Field roles
Rank sensitivity
Stability: volatile; rank range: 459.
Keyword Scores
Deep Analysis
Innovations
- Perturbation-based dynamic-regret framework analyzing the trade-off between replanning overhead and plan reuse under model mismatch
- AdaReP: a training-free wrapper that adapts replanning tolerance online using current deviation from cached rollout and local sensitivity estimate
- No modification to the learned world model or planner required
Methodology
AdaReP is a training-free wrapper that adapts the replanning tolerance online by computing the current deviation from the cached rollout and a local sensitivity estimate of the dynamics. It is evaluated across three settings: image-space planning, latent-space control, and real-world robotic manipulation, using a perturbation-based dynamic-regret framework to motivate the adaptive strategy.
Key Results
AdaReP substantially reduces planner-side computation while maintaining comparable task performance, including over 80% fewer queries on a 50-trial physical robot study.