摘要
本文将模式识别技术引入到启发式搜索当中,开展一种新的搜索——学习式搜索——的研究。我们给出了一个学习式的搜索算法SCDF,并证明了该算法的平均复杂度可达到线性。
In this paper, machine learning technique is emploied to solve the Heuristic Search problem of Artificial intelligence. By so doing, a new kind of search strategy-Leaning Search-is proposed. One of the leaning search algorithms, SCDF, is presented. The characteristics of SCDF is discussed and one of the conclusions is that the mean complexity of SCDF is O(N), where N is the length of the optimal solution path.
出处
《辽宁大学学报（自然科学版）》
CAS
1992年第4期82-88,共7页
Journal of Liaoning University：Natural Sciences Edition
关键词
人工智能
启发式搜索
机器学习
Artificial intelligence, Heuristic Search, Machine Learning.
