.png){kind=icon}
返回
Efficient approximate linear programming for factored MDPs
.png){kind=icon}
OA
AI
DOI：10.1016/j.ijar.2015.06.002.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Factored Markov Decision Processes (MDPs) provide a compact representation for modeling sequential decision making problems with many variables. Approximate linear programming (LP) is a prominent method for solving factored MDPs. However, it cannot be applied to models with large treewidth due to the exponential number of constraints. This paper proposes a novel and efficient approximate method to represent the exponentially many constraints. We construct an augmented junction graph from the factored MDP, and represent the constraints using a set of cluster constraints and separator constraints, where the cluster constraints play the role of reducing the number of constraints, and the separator constraints enforce the consistency of neighboring clusters so as to improve the accuracy. In the case where the junction graph is tree-structured, our method provides an equivalent representation to the original constraints. In other cases, our method provides a good trade-off between computation and accuracy. Experimental results on different models show that our algorithm performs better than other approximate linear programming algorithms on computational cost or expected reward. (C) 2015 Elsevier Inc. All rights reserved.
Keyword:
Factored MDPs
Approximate linear programming
Junction graph
Cluster constraints
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3
论文数:
3.0K
被引数:
5.1K
机构
引用论文
Imine-linked micron-network polymers with high polyethylene glycol uptake for shaped-stabilized phase change materials.png)
RSC Advances
RSC AdvancesIF0
PREAI
分享收藏分享收藏 没有更多内容
没有更多内容