Action-Gradient Monte Carlo Tree Search for Non-Parametric Continuous (PO)MDPs
📰 ArXiv cs.AI
arXiv:2503.12181v4 Announce Type: replace Abstract: Online planning in continuous state, action, and observation spaces remains challenging for autonomous systems. While Monte Carlo Tree Search (MCTS) scales effectively via sampling, most continuous (PO)MDP solvers do not exploit gradient-based action optimization. We propose Action-Gradient MCTS (AGMCTS), a framework that combines global tree search with local gradient-based action refinement, while maintaining consistent value estimates. We pr
DeepCamp AI