High-Quality Policies for the Canadian Traveler's Problem

Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010

Volumn , Issue , 2010, Pages 51-58

  Eyerich, Patrick ^a   Keller, Thomas ^a   Helmert, Malte ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

MOTION PLANNING; STOCHASTIC SYSTEMS;

ADVERSE WEATHER; HIGH QUALITY; NEW APPROACHES; OPTIMISTIC APPROACH; PATH PLANNING PROBLEMS; PROBABILITY: DISTRIBUTIONS; QUALITY POLICY; STOCHASTICS; TRAVEL COSTS; TRAVELER'S PROBLEMS;

PROBABILITY DISTRIBUTIONS;

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

References (20)

1. Bjarnason, R.; Fern, A.; and Tadepalli, P. 2009. Lower bounding Klondike solitaire with Monte-Carlo planning. In Proc. ICAPS 2009, 26-33.
2. Bnaya, Z.; Felner, A.; Shimony, E.; Kaminka, G. A.; and Merdler, E. 2008. A fresh look at sensor-based navigation: Navigation with sensing costs. In AAAI 2008 Workshop on Search in Artificial Intelligence and Robotics, 11-17.
3. Bnaya, Z.; Felner, A.; and Shimony, S. E. 2009. Canadian traveler problem with remote sensing. In Proc. IJCAI 2009, 437-442.
4. Bonet, B. 2009. Deterministic POMDPs revisited. In Proc. UAI 2009, 59-66.
5. Buro, M.; Long, J. R.; Furtak, T.; and Sturtevant, N. 2009. Improving state evaluation, inference, and search in trick-based card games. In Proc. IJCAI 2009, 1407-1413.
6. Ferguson, D.; Stentz, A.; and Thrun, S. 2004. PAO* for planning with hidden state. In Proc. ICRA 2004, 2840-2847.
7. Frank, I., and Basin, D. A. 2001. A theoretical and empirical investigation of search in imperfect information games. Theoretical Computer Science 252(1-2):217-256.
8. Gelly, S., and Silver, D. 2007. Combining online and offline knowledge in UCT. In Proc. ICML 2007, 273-280.
9. Ginsberg, M. L. 1999. GIB: Steps toward an expert-level bridge-playing program. In Proc. IJCAI 1999, 584-593.
10. Kocsis, L., and Szepesvári, C. 2006. Bandit based Monte-Carlo planning. In Proc. ECML 2006, 282-293.
11. Koenig, S., and Likhachev, M. 2002. D* Lite. In Proc. AAAI 2002, 476-483.
12. Likhachev, M., and Stentz, A. 2006. PPCP: Efficient probabilistic planning with clear preferences in partially-known environments. In Proc. AAAI 2006, 860-867.
13. Littman, M. L. 1996. Algorithms for Sequential Decision Making. Ph.D. Dissertation, Brown University, Providence, Rhode Island.
14. Nikolova, E., and Karger, D. R. 2008. Route planning under uncertainty: The Canadian traveller problem. In Proc. AAAI 2008, 969-974.
15. Papadimitriou, C. H., and Yannakakis, M. 1991. Shortest paths without a map. Theoretical Computer Science 84(1):127-150.
16. Pearl, J. 1984. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley.
17. Russell, S., and Norvig, P. 1995. Artificial Intelligence - A Modern Approach. Prentice Hall.
18. Stentz, A. 1994. Optimal and efficient path planning for partially-known environments. In Proc. ICRA 1994, 3310-3317.
19. Yoon, S.; Fern, A.; Givan, R.; and Kambhampati, S. 2008. Probabilistic planning via determinization in hindsight. In Proc. AAAI 2008, 1010-1016.
20. Zeisberger, U. 2005. Pfadplanung unter Unsicherheit. Diplomarbeit, Albert-Ludwigs-Universität Freiburg.