【摘要】 本文将函数逼近的方法引入到学习式搜索中，使学习式搜索通过一定数量的解题训练后可以建立起一个任意一致逼近理想函数ｈ＊（·）的启发估计函数ｈ（·）．本文给出了一个这样的学习式搜索算法Ａ－Ｂｎ，并证明了当训练例子集充分大后，Ａ－Ｂｎ可在多项式复杂度内解决任一后来提交的同类问题．更多还原

【Abstract】 In this paper,Polynomial Approximation method and theory are introduced into the research of Learning Search of Artificial Intelligence.In this way, we can use a search algorithm repeatedly to construct a heuristic estimate function h(·) which uniformly approximates to the optimal estimate function h*(·) with arbitrarily high precision. One of such learning setrch algorithms, A-Bn is presented and it is shown that, when the number of training samples becomes large enough, the worst-case complexity of A-Bn can be reduced to O(poly(N)),where N is the length of the optimal solution path, poly (N) is a polynomial of N.更多还原