Search
Skip to Search Results- 2Heuristic search
- 1Abstractions
- 1Artificial Intelligence
- 1Diversity
- 1Exploration
- 1Greedy best-first search
-
2013
Sturtevant, Nathan R., Valenzano, Richard, Schaeffer, Jonathan
While greedy best-first search (GBFS) is a popular algorithm for solving automated planning tasks, it can exhibit poor performance if the heuristic in use mistakenly identifies a region of the search space as promising. In such cases, the way the algorithm greedily trusts the heuristic can cause...
-
2008
Schaeffer, Jonathan, Sturtevant, Nathan, Holte, Robert, Anderson, Ken
Technical report TR08-05. The following report describes some techniques that generalize and attempt to improve upon the Coarse-to-Fine Dynamic Programming (CFDP) algorithm developed by Christopher Raphael. CFDP uses a hierarchy of abstraction graphs, iteratively searches to find optimal...