強化学習における線形計画法を用いた効率的解法

DOI HANDLE Web Site Web Site 参考文献8件 オープンアクセス

書誌事項

タイトル別名
  • Efficient Algorithms for Reinforcement Learning by Linear Programming
  • キョウカ ガクシュウ ニ オケル センケイ ケイカクホウ オ モチイタ コウリツテキカイホウ

この論文をさがす

抄録

Model-based reinforcement learning includes two steps, estimation of a plant and planning. Planning is formulated as dynamic programming (DP) problem, which is solved by a DP method. This DP problem has an equivalent linear programming (LP) problem that can be solved by LP method, but it is generally less efficient than typical DP method. However, numerical examples show linear programming is more efficient than the typical DP method in problems whose self-transition probabilities are large. The reason is clarified by geometrical discussion of each solution of method approaches to optimal solution.

収録刊行物

参考文献 (8)*注記

もっと見る

関連プロジェクト

もっと見る

詳細情報 詳細情報について

問題の指摘

ページトップへ