An Admissible Heuristic Search Algorithm

作者: Li-Yen Shue , Reza Zamani

DOI: 10.1007/3-540-56804-2_7

关键词:

摘要: This paper introduces an admissible heuristic search algorithm — Search and Learning Algorithm (SLA*). SLA* is developed from the work presented by Korf in Learning-Real-Time-Algorithm (LRTA*). We retain major elements of Korfs LRTA*, improve its performance incorporating a review component to fully reflect effect learning new front states has upon previous states. The combined strategy search, learning, enabled this accumulate knowledge continuously through guided expansion, identify better directions any stage nodes expansion. With assumption non-overestimating initial estimates for all goal, able find optimal solution single problem solving trial with good efficiency. provide proof optimality solution.

参考文章(3)
Peter Hart, Nils Nilsson, Bertram Raphael, A Formal Basis for the Heuristic Determination of Minimum Cost Paths IEEE Transactions on Systems Science and Cybernetics. ,vol. 4, pp. 100- 107 ,(1968) , 10.1109/TSSC.1968.300136
Richard E. Korf, Real-time heuristic search Artificial Intelligence. ,vol. 42, pp. 189- 211 ,(1990) , 10.1016/0004-3702(90)90054-4
Richard E. Korf, Depth-first iterative-deepening: an optimal admissible tree search Artificial Intelligence. ,vol. 27, pp. 97- 109 ,(1985) , 10.1016/0004-3702(85)90084-0