Route planning under uncertainty: The canadian traveller problem

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2008, Pages 969-974

  Nikolova, Evdokia ^a   Karger, David R ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; BIONICS; COMPUTATIONAL METHODS; COST BENEFIT ANALYSIS; DECISION THEORY; RANDOM PROCESSES;

#P-HARD; ALGORITHM ANALYSIS; DIRECTED ACYCLIC GRAPHS; DISJOINT PATHS; EFFICIENT EXACT ALGORITHMS; EXACT SOLUTIONS; EXPECTED COSTS; EXPERIMENTAL DATUMS; MARKOV DECISION PROCESSES; NATURAL HEURISTICS; OPTIMAL POLICIES; PERFORMANCE ANALYSES; ROUTE PLANNING; STOCHASTIC SHORTEST PATHS;

APPROXIMATION ALGORITHMS;

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

References (14)

1. Bar-Noy, A., and Schieber, B. 1991. The Canadian traveller problem. In Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms, 261-270.
2. Blei, D., and Kaelbling, L. 1999. Shortest paths in a dynamic uncertain domain. In IJCAI Workshop on Adaptive Spatial Representations of Dynamic Environments.
3. Boyan, J., and Mitzenmacher, M. 2001. Improved results for route planning in stochastic transportation networks. Symposium of Discrete Algorithms.
4. Fan, Y.; Kalaba, R.; and J. E. Moore, I. Arriving on time. Journal of Optimization Theory and Applications forth-com.
5. Ferguson, D.; Stentz, A.; and Thrun, S. 2004. PAO* for planning with hidden state. In Proceedings of IEEE International Conference on Robotics and Automation (ICRA).
6. Gao, S., and Chabini, I. 2002. Optimal routing policy problems in stochastic time-dependent networks. In Proceedings of the IEEE 5th International Conference on Intelligent, Transportation Systems, 549-559.
7. Hajiaghayi, M. T.; Kleinberg, R. D.; Leighton, F. T.; and Raecke, H. 2006. New lower bounds for oblivious routing in undirected graphs. In Proceedings of Symposium on Discrete Algorithms.
8. Kalai, A., and Vempala, S. 2005. Efficient algorithms for on-line optimization. Journal of Computer and System Sciences 71:291-307.
9. Karger, D. R., and Nikolova, E. 2008. Exact algorithms for the Canadian traveller problem on paths and trees. Technical Report MIT-CSAIL-TR-2008-004, MIT.
10. McDonald, A. B. Survey of adaptive shortest-path routing in dynamic packet-switched networks. Cite-seer.ist.psu.edu/mcdonald97survey.html.
11. Papadimitriou, C., and Yannakakis, M. 1991. Shortest paths without a map. Theoretical Computer Science 84:127-150.
12. Peshkin, L., and Savova, V. 2002. Reinforcement learning for adaptive routing. In Proceedings of Intnl. Joint Conf. on Neural Networks, IJCNN.
13. Polychronopoulos, G., and Tsitsiklis, J. 1996. Stochastic shortest path problems with recourse. Networks 27(2): 133-143.
14. Puterman, M. L. 1994. Markov Decision Processes. John Wiley and Sons.