Q学習における報酬関数の比較:台車位置問題への応用
A Comparison of Reward Functions in Q-Learning Applied to a Cart Position Problem
台車位置制御問題において3種類の報酬関数をQ学習で比較し、目標位置から一定距離内にいるときのみ報酬を与える不連続な報酬関数が最も良い結果となることを示した。
分類: cs.LG, cs.AI, cs.RO, math.OC
原文アブストラクト
Growing advancements in reinforcement learning has led to advancements in control theory. Reinforcement learning has effectively solved the inverted pendulum problem and more recently the double inverted pendulum problem. In reinforcement learning, our agents learn by interacting with the control system with the goal of maximizing rewards. In this paper, we explore three such reward functions in the cart position problem. This paper concludes that a discontinuous reward function that gives non-zero rewards to agents only if they are within a given distance from the desired position gives the best results.
