Heuristic search in restricted memory (research note)
Artificial Intelligence
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Disjoint pattern database heuristics
Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
Anytime Heuristic Searc: First Results TITLE2:
Anytime Heuristic Searc: First Results TITLE2:
Journal of Artificial Intelligence Research
AWA*-a window constrained anytime heuristic search algorithm
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
$hbox{MAWA}^{ast}$—A Memory-Bounded Anytime Heuristic-Search Algorithm
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Anytime algorithms for mining groups with maximum coverage
AusDM '12 Proceedings of the Tenth Australasian Data Mining Conference - Volume 134
| Hi-index | 0.00 |
Anytime heuristic search algorithms are widely applied where best-first search algorithms such as A* require large or often unacceptable amounts of time and memory. Anytime algorithms produce a solution quickly and iteratively improve the solution quality. In this paper, we propose novel anytime heuristic search algorithms with a common underlying strategy called Column Search. The proposed algorithms are complete and guarantee to produce an optimal solution. Experimental results on sliding-tile puzzle problem, traveling salesman problem, and robotic arm trajectory planning problem show the efficacy of proposed methods compared to state-of-the-art anytime heuristic search algorithms.