.png){kind=icon}
返回
An Approximate Quadratic Programming for Efficient Bellman Equation Solution
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2019.2939161.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper proposes an efficient algorithm which relies on quadratic programming for approximately solving the Bellman equation in reinforcement learning problem and guarantees to return optimal decision parameters. Through further applying universal approximation and fixed cardinality minimization techniques, the proposed algorithm in one hand expands the representation ability of basic linear value functions, on the other hand, it guarantees the convergence of the Bellman error. Experimental results on two canonical reinforcement learning scenarios demonstrate that the proposed algorithm achieves similar or better performance than the state-of-the-art algorithms, while reduces the computation time significantly and improves the robustness of the algorithm against state uncertainty.
Keyword:
Markov decision processes
approximate quadratic programming
Bellman equation solutions
universal approximation
fixed cardinality
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
暂无机构信息
引用论文
Real-time and offline techniques for identifying obstructive sleep apnea patients用于识别阻塞性睡眠呼吸暂停患者的实时和离线技术
.png){kind=icon}
PREAI
分享收藏分享收藏Reinforcement-Learning-Based Robust Controller Design for Continuous-Time Uncertain Nonlinear Systems Subject to Input Constraints基于强化学习的具有输入约束的连续时间不确定非线性系统的鲁棒控制器设计
PREAI
分享收藏
查看更多内容