On the Speed of Convergence of Value Iteration on Stochastic Shortest-Path Problems

DOI10.1287/moor.1060.0238zbMath1279.90182OpenAlexW2140019566MaRDI QIDQ5388035

Blai Bonet

Publication date: 27 May 2008

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.1060.0238

zbMATH Keywords

Markov decision processesvalue iterationstochastic shortest-path problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Markov and semi-Markov decision processes (90C40)

Related Items (4)

The stochastic shortest-path problem for Markov chains with infinite state space with applications to nearest-neighbor lattice chains ⋮ Computing transience bounds of emergency call centers: a hierarchical timed Petri net approach ⋮ Ranking policies in discrete Markov decision processes ⋮ Robust shortest path planning and semicontractive dynamic programming

This page was built for publication: On the Speed of Convergence of Value Iteration on Stochastic Shortest-Path Problems