arrow
返回

Stochastic dynamic programming with factored representations

delete2000-08-01
delete221
delete
OA
AI
C
Craig Boutilier
R
Richard Dearden
M
Moisés Goldszmidt
DOI:10.1016/S0004-3702(00)00033-3delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Markov decision processes (MDPs) have proven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, state-based specifications and computations. To alleviate the combinatorial problems associated with such methods, we propose new representational and computational techniques for MDPs that exploit certain types of problem structure. We use dynamic Bayesian networks (with decision trees representing the local families of conditional probability distributions) to represent stochastic actions in an MDP, together with a decision-tree representation rewards. Based on this representation, we develop versions of standard dynamic programming algorithms that directly manipulate decision-tree representations of policies and value functions. This generally obviates the need for state-by-state computation, aggregating states at the leaves of these trees and requiring computations only for each aggregate state. The key to these algorithms is a decision-theoretic generalization of classic regression analysis, in which we determine the features relevant to predicting expected value. We demonstrate the method empirically on several planning problems, showing significant savings for certain types of domains. We also identify certain classes of problems for which this technique fails to perform well and suggest extensions and related ideas that may prove useful in such circumstances. We also briefly describe an approximation scheme based on this approach. (C) 2000 Elsevier Science B.V. All rights reserved.
Keyword:
decision-theoretic planning
Markov decision processes
Bayesian networks
regression
decision trees
abstraction
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Artificial Intelligence Review 封面图
Artificial Intelligence Review
IF:
13.9
论文数:
6.1K
被引数:
1.9W

机构

暂无机构信息
引用论文

引用论文

Complexity of D″ in the presence of slab‐debris and phase changes
err2006-03-04
err0
errOAAI
errDaoyuan Sun; Teh‐Ru Alex Song; Don Helmberger
err分享
err收藏
err分享
err收藏
err分享
err收藏
TRIPPD: A Practice-Based Network Effectiveness Study of Postpartum Depression Screening and Management
err2012-07-09
err0
errOAAI
errB. P. Yawn; A. J. Dietrich; P. Wollan; S. Bertram; D. Graham; J. Huff; M. Kurland; S. Madison; W. D. Pace
err分享
err收藏
学者 查看更多内容