Guiding Search with Generalized Policies for Probabilistic Planning
Date
2019
Authors
Shen, William
W. Trevizan, Felipe
Toyer, Sam
Thiebaux, Sylvie
Xie, Lexing
Journal Title
Journal ISSN
Volume Title
Publisher
AAAI Press
Abstract
We examine techniques for combining generalized policies with search algorithms to exploit the strengths and overcome the weaknesses of each when solving probabilistic planning problems. The Action Schema Network (ASNet) is a recent contribution to planning that uses deep learning and neural networks to learn generalized policies for probabilistic planning problems. ASNets are well suited to problems where local knowledge of the environment can be exploited to improve performance, but may fail to generalize to problems they were not trained on. Monte-Carlo Tree Search (MCTS) is a forward-chaining state space search algorithm for optimal decision making which performs simulations to incrementally build a search tree and estimate the values of each state. Although MCTS can achieve state-of-the-art results when paired with domain-specific knowledge, without this knowledge, MCTS requires a large number of simulations in order to obtain reliable state-value estimates. By combining AS-Nets with MCTS, we are able to improve the capability of an ASNet to generalize beyond the distribution of problems it was trained on, as well as enhance the navigation of the search space by MCTS.
Description
Keywords
Citation
Collections
Source
Proceedings of the 12th International Symposium on Combinatorial Search, SoCS 2019
Type
Conference paper
Book Title
Entity type
Access Statement
Free Access via publisher website
License Rights
DOI
Restricted until
2099-12-31
Downloads
File
Description