Literature DB >> 20116208

Online learning of shaping rewards in reinforcement learning.

Marek Grześ1, Daniel Kudenko.   

Abstract

Potential-based reward shaping has been shown to be a powerful method to improve the convergence rate of reinforcement learning agents. It is a flexible technique to incorporate background knowledge into temporal-difference learning in a principled way. However, the question remains of how to compute the potential function which is used to shape the reward that is given to the learning agent. In this paper, we show how, in the absence of knowledge to define the potential function manually, this function can be learned online in parallel with the actual reinforcement learning process. Two cases are considered. The first solution which is based on the multi-grid discretisation is designed for model-free reinforcement learning. In the second case, the approach for the prototypical model-based R-max algorithm is proposed. It learns the potential function using the free space assumption about the transitions in the environment. Two novel algorithms are presented and evaluated. 2010 Elsevier Ltd. All rights reserved.

Mesh:

Year:  2010        PMID: 20116208     DOI: 10.1016/j.neunet.2010.01.001

Source DB:  PubMed          Journal:  Neural Netw        ISSN: 0893-6080


  1 in total

1.  Route searching based on neural networks and heuristic reinforcement learning.

Authors:  Fengyun Zhang; Shukai Duan; Lidan Wang
Journal:  Cogn Neurodyn       Date:  2017-02-09       Impact factor: 5.082

  1 in total

北京卡尤迪生物科技股份有限公司 © 2022-2023.