SOURCE-LINKED INTELLIGENCE

Online Robust Reinforcement Learning Through Monte-Carlo Planning

arXiv · AI, language, vision and robotics · article · Sep 16, 2026 · UTC

Monte Carlo Tree Search (MCTS) is a powerful framework for solving complex decision-making problems, yet it often relies on the assumption that the simulator and the real-world dynamics are identical. Although this assumption helps achieve the success of MCTS in games like Chess, Go, and Shogi, the real-world scenarios incur ambiguity due to their modeling mismatches in low-fidelity simulators. In this work, we present a new robust variant of MCTS that mitigates dynamical model ambiguities. Our algorithm addresses transition dynamics and reward distribution ambiguities to bridge the gap betwee

Read original source ↗ Open in workspace

recordType

paper

region

Global