| BIDPS^＊：基本的循环加深周边搜索算法 |
| |
| 引用本文： | 陈焕文,阮雪榆.BIDPS^＊：基本的循环加深周边搜索算法[J].计算机工程,1997,23(6):45-47. |
| |
| 作者姓名： | 陈焕文 阮雪榆 |
| |
| 作者单位： | 上海交通大学塑性成形工程系!上海，200030，上海交通大学塑性成形工程系!上海，200030 |
| |
| 摘 要： | ＢＩＤＰＳ＾＊是一种把ＩＤＡ算法和ＰＳ法相结合而产生的人工智能搜索算法。该文研究了不考虑启发式计算最小化技术的搜索效率问题，提出了一些新的算法效率的度量，用８数码难题检验了ＢＩＤＰＳ算法并与ＩＤＡ算法进行了比较分析，实验结果表明尽管ＢＩＤＰＳ启发式计算量较大，但较ＩＤＡ算法在效率上还有所提高的。
|
| 关 键 词： | 启发式搜索 周边搜索 算法 BIDPS 人工智能 |
BIDPS~*:A Basic Algorithm of Iterative-deepening Perimeter Search |
| |
| Chen Huanwen, Ruan Xueyu.BIDPS~*:A Basic Algorithm of Iterative-deepening Perimeter Search[J].Computer Engineering,1997,23(6):45-47. |
| |
| Authors: | Chen Huanwen Ruan Xueyu |
| |
| 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. |
| |
| Keywords: | Heuristics Perimeter Iterative-deepening depth-first search |
| 本文献已被 CNKI 维普 等数据库收录！ |
