SearchSkip to Search Results
- 2Schaeffer, Jonathan
- 2Sturtevant, Nathan R.
- 2Valenzano, Richard
- 1Anderson, Ken
- 1Churchill, David G
- 1Felner, Ariel
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...
In this thesis, we study theoretically and empirically the additive abstraction-based heuristics. First we present formal general definitions for abstractions that extend to general additive abstractions. We show that the general definition makes proofs of admissibility, consistency, and...
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...
Real-time strategy (RTS) video games are known for being one of the most complex and strategic games for humans to play. With a unique combination of strategic thinking and dexterous mouse movements, RTS games make for a very intense and exciting game-play experience. In recent years the games AI...
This thesis consists of two parts. First, we invented an abstraction framework called multimapping which allows multiple admissible heuristic values to be extracted from one abstract space. The key idea of this technique is to design a multimapping function which maps one state in the original...
Simultaneously searching with multiple algorithm settings: an alternative to parameter tuning for suboptimal single-agent searchDownload
Many single-agent search algorithms have parameters that need to be tuned. Although settings found by offline tuning will exhibit strong average performance, properly selecting parameter settings for each problem can result in substantially reduced search effort. We consider the use of...
In this dissertation we consider the problem of cardplay move evaluation in the context of trick-taking card games, specifically the German card game Skat, and to a lesser extent Contract Bridge. To this end we construct symmetry-based search extensions for efficiently solving perfect...