Approximate linear programming for first-order MDPs

MaRDI QIDQ5740455zbMATH OpenFDO

Authors Scott Sanner, Craig Boutilier

Publication date 26 July 2016

Full work available at URL https://arxiv.org/abs/1207.1415

zbMATH Keywords

approximate linear programmingfirst-order Markov decision processes

Mathematics Subject Classification ID

Linear programming (90C05) Markov and semi-Markov decision processes (90C40)

Recommendations

• Practical solution techniques for first-order MDPs
• Symmetric approximate linear programming for factored MDPs with application to constrained problems
• Efficient approximate linear programming for factored MDPs
• Approximate linear programming for average cost MDPs
• The Linear Programming Approach to Approximate Dynamic Programming

Cited in

(4)

• APPSSAT: Approximate probabilistic planning using stochastic satisfiability
• Practical solution techniques for first-order MDPs
• Approximate Dynamic Programming via a Smoothed Linear Program
• A Linearly Relaxed Approximate Linear Program for Markov Decision Processes

This page was built for publication: Approximate linear programming for first-order MDPs

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