.png){kind=icon}
返回
Constrained dynamic programming with two discount factors: Applications and an algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/9.751365.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider a discrete time Markov Decision Process, where the objectives are linear combinations of standard discounted rewards, each with a different discount factor, We describe several applications that motivate the recent interest in these criteria, For the special case where a standard discounted cost is to be minimized, subject to a constraint on another standard discounted cast but with a different discount factor, we provide an implementable algorithm for computing an optimal policy.
Keyword:
algorithm
application
discounting
dynamic programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
暂无机构信息
.png){kind=icon}
没有更多内容