On the Speed of Convergence of Value Iteration on Stochastic Shortest-Path Problems
Published Online:1 May 2007https://doi.org/10.1287/moor.1060.0238
References
- Learning to act using real-time dynamic programming. Artificial Intelligence (1995) 72:81–138Crossref, Google Scholar
- Dynamic Programming (1957) (Princeton University Press, Princeton, NJ) Google Scholar
- Dynamic Programming and Optimal Control (1995) (Athena Scientific, Belmont, MA) Google Scholar
- Parallel and Distributed Computation: Numerical Methods (1989) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
- An analysis of stochastic shortest-path problems. Math. Oper. Res. (1991) 16:580–595Link, Google Scholar
- Modeling and Solving Sequential Decision Tasks with Uncertainty and Partial Information (2003) . Ph.D. thesis, University of California, Los Angeles, CAGoogle Scholar
- Generalized best-first search strategies and the optimality of A*. J. Assoc. Comput. Mach. (1985) 32(3):505–536Crossref, Google Scholar
- Optimal pursuit strategies in discrete state probabilistic systems. Trans. ASME, Series D, J. Basic Engrg. (1962) 84:23–29Crossref, Google Scholar
- A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Systems Sci. Cybernetics (1968) 4:100–107Crossref, Google Scholar
- Minimax real-time heuristic search. Artificial Intelligence (2001) 129:165–197Crossref, Google Scholar
- Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence (1985) 27(1):97–109Crossref, Google Scholar
- Heuristics (1983) (Morgan Kaufmann, San Francisco, CA) Google Scholar
- Markov Decision Processes—Discrete Stochastic Dynamic Programming (1994) (John Wiley & Sons, New York) Crossref, Google Scholar
- Solving H-horizon, stationary Markov decision problems in time proportional to log(H). Oper. Res. Lett. (1990) 9:289–297Crossref, Google Scholar
