Monte Carlo Tree Search in Continuous Spaces Using Voronoi Optimistic Optimization with Regret Bounds

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 18
  • Download : 0
Many important applications, including robotics, data-center management, and process control, require planning action sequences in domains with continuous state and action spaces and discontinuous objective functions. Monte Carlo tree search (MCTS) is an effective strategy for planning in discrete action spaces. We provide a novel MCTS algorithm (voot) for deterministic environments with continuous action spaces, which, in turn, is based on a novel black-box function-optimization algorithm (voo) to efficiently sample actions. The voo algorithm uses Voronoi partitioning to guide sampling, and is particularly efficient in high-dimensional spaces. The voot algorithm has an instance of voo at each node in the tree. We provide regret bounds for both algorithms and demonstrate their empirical effectiveness in several high-dimensional problems including two difficult robotics planning problems.
Publisher
Association for the Advancement of Artificial Intelligence (AAAI)
Issue Date
2020-02
Language
English
Citation

The Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI-20), pp.9916 - 9924

DOI
10.1609/aaai.v34i06.6546
URI
http://hdl.handle.net/10203/280568
Appears in Collection
RIMS Conference Papers
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0