Towards Finding Optimal Solutions with Non-Admissible Heuristics: A New Technique
暂无分享,去创建一个
[1] A. Bagchi,et al. Three approaches to heuristic search in networks , 1985, JACM.
[2] P. P. Chakrabarti,et al. Admissibility of A0* when Heuristics Overestimate , 1987, Artif. Intell..
[3] George Politowski. On the construction of heuristic functions , 1986 .
[4] Rina Dechter,et al. Probabilistic Analysis of the Complexity of A* , 1980, Artif. Intell..
[5] R. Korf. An Optimal Admissible Tree Search , 1985 .
[6] J. Gaschnig. Performance measurement and analysis of certain search algorithms. , 1979 .
[7] Rina Dechter,et al. Generalized best-first search strategies and the optimality of A* , 1985, JACM.
[8] A. Bagchi,et al. Search Algorithms Under Different Kinds of Heuristics—A Comparative Study , 1983, JACM.