An Optimal Computing Budget Allocation Tree Policy for Monte Carlo Tree Search

DOI10.1109/TAC.2021.3088792MaRDI QIDQ5092175zbMATH OpenOpenAlexFDO

Authors Yunchuan Li, Michael C. Fu, Jie Xu

Publication date 28 July 2022

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2009.12407

Mathematics Subject Classification ID

Systems theory; control (93-XX)

Cited in

(5)

• Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
• Convergence rate analysis for optimal computing budget allocation algorithms
• Simulation budget allocation for improving scheduling and routing of automated guided vehicles in warehouse management
• Dynamic pharmaceutical product portfolio management with flexible resource profiles
• Ranking and selection with two-stage decision

This page was built for publication: An Optimal Computing Budget Allocation Tree Policy for Monte Carlo Tree Search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092175)