Monte Carlo Tree Search in Continuous Spaces Using Voronoi Optimistic Optimization with Regret Bounds
- Authors
- Kim, B.; Lee, K.; Lim, S.; Kaelbling, L.P.; Lozano-Ṕerez, T.
- Issue Date
- Apr-2020
- Publisher
- AAAI press
- Citation
- AAAI 2020 - 34th AAAI Conference on Artificial Intelligence, v.34, no.06, pp 9916 - 9924
- Pages
- 9
- Journal Title
- AAAI 2020 - 34th AAAI Conference on Artificial Intelligence
- Volume
- 34
- Number
- 06
- Start Page
- 9916
- End Page
- 9924
- URI
- https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/59365
- DOI
- 10.1609/aaai.v34i06.6546
- ISSN
- 0000-0000
- Abstract
- 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 highdimensional 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Software > Department of Artificial Intelligence > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.