Efficient approximate linear programming for factored MDPs
DOI10.1016/J.IJAR.2015.06.002zbMATH Open1354.90165OpenAlexW565784466MaRDI QIDQ899136FDOQ899136
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
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Markov and semi-Markov decision processes (90C40)
Cites Work
- Graphical models, exponential families, and variational inference
- Machine learning. A probabilistic perspective
- Probabilistic graphical models.
- On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
- Title not available (Why is that?)
- On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs
- Stochastic dynamic programming with factored representations
- A framework and a mean-field algorithm for the local control of spatial processes
- Efficient solutions to factored MDPs with imprecise transition probabilities
- Contribution to nonserial dynamic programming
- Title not available (Why is that?)
Cited In (6)
- Solving factored mdps with hybrid state and action variables
- Title not available (Why is that?)
- Solving factored MDPs using non-homogeneous partitions
- Symmetric approximate linear programming for factored MDPs with application to constrained problems
- Title not available (Why is that?)
- Efficient solutions to factored MDPs with imprecise transition probabilities
Uses Software
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)
