Route planning under uncertainty

[1]  David R. Karger,et al.  Exact Algorithms for the Canadian Traveller Problem on Paths and Trees , 2008 .

[2]  Song Gao,et al.  Optimal routing policy problems in stochastic time-dependent networks , 2006 .

[3]  Mohammad Taghi Hajiaghayi,et al.  New lower bounds for oblivious routing in undirected graphs , 2006, SODA '06.

[4]  Sebastian Thrun,et al.  PAO for planning with hidden state , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[5]  Leonid Peshkin,et al.  Reinforcement learning for adaptive routing , 2002, Proceedings of the 2002 International Joint Conference on Neural Networks. IJCNN'02 (Cat. No.02CH37290).

[6]  Michael Mitzenmacher,et al.  Improved results for route planning in stochastic transportation , 2000, SODA '01.

[7]  John N. Tsitsiklis,et al.  Stochastic shortest path problems with recourse , 1996, Networks.

[8]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[9]  Baruch Schieber,et al.  The Canadian Traveller Problem , 1991, SODA '91.

[10]  Mihalis Yannakakis,et al.  Shortest Paths Without a Map , 1989, Theor. Comput. Sci..