Optimal route planning under uncertainty

ICAPS 2006 - Proceedings, Sixteenth International Conference on Automated Planning and Scheduling

Volumn 2006, Issue , 2006, Pages 131-140

  Nikolova, Evdokia ^a   Brand, Matthew ^b   Karger, David R ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b MITSUBISHI ELECTRIC RESEARCH LABORATORIES   (United States)

Author keywords

Algorithms; Complexity; Non linear objective; Route planning under uncertainty; Stochastic shortest path

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COST BENEFIT ANALYSIS; DYNAMIC PROGRAMMING; GRAPH THEORY; NONLINEAR EQUATIONS; OPTIMIZATION; RANDOM PROCESSES; REAL TIME SYSTEMS; UNCERTAIN SYSTEMS;

COMPLEXITY; NON-LINEAR OBJECTIVES; ROUTE PLANNING UNDER UNCERTAINTY; STOCHASTIC SHORTEST PATH;

STRATEGIC PLANNING;

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

References (17)

1. Bertsekas, D. P. and Tsitsiklis, J. N. 1991. An analysis of stochastic shortest path problems, Math. Oper. Rex. 16 (3): 580-595.
2. Boyan, J. and Mitzenmacher, M. 2001, Improved Results for Route Planning in Stochastic Transportation Networks. ACM-SIAM Symposium on Discrete Algorithms.
3. Bruno, J.L.; Downey, P.J.; and Fredrickson, G.N. 1981. Sequencing tasks with exponential service time to minimize the expected flowtime or makespan. Journal of the ACM, 28: 100-113.
4. Chabini, I. 2002. Algorithms for k-Shortest Paths and Other Routing Problems in Time-Dependent Networks. Transportation Research Part B: Methodological.
5. Chvatal, V. 1980. Hard Knapsack Problems. Operations Research,28: 1402-1411.
6. Fan, Y.; Kalaba, R.; and Moore, II, J. E. Arriving on Time. Journal of Optimization Theory and Applications, forthcoming.
7. Fu, L. and Rilett, L. R. 1998. Expected Shortest Paths in Dynamic and Stochastic Traffic Networks. Transportation Research, Part B, 32: 499-516.
8. Gao, S. and Chabini, I. 2002. Optimal Routing Policy Problems in Stochastic Time-Dependent Networks. Proceedings of the IEEE 5th International Conference on Intelligent, Transportation Systems, Singapore, pp. 549-559.
9. Hall, R. W. 1986. The Fastest Path Through a Network with Random Time-Dependent Travel Times, Transportation Science, 20: 182-188.
10. Karger, D.; Motwani, R.; and Ramkumar, G. D. S. 1997. On approximating the longest path in a graph. Algorithmica, 18: 82-98.
11. Loui, R. P. 1983. Optimal Paths in Graphs with Stochastic or Multidimentional Weights. Communications of the ACM, 26: 670-676.
12. Miller-Hooks, E. D. and Mahmassani, H. S. 2000. Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks. Transportation Science, 34: 198-215.
13. Mirchandani, P. and Soroush, H. 1985. Optimal paths in probabilistic networks: a case with temporary preferences. Computers and Operations Research, 12 (4): 365-381.
14. Nikolova, E. 2005. Stochastic Shortest Paths. Manuscript.
15. Papadimitriou, C.H. and Yannakakis, M. 1991. Shortest paths without a map. Theoretical Computer Science 84: 127-150.
16. Papadimitriou, C. H. and Steiglitz, K. 1998. Combinatorial optimization: Algorithms and complexity. Dover Publications, Inc., N.Y.
17. Vazirani, V. V. 2001. Approximation Algorithms. Springer-Verlag Berlin Heidelberg.