Home /Research /DOP: Deep Optimistic Planning with Approximate Value Function Evaluation
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

Browse all LEARNING papers