蒙特卡洛树搜索:近期修改与应用综述
Monte Carlo Tree Search: A Review of Recent Modifications and Applications
AI总结:
本文综述了2012年以来蒙特卡洛树搜索(MCTS)在复杂博弈及实际应用领域中的特定问题修改与混合方法。
摘要:
蒙特卡洛树搜索(MCTS)是设计博弈机器人或解决序列决策问题的强大方法。该方法依赖平衡探索与利用的智能树搜索。MCTS以模拟形式进行随机采样,并存储动作统计信息,以便在每次后续迭代中做出更明智的选择。该方法已成为组合博弈的最先进技术,然而在更复杂的博弈(如高分支因子或实时博弈)以及各种实际领域(如交通、调度或安全)中,高效的MCTS应用通常需要其依赖问题的修改或与其他技术集成。此类特定领域的修改和混合方法是本综述的主要焦点。上一个主要的MCTS综述发表于2012年。自其发布以来出现的贡献是本综述特别关注的内容。
英文摘要:
Monte Carlo Tree Search (MCTS) is a powerful approach to designing game-playing bots or solving sequential decision problems. The method relies on intelligent tree search that balances exploration and exploitation. MCTS performs random sampling in the form of simulations and stores statistics of actions to make more educated choices in each subsequent iteration. The method has become a state-of-the-art technique for combinatorial games, however, in more complex games (e.g. those with high branching factor or real-time ones), as well as in various practical domains (e.g. transportation, scheduling or security) an efficient MCTS application often requires its problem-dependent modification or integration with other techniques. Such domain-specific modifications and hybrid approaches are the main focus of this survey. The last major MCTS survey has been published in 2012. Contributions that appeared since its release are of particular interest for this review.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。