Cost-based heuristic search is sensitive to the ratio of operator costs

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

Volumn , Issue , 2011, Pages 172-179

  Wilt, Christopher ^a   Ruml, Wheeler ^a  

^a Univ of New Hampshire   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM PERFORMANCE; BENCHMARK DOMAINS; BEST FIRST SEARCH; DOMAIN FEATURE; HEURISTIC SEARCH; OPERATOR COSTS; REAL-WORLD PROBLEM;

COSTS; HEURISTIC ALGORITHMS; MODULAR ROBOTS;

COST BENEFIT ANALYSIS;

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

References (15)

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. Culberson, J. C., and Schaeffer, J. 1998. Pattern databases. Computational Intelligence 14(3):318-334.
3. Cushing, W.; Benton, J.; and Kambhampati, S. 2010. Cost based search considered harmful. In Symposium on Combinatorial Search.
4. Cushing, W.; Benton, J.; and Kambhampati, S. 2011. Cost based satisficing search considered harmful. arXiv:1103.3687v1 [cs.AI]. http://arxiv.org/abs/ 1103.3687, accessed April 10, 2011.
5. 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.
6. Felner, A.; Zahavi, U.; Holte, R.; Schaeffer, J.; Sturtevant, N.; and Zhang, Z. 2011. Inconsistent heuristics in theory and practice. Artificial Intelligence 1570-1603.
7. Hart, P. E.; Nilsson, N. J.; and Raphael, B. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions of Systems Science and Cybernetics SSC-4(2):100-107.
8. Helmert, M. 2010. Landmark heuristics for the pancake problem. In Symposium on Combinatorial Search.
9. Korf, R. E. 1985. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence 27(1):97-109.
10. Likhachev, M., and Ferguson, D. 2009. Planning long dynamically feasible maneuvers for autonomous vehicles. I. J. Robotic Res. 28(8):933-945.
11. Pohl, I. 1970. Heuristic search viewed as path finding in a graph. Artificial Intelligence 1:193-204.
12. Thayer, J., and Ruml,W. 2011. Bounded suboptimal search: A direct approach using inadmissible estimates. In Proceedings of the Twenty-Second International Joint Conference on Articial Intelligence (IJCAI-11).
13. Thayer, J. T.; Dionne, A.; and Ruml, W. 2011. Learning inadmissible heuristics during search. In Proceedings of ICAPS 2011.
14. Thayer, J.; Ruml, W.; and Kreis, J. 2009. Using distance estimates in heuristic search: A re-evaluation. In Symposium on Combinatorial Search.
15. Wilt, C.; Thayer, J.; and Ruml, W. 2010. A comparison of greedy search algorithms. In Symposium on Combinatorial Search.