基于符号建议的MDP蒙特卡罗树搜索
Monte Carlo Tree Search guided by Symbolic Advice for MDPs
摘要:
在本文中,我们考虑在线计算的策略,旨在优化的期望平均回报的马尔可夫决策过程。该策略是用滚动时域和蒙特卡罗树搜索(MCTS)计算的。我们增加了MCTS算法的概念,象征性的意见,并表明其经典的理论保证。符号化建议被用于偏置MCTS的选择和仿真策略。我们描述了如何使用QBF和SAT求解器来实现一个有效的方式象征性的意见。我们说明了我们的新算法使用流行的游戏吃豆人,并表明我们的算法的性能超过那些平原MCTS以及人类玩家的性能。
英文摘要:
In this paper, we consider the online computation of a strategy that aims at optimizing the expected average reward in a Markov decision process. The strategy is computed with a receding horizon and using Monte Carlo tree search (MCTS). We augment the MCTS algorithm with the notion of symbolic advice, and show that its classical theoretical guarantees are maintained. Symbolic advice are used to bias the selection and simulation strategies of MCTS. We describe how to use QBF and SAT solvers to implement symbolic advice in an efficient way. We illustrate our new algorithm using the popular game Pac-Man and show that the performances of our algorithm exceed those of plain MCTS as well as the performances of human players.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。