Improved results for route planning in stochastic transportation

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 895-902

  Boyan, Justin ^a   Mitzenmacher, Michael ^b  

^a NASA AMES RESEARCH CENTER   (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

Algorithms; Measurement; Performance; Theory; Verification

Indexed keywords

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

References (9)

1. Dimitri P. Bertsekas , John N. Tsitsiklis, Neuro-Dynamic Programming, Athena Scientific, 1996
2. J. A. Boyan and M. L. Littman. Exact solutions to time-dependent MDPs. Submitted to Neural Information Processing Systems, 2000.
3. Mayur Datar , Abhiram Ranade, Commuting with delay prone buses, Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, p.22-29, January 09-11, 2000, San Francisco, California, United States
4. R. W. Hall. The fastest path through a network with random time-dependent travel times. Transportation Science, 20(3):182-188, 1986.
5. K. C. Kaput and L. A. Lamberson. Reliability in Engineering Design. John Wiley and sons, New York, 1977.
6. Martin L. Puterman, Markov Decision Processes: Discrete Stochastic Dynamic Programming, John Wiley & Sons, Inc., New York, NY, 1994
7. S. Ross. Stochastic Processes. John Wiley and Sons, New York, 1983.
8. D. Stoyan. Comparison Methods for Queues and Other Stochastic Models. John Wiley and Sons, Berlin, 1983.
9. M. P. Wellman, M. Ford, and K. Larson. Path Planning under time-dependent uncertainty. In Proceeding of the 11th Conference on Uncertainty in Artificial Intelligence (UAI'95), pages 532-539. Morgan Kaufmann, 1995.