Single-Agent Policy Tree Search With Guarantees
ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 31 (NIPS 2018), pp. 3201-3211, 2018.
We introduced two novel tree search algorithms for single-agent problems that are guided by a policy: Levin tree search and LubyTS
We introduce two novel tree search algorithms that use a policy to guide search. The first algorithm is a best-first enumeration that uses a cost function that allows us to prove an upper bound on the number of nodes to be expanded before reaching a goal state. We show that this best-first algorithm is particularly well suited for "needle...More
PPT (Upload PPT)