2 papers
cs.AI2026
Action-Gradient Monte Carlo Tree Search for Non-Parametric Continuous (PO)MDPs
Idan Lev-Yehudi, Michael Novitsky, Moran Barenboim +2
Online planning in continuous state, action, and observation spaces remains challenging for autonomous systems. While Monte Carlo Tree Search (MCTS) scales effectively via sampling…
cs.AI2024
Previous Knowledge Utilization In Online Anytime Belief Space Planning
Michael Novitsky, Moran Barenboim, Vadim Indelman
Online planning under uncertainty remains a critical challenge in robotics and autonomous systems. While tree search techniques are commonly employed to construct partial future tr…