Search
Skip to Search Results- 3Abstractions
- 3Heuristic search
- 1Artificial Intelligence
- 1Bidirectional search
- 1Diversity
- 1Downward path preserving property
- 3Holte, Robert
- 2Schaeffer, Jonathan
- 2Sturtevant, Nathan R.
- 1Anderson, Ken
- 1Ball, Marcel
- 1Culberson, Joseph
-
2007
Culberson, Joseph, Yang, Fan, Holte, Robert
Technical report TR07-06. The effectiveness of heuristics search is influnced by the accuracy of the heuristic values. State space abstractions have been proved to be effective for generating admissible heuristics. In this paper, A general definition for abstractions is given. As a demonstration...
-
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...
-
2009
Holte, Robert, Zilles, Sandra, Ball, Marcel
Technical report TR09-04. Abstraction is a popular technique for speeding up planning and search. A problem that often arises in using abstraction is the generation of abstract states, called spurious states, from which the goal state is reachable in the abstract space but for which there is no...