LEARNING
DOP: Deep Optimistic Planning with Approximate Value Function Evaluation
Francesco Riccio, Roberto Capobianco, Daniele Nardi
- Year
- 2018
- Citations
- 4
Abstract
Research on reinforcement learning has demonstrated promising results in manifold applications and domains. Still, efficiently learning effective robot behaviors is very difficult, due to unstructured scenarios, high uncertainties, and large state dimensionality (e.g. multi-agent systems or hyper-redundant robots). To alleviate this problem, we present DOP, a deep model-based reinforcement learning algorithm, that attacks the curse of dimensionality and reduces the computational demand of the planning process while achieving good performance.
Keywords
Reinforcement learningComputer scienceMonte Carlo tree searchCurse of dimensionalityArtificial intelligenceRobotExploitState spaceBellman equationTask (project management)
Related papers
OTHER
📊 26,957 cites
Statistical Learning Theory
Yuhai Wu, Vladimir Vapnik
1999
PERCEPTION
📊 22,245 cites
Artificial intelligence: a modern approach
1995
OTHER
📊 18,993 cites
Applied Nonlinear Control
Jean-Jacques Slotine, Weiping Li
1991
SWARM
📊 14,853 cites
A new optimizer using particle swarm theory
R.C. Eberhart, James Kennedy
2002