Suboptimality bounds for stochastic shortest path problems

Proceedings of the 27th Conference on Uncertainty in Artificial Intelligence, UAI 2011

Volumn , Issue , 2011, Pages 301-310

  Hansen, Eric A ^a  

^a MISSISSIPPI STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COST BENEFIT ANALYSIS; GRAPH THEORY; STOCHASTIC SYSTEMS;

STOCHASTIC SHORTEST PATH PROBLEM; SUBOPTIMALITY; TRANSITION COSTS;

DYNAMIC PROGRAMMING;

EID: 80053163692     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. A. Barto, S. Bradtke, and S. Singh. Learning to act using real-time dynamic programming. Artificial Intelligence, 72(1):81-138, 1995.
2. D. Bertsekas. Dynamic Programming and Optimal Control, Volume I. Athena Scientific, Belmont, MA, 3rd edition, 2005.
3. D. Bertsekas and J. Tsitsiklis. Parallel and distributed computation: Numerical methods. Prentice-Hall, Inc., Upper Saddle River, NJ, 1989.
4. D. Bertsekas and J. Tsitsiklis. Analysis of stochastic shortest path problems. Mathematics of Operations Research, 16(3):580-595, 1991.
5. D. Bertsekas and J. Tsitsiklis. Neuro-Dynamic Programming. Athena Scientific, Belmont, MA, 1996.
6. B. Bonet and E. Hansen. Heuristic search for planning under uncertainty. In H. G. R. Dechter and J. Halpern, editors, Heuristics, Probability and Causality: A Tribute to Judea Pearl, pages 3-22. College Publications, London, UK, 2010.
7. O. Madani, S. Hanks, and A. Condon. On the undecidability of probabilistic planning and related stochastic optimization problems. Artificial Intelligence, 147:5-34, 2003.
8. M. Maskery, V. Krishnamurthy, and C. O'Regan. Decentralized algorithms for netcentric force protection against antiship missiles. IEEE Transactions on Aerospace and Electronic Systems, 43(4):1351-1372, 2008. (Pubitemid 351344361)
9. R. Parr and S. Russell. Approximating optimal policies for partially observable stochastic domains. In Proc. of the 14th Int. Joint Conf. on Artificial Intelligence (IJCAI-95), pages 1088-1095, 1995.
10. S. Patek. On terminating Markov decision processes with a risk averse objective function. Automatica, 37(9):1379-1386, 2001. (Pubitemid 32691033)
11. S. Patek. Partially observed stochastic shortest path problems with approximate solution by neurodynamic programming. IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 37(5):710-720, 2007. (Pubitemid 47323535)
12. S. Patek and D. Bertsekas. Stochastic shortest path games. SIAM Journal of Control and Optimization, 37(3):804-824, 1999.
13. S. Russell and P. Norvig. Artificial Intelligence: A Modern Approach. Prentice Hall, 3 edition, 2009.
14. T. Smith and R. Simmons. Heuristic search value iteration for POMDPs. In Proceedings of the 20th Conference in Uncertainty in Artificial Intelligence (UAI-04), pages 520-527, Banff, Canada, 2004.
15. J. Tsitsiklis. Asynchronous stochastic approximation and Q-learning. Machine Learning, 16:185-202, 1994.
16. N. Zhang and W. Zhang. Speeding up the convergence of value iteration in partially observable Markov decision processes. Journal of Artificial Intelligence Research, 14:29-51, 2001. (Pubitemid 33738058)