Efficient approximate linear programming for factored MDPs

DOI10.1016/j.ijar.2015.06.002zbMath1354.90165OpenAlexW565784466MaRDI QIDQ899136

Zhaofei Yu, Guojun Wang, Jianwu Dong, Feng Chen, Qiang Cheng, Xu, Wenli

Publication date: 21 December 2015

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2015.06.002

zbMATH Keywords

approximate linear programmingcluster constraintsfactored MDPsjunction graph

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Markov and semi-Markov decision processes (90C40)

Uses Software

• PMTK

Cites Work

• A framework and a mean-field algorithm for the local control of spatial processes
• Efficient solutions to factored MDPs with imprecise transition probabilities
• Stochastic dynamic programming with factored representations
• Contribution to nonserial dynamic programming
• Graphical Models, Exponential Families, and Variational Inference
• On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs
• On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item