paper-with-me

홈 › Papers

WorldPlanner: Monte Carlo Tree Search and MPC with Action-Conditioned Visual World Models

2025-11-04 · R. Khorrambakht, Joaquim Ortiz-Haro, Joseph Amigo, Omar Mostafa, Daniel Dugas, Franziska Meier, Ludovic Righetti arxiv

Robots must understand their environment from raw sensory inputs and reason about the consequences of their actions in it to solve complex tasks. Behavior Cloning (BC) leverages task-specific human demonstrations to learn this knowledge as end-to-end policies. However, these policies are difficult to transfer to new tasks, and generating training data is challenging because it requires careful demonstrations and frequent environment resets. In contrast to such policy-based view, in this paper we take a model-based approach where we collect a few hours of unstructured easy-to-collect play data to learn an action-conditioned visual world model, a diffusion-based action sampler, and optionally a reward model. The world model -- in combination with the action sampler and a reward model -- is then used to optimize long sequences of actions with a Monte Carlo Tree Search (MCTS) planner. The resulting plans are executed on the robot via a zeroth-order Model Predictive Controller (MPC). We show that the action sampler mitigates hallucinations of the world model during planning and validate our approach on 3 real-world robotic tasks with varying levels of planning and modeling complexity. Our experiments support the hypothesis that planning leads to a significant improvement over BC baselines on a standard manipulation test environment.

📄 PDF Abstract BibTeX arXiv:2511.03077

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Monte Carlo Search Algorithms Discovering Monte Carlo Tree Search Exploration Terms

2024-04-14 · Tristan Cazenave

Monte Carlo Tree Search and Monte Carlo Search have good results for many combinatorial problems. In this paper we propose to use Monte Carlo Search to design mathematical expressions that are used as exploration terms f…

Is Monte Carlo Tree Search Just Every-Visit Monte Carlo Control?

2026-08-28 · Xianyi Wu arxiv

Monte Carlo Tree Search (MCTS) and every-visit Monte Carlo (MC) control are usually presented as different methods. MCTS is described in the language of search (selection, expansion, simulation, and backup), whereas MC c…

Reinforcement Learning

Bayesian Optimized Monte Carlo Planning

2020-10-07 · John Mern, Anil Yildiz, Zachary Sunberg, Tapan Mukerji 외

Online solvers for partially observable Markov decision processes have difficulty scaling to problems with large action spaces. Monte Carlo tree search with progressive widening attempts to improve scaling by sampling fr…

Bayesian Optimization

Monte Carlo Action Programming

2017-02-25 · Lenz Belzner

This paper proposes Monte Carlo Action Programming, a programming language framework for autonomous systems that act in large probabilistic state spaces with high branching factors. It comprises formal syntax and semanti…

Measurable Monte Carlo Search Error Bounds

2021-06-08 · John Mern, Mykel J. Kochenderfer

Monte Carlo planners can often return sub-optimal actions, even if they are guaranteed to converge in the limit of infinite samples. Known asymptotic regret bounds do not provide any way to measure confidence of a recomm…