Learning inadmissible heuristics during search

ICAPS 2011 - Proceedings of the 21st International Conference on Automated Planning and Scheduling

Volumn , Issue , 2011, Pages 250-257

  Thayer, Jordan T ^a   Dionne, Austin ^a   Ruml, Wheeler ^a  

^a Univ of New Hampshire   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARK DOMAINS; BEST FIRST SEARCH; OFF-LINE TRAINING; OPTIMAL SEARCH; OPTIMALITY; PRE-COMPUTATION; SEARCH ALGORITHMS; SPECIFIC PROBLEMS;

LEARNING ALGORITHMS;

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

References (19)

1. Benton, J.; Talamadupula, K.; Eyerich, P.; Mattmueller, R.; and Kambhampati, S. 2010. G-value plateuas: A challenge for planning. In Proceedings of ICAPS 2010.
2. Bramanti-Gregor, A., and Davis, H. 1993. The statistical learning of accurate heuristics. In IJCAI-93, 1079-1085.
3. Christensen, J., and Korf, R. 1986. A unified theory of heuristic evaluation functions and its application to learning. In AAAI-86, 148-152.
4. Doran, J. E., and Michie, D. 1966. Experiments with the graph traverser program. In Proceedings of the Royal Society of London. Series A, Mathematical and Physical Sciences, 235-259.
5. Fink, M. 2007. Online learning of search heuristics. In AISTATS.
6. Hart, P. E.; Nilsson, N. J.; and Raphael, B. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics SSC-4(2): 100-107.
7. Jabarri Arfaee, S.; Zilles, S.; and Holte, R. 2010. Bootstrap learning of heuristic functions. In SoCS-10.
8. Korf, R., and Felner, A. 2002. Disjoint pattern database heuristics. Artificial Intelligence 134:9-22. (Pubitemid 34086577)
9. Korf, R. E. 1985. Iterative-deepening-A*: An optimal admissible tree search. In IJCAI-85, 1034-1036.
10. Likhachev, M.; Gordon, G.; and Thrun, S. 2003. ARA*: Anytime A* with provable bounds on sub-optimality. In NIPS-03.
11. Nilsson, N. J. 1998. Artificial Intelligence: A New Synthesis. Morgan Kaufmann Publishers, Inc. 172-175.
12. Pohl, I. 1973. The avoidance of (relative) catastrophe, heuristic competence, genuine dynamic weighting and computation issues in heuristic problem solving. In Proceedings of IJCAI-73, 12-17.
13. Röger, G., and Helmert, M. 2010. The more the merrier: Combining heuristic estimators for satisficing planning. In ICAPS-10, 246-249.
14. Russell, S., and Norvig, P. 2003. Artificial Intelligence: A Modern Approach. Upper Saddle River, New Jersey: Prentice Hall, second edition.
15. Samadi, M.; Felner, A.; and Schaeffer, J. 2008. Learning from multiple heuristics. In Proceedings of AAAI-08.
16. Sutton, R. S. 1988. Learning to predict by the methods of temporal differences. Machine Learning 3:9-44.
17. Thayer, J. T., and Ruml, W. 2008. Faster than weighted A*: An optimistic approach to bounded suboptimal search. In ICAPS-08.
18. Thayer, J., and Ruml, W. 2009. Using distance estimates in heuristic search. In Proceedings of ICAPS-09.
19. Valenzano, R.; Sturtevant, N.; Schaeffer, J.; Buro, K.; and Kishimoto, A. 2010. Simultaneously searching with multiple settings: An alternative to parameter tuning for suboptimal single-agent search algorithms. In ICAPS-10.