Monte Carlo Tree Search in Continuous Spaces Using Voronoi Optimistic Optimization with Regret Bounds - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Beomjoon Kim, Kyungjae Lee, Sungbin Lim, Leslie Pack Kaelbling, Tomás Lozano-Pérez. Monte Carlo Tree Search in Continuous Spaces Using Voronoi Optimistic Optimization with Regret Bounds. In The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, The Thirty-Second Innovative Applications of Artificial Intelligence Conference, IAAI 2020, The Tenth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2020, New York, NY, USA, February 7-12, 2020. pages 9916-9924, AAAI Press, 2020. [doi]

This author has not been identified. Look up 'Beomjoon Kim' in GoogleThis author has not been identified. Look up 'Kyungjae Lee' in GoogleThis author has not been identified. Look up 'Sungbin Lim' in GoogleThis author has not been identified. Look up 'Leslie Pack Kaelbling' in GoogleThis author has not been identified. Look up 'Tomás Lozano-Pérez' in Google

runs on WebDSL