Efficient approximate linear programming for factored MDPs

DOI10.1016/J.IJAR.2015.06.002MaRDI QIDQ899136zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• scientific article; zbMATH DE number 2000828
• Factored value iteration converges
• Symmetric approximate linear programming for factored MDPs with application to constrained problems
• Solving factored mdps with hybrid state and action variables
• scientific article; zbMATH DE number 1929153

Cites work

• A framework and a mean-field algorithm for the local control of spatial processes
• Contribution to nonserial dynamic programming
• Efficient solutions to factored MDPs with imprecise transition probabilities
• Graphical models, exponential families, and variational inference
• scientific article; zbMATH DE number 2000828 (Why is no real title available?)
• scientific article; zbMATH DE number 1929153 (Why is no real title available?)
• Machine learning. A probabilistic perspective
• On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
• On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs
• Probabilistic graphical models.
• Stochastic dynamic programming with factored representations

Cited in

(7)

• Solving factored mdps with hybrid state and action variables
• scientific article; zbMATH DE number 2000828 (Why is no real title available?)
• scientific article; zbMATH DE number 2247690 (Why is no real title available?)
• Approximate linear programming for first-order MDPs
• Efficient solutions to factored MDPs with imprecise transition probabilities
• Solving factored MDPs using non-homogeneous partitions
• Symmetric approximate linear programming for factored MDPs with application to constrained problems

Describes a project that uses

Uses Software

• PMTK

This page was built for publication: Efficient approximate linear programming for factored MDPs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q899136)