Repeated-task Canadian traveler problem

Proceedings of the 4th Annual Symposium on Combinatorial Search, SoCS 2011

Volumn , Issue , 2011, Pages 24-30

  Bnaya, Zahy ^a   Felner, Ariel ^a   Shimony, Solomon Eyal ^a   Fried, Dror ^a   Maksin, Olga ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION COSTS; DISJOINT PATHS; NEAR-OPTIMAL; OPTIMAL ALGORITHM; OPTIMAL POLICIES; SINGLE-AGENT; TRAVEL COSTS; TRAVELING AGENTS;

OPTIMIZATION;

GRAPH THEORY;

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

References (10)

1. Bar-Noy, A., and Schieber, B. 1991. The Canadian Traveller Problem. In SODA, 261-270.
2. Bnaya, Z.; Felner, A.; and Shimony, S. E. 2009. Canadian traveler problem with remote sensing. In IJCAI, 437-442.
3. Bonet, B. 2009. Deterministic POMDPs Revisited. In (UAI). Montreal, Canada.
4. Eyerich, P.; Keller, T.; and Helmert, M. 2010. High-Quality Policies for the Canadian Traveler's Problem. In AAAI 2010.
5. Hansen, E. A. 2007. Indefinite-horizon POMDPs with actionbased termination. In AAAI, 1237-1242.
6. Kocsis, L., and Szepesv́ari, C. 2006. Bandit based monte-carlo planning. In ECML, 282-293.
7. Littman, M. 1996. Algorithms for Sequnetial Decision Making. Ph.D. Dissertation, Brown University.
8. Meshulam, R.; Felner, A.; and Kraus, S. 2005. Utility-based multiagent system for performing repeated navigation tasks. In AAMAS, 887-894.
9. Nikolova, E., and Karger, D. R. 2008. Route Planning under Uncertainty: The Canadian Traveller Problem. AAAI 969-974.
10. Papadimitriou, C. H., and Yannakakis, M. 1991. Shortest Paths Without a Map. Theor. Comput. Sci. 84(1):127-150.