Topological value iteration algorithms

MaRDI QIDQ3112630zbMATH OpenFDO

Authors Peng Dai, Mausam, Daniel S. Weld, J. Goldsmith

Publication date 12 January 2012

Mathematics Subject Classification ID

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

Recommendations

• Factored value iteration converges
• Value Iteration
• Robust topological policy iteration for infinite horizon bounded Markov decision processes
• Reachability in MDPs: refining convergence of value iteration
• Prioritization methods for accelerating MDP solvers

Cited in

(17)

• Robust topological policy iteration for infinite horizon bounded Markov decision processes
• Comparison of algorithms for simple stochastic games
• Comparison of algorithms for simple stochastic games
• Optimistic and topological value iteration for simple stochastic games
• On the Complexity of Value Iteration
• Answer set planning: a survey
• Technical note -- cyclic variables and Markov decision processes
• Depth-based short-sighted stochastic shortest path problems
• Efficient constraint generation for stochastic shortest path problems
• Multi-cost bounded tradeoff analysis in MDP
• Implementation of the Topological \varepsilon -Algorithm
• Factored value iteration converges
• Prioritization methods for accelerating MDP solvers
• Computing expected visiting times and stationary distributions in Markov chains: fast and accurate
• scientific article; zbMATH DE number 17541 (Why is no real title available?)
• A practitioner's guide to MDP model checking algorithms
• Reducing the number of queries in interactive value iteration

This page was built for publication: Topological value iteration algorithms

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