2019 · 13 citations · 19 references
ComputingComputer ScienceAlgorithmsMachine LearningMarkov Decision ProcessesComputational ModelingMarkov Chain Monte CarloMonte Carlo MethodsMonte Carlo SimulationReinforcement LearningReinforcement Learning FoundationsAbstractionBenchmark DatasetsComputational EfficiencyComputational Efficiency AnalysisExpansionMonte Carlo Tree Search
We propose an approach to general subgoal-based temporal abstraction in MCTS. Our approach approximates a set of available macro-actions locally for each state only requiring a generative model and a subgoal predicate. For that, we modify the expansion step of MCTS to automatically discover and optimize macro-actions that lead to subgoals. We empirically evaluate the effectiveness, computational efficiency and robustness of our approach w.r.t. different parameter settings in two benchmark domains and compare the results to standard MCTS without temporal abstraction.
19
Reinforcement Learning: An Introduction
IEEE Transactions on Neural Networks · 2005 · 25.8K citations
Artificial intelligence: A modern approach
Nils J. Nilsson · Artificial Intelligence · 1996 · 10.7K citations
Mastering the game of Go without human knowledge
David Silver, Julian Schrittwieser, Karen Simonyan et al. · Nature · 2017 · 9.2K citations
Engineering, Educational Psychology, Cognitive Psychology +7
Reinforcement Learning: An Introduction
Jeffrey D. Johnson, Jinghong Li, Zengshi Chen · Neurocomputing · 2000 · 8.7K citations