FIELD NOTES TOPIC
monte carlo tree search (mcts)
1 note, newest first.
Graph Sparse Sampling: Breaking the Curse of the Horizon in Continuous MDP Planning
Researchers have proposed a new planning algorithm called Graph Sparse Sampling (GSS). This algorithm is designed to help autonomous systems plan under uncertainty in continuous domains, which can be computationally…
