An admissible heuristic search algorithm
This paper introduces an admissible heuristic search algorithm — Search and Learning Algorithm (SLA*). SLA* is developed from the work presented by Korf in the Learning-Real-Time-Algorithm (LRTA*). We retain the major elements of Korfs work in LRTA*, and improve its performance by incorporating a review component to fully reflect the effect the learning of new heuristic from front states has upon the previous states. The combined strategy of search, learning, and review has enabled this algorithm to accumulate knowledge continuously through guided expansion, and to identify better search directions in any stage of nodes expansion. With the assumption of non-overestimating initial estimates for all nodes to the goal, this algorithm is able to find an optimal solution in a single problem solving trial with good efficiency. We provide a proof for the optimality of the solution.
Unable to display preview. Download preview PDF.
- 1.P.E. Hart N.J.Nilsson and B. Raphael “A formal basis for the heuristic determination of minimum cost paths”, IEEE Trans. Syst. Sci. Cybern. 4 pp 100–107, 1968.Google Scholar
- 2.R.E. Korf, “Depth First Iterative Deepening: An Optimum Admissible Tree Search”, Journal of Artificial Intelligence, 27, pp. 97–100, 1985.Google Scholar
- 3.R.E. Korf, “Real Time Heuristic Search”, Journal Of Artificial Intelligence” Vol 42, No 2–3, March, pp. 189–211, 1990.Google Scholar