Markov Decision Processes: Discrete Stochastic Dynamic Programming.

动态规划 马尔可夫决策过程 计算机科学 马尔可夫链 数学优化 数学 马尔可夫过程 机器学习 统计
作者
Kasra Hazeghi,Martin L. Puterman
出处
期刊: 卷期号:90 (429): 392-392 被引量:8885
标识
DOI:10.2307/2291177
摘要

From the Publisher: The past decade has seen considerable theoretical and applied research on Markov decision processes, as well as the growing use of these models in ecology, economics, communications engineering, and other fields where outcomes are uncertain and sequential decision-making processes are needed. A timely response to this increased activity, Martin L. Puterman's new work provides a uniquely up-to-date, unified, and rigorous treatment of the theoretical, computational, and applied research on Markov decision process models. It discusses all major research directions in the field, highlights many significant applications of Markov decision processes models, and explores numerous important topics that have previously been neglected or given cursory coverage in the literature. Markov Decision Processes focuses primarily on infinite horizon discrete time models and models with discrete time spaces while also examining models with arbitrary state spaces, finite horizon models, and continuous-time discrete state models. The book is organized around optimality criteria, using a common framework centered on the optimality (Bellman) equation for presenting results. The results are presented in a theorem-proof format and elaborated on through both discussion and examples, including results that are not available in any other book. A two-state Markov decision process model, presented in Chapter 3, is analyzed repeatedly throughout the book and demonstrates many results and algorithms. Markov Decision Processes covers recent research advances in such areas as countable state space models with average reward criterion, constrained models, and models with risk sensitive optimality criteria. It also explores several topics that have received little or no attention in other books, including modified policy iteration, multichain models with average reward criterion, and sensitive optimality. In addition, a Bibliographic Remarks section in each chapter comments on relevant historic

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
华仔应助自由的中蓝采纳,获得10
1秒前
xiaohululu发布了新的文献求助100
1秒前
2秒前
superzz完成签到,获得积分10
2秒前
莫66发布了新的文献求助10
2秒前
2秒前
NexusExplorer应助能干千凡采纳,获得10
2秒前
wanci应助HaorenQ采纳,获得10
2秒前
有魅力的超短裙完成签到,获得积分10
2秒前
3秒前
安安完成签到,获得积分10
3秒前
3秒前
3秒前
zero1122完成签到 ,获得积分10
4秒前
CC完成签到,获得积分10
4秒前
4秒前
坦率抽屉完成签到 ,获得积分10
4秒前
4秒前
擦菜子煮豆腐完成签到,获得积分10
5秒前
Akim应助tom采纳,获得10
5秒前
Dokey发布了新的文献求助10
5秒前
Carpenter发布了新的文献求助10
6秒前
6秒前
6秒前
chenLei发布了新的文献求助10
7秒前
8秒前
彭于晏应助元谷雪采纳,获得10
8秒前
9秒前
10秒前
11秒前
cc完成签到,获得积分10
11秒前
liyi发布了新的文献求助10
12秒前
12秒前
13秒前
sxd20103316发布了新的文献求助10
13秒前
豫安远发布了新的文献求助10
13秒前
iamcrazyboy完成签到,获得积分10
14秒前
muke完成签到,获得积分10
15秒前
鱼鱼鱼完成签到,获得积分10
15秒前
小狗完成签到,获得积分10
15秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Principles of town planning: translating concepts to applications 1000
Management and the Arts 510
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
The Effective Clinical Neurologist 3ed 500
The Great Hymn to Šamaš 500
Moody's Ratings Rising AI spending narrows the gap, but US hyperscalers retain edge over Chinese peers 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7695603
求助须知:如何正确求助?哪些是违规求助? 9256102
关于积分的说明 20000825
捐赠科研通 7270082
什么是DOI,文献DOI怎么找? 3292521
关于科研通互助平台的介绍 2448209
邀请新用户注册赠送积分活动 2298160