A comparison of greedy search algorithms

Proceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010

Volumn , Issue , 2010, Pages 129-136

  Wilt, Christopher ^a   Thayer, Jordan ^a   Ruml, Wheeler ^a  

^a University of New Hampshire   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BEST FIRST SEARCH; DESIGN DECISIONS; EMPIRICAL ANALYSIS; GREEDY HEURISTICS; GREEDY SEARCH ALGORITHMS; HILL CLIMBING ALGORITHMS; SOLUTION QUALITY; TIME-TO-SOLUTION;

HEURISTIC ALGORITHMS;

BENCHMARKING;

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

References (20)

1. Aine, S.; Chakrabarti, P.; and Kumal, R. 2007. AWA*-A window constrained anytime heuristic search algorithm. In Proceedings of IJCAI-07.
2. Bisiani, R. 1992. Encyclopedia of Artificial Intelligence, volume 2. John Wiley and Sons, 2 edition. chapter Beam Search, 1467-1468.
3. 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.
4. Ebendt, R., and Drechsler, R. 2009. Weighted A* search-unifying view and application. Artificial Intelligence 173:1310-1342.
5. Furcy, D., and Koenig, S. 2005a. Limited discrepancy beam search. In Proceedings of IJCAI-05, 125-131.
6. Furcy, D., and Koenig, S. 2005b. Scaling up WA* with commitment and diversity. In IJCAI-05, 1521-1522.
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. Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. JAIR 14:253-302.
9. Holte, R.; Grajkowskic, J.; and Tanner, B. 2005. Hierachical heuristic search revisitied. In Symposium on Abstracton Reformulation and Approximation, 121-133.
10. Koenig, S., and Sun, X. 2008. Comparing real-time and incremental heuristic search for real-time situated agents. In Journal of Autonomous Agents and Multi-Agent Systems, 18(3):313-341.
11. Korf, R. E. 1985. Iterative-deepening-A&zast;: An optimal admissible tree search. In Proceedings of IJCAI-85, 1034-1036.
12. Likhachev, M.; Gordon, G.; and Thrun, S. 2003. ARA*: Anytime A* with provable bounds on sub-optimality. In Proceedings of the Seventeenth Annual Conference on Neural Information Porcessing Systems (NIPS-03).
13. Pearl, J., and Kim, J. H. 1982. Studies in semi-admissible heuristics. IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI-4(4):391-399.
14. Pohl, I. 1970. Heuristic search viewed as path finding in a graph. Artificial Intelligence 1:193-204.
15. Rich, E., and Knight, K. 1991. Artificial Intelligence. McGraw-Hill, Incorporated.
16. Russell, S., and Norvig, P. 2010. Artificial Intelligence: AModern Approach. Third edition.
17. Thayer, J. T., and Ruml, W. 2008. Faster than weighted A&zast;: An optimistic approach to bounded suboptimal search. In Proceedings of ICAPS-08.
18. Thayer, J. T.; Ruml, W.; and Bitton, E. 2008. Fast and loose in bounded suboptimal heuristic search. In Proceedings of STAIR-08.
19. Zhang, W. 1998. Complete anytime beam search. In Proceedings of AAAI-98, 425-430.
20. Zhou, R., and Hansen, E. A. 2005. Beam-stack search: Integrating backtracking with beam search. In Proceedings of ICAPS-05.