摘要: BIDPS*是一种把IDA*算法和PS法相结合而产生的人工智能搜索算法.该文研究了不考虑启发式计算最小化技术的搜索效率问题,提出了一些新的算法效率的质量,用8数码难题检验了BIDPS*算法并与IDA*算法进行了比较分析,实验结果表明尽管BIDPS*启发式计算量较大,但软IDA*算法在效率上还是有所提高的。
关键词:
启发式搜索,
周边搜索,
循环加深度优先算法
Abstract: BIDPS is a kind of the AI search algorithm which combined IDA. with PS. In this paper, the search efficienCy has been analysed out of consideration for the minimizing heuristic evalutions, some new dimentions of algorithm properties are profrosed, the comparisons between BIDPS and IDA has been made, and then the algorithm of BIDPS. is tested by 8 puzzle.The results,show that although the heuristic evalutions of BIDPS cost larger than that of IDA, the efficiency of BIDPS is higher.
中图分类号:
陈焕文,阮雪榆. BIDPS~*:基本的循环加深周边搜索算法[J]. , 1997, 23(06): 45-47.
Chen Huanwen, Ruan Xueyu. BIDPS~*:A Basic Algorithm of Iterative-deepening Perimeter Search[J]. , 1997, 23(06): 45-47.