| 传播式启发式图搜索算法PRA及PRA |
| |
| 引用本文： | 王士同.传播式启发式图搜索算法PRA及PRA[J].软件学报,1992,3(1):49-54. |
| |
| 作者姓名： | 王士同 |
| |
| 作者单位： | 镇江船舶学院计算机系 镇江; 212003 |
| |
| 摘 要： | 本文基于传播值的概念,提出了一个新的传播式启发式图搜索算法PRA及PRA,算法PRA是可采纳的,且在运行时间上优于算法RA,本文还基于约束消解的概念,研究了算法RA与PRA之间在运行结果上的关系定理。
|
| 关 键 词： | 传播式 启发式 图搜索 算法 |
| 收稿时间： | 1990/2/21 0:00:00 |
| 修稿时间： | 1990/6/29 0:00:00 |
PROPAGATIONAL HEURISTIC GRAPH SEARCH ALGORITHMS PRA AND PRA |
| |
| Wang Shitong.PROPAGATIONAL HEURISTIC GRAPH SEARCH ALGORITHMS PRA AND PRA[J].Journal of Software,1992,3(1):49-54. |
| |
| Authors: | Wang Shitong |
| |
| Abstract: | In this paper, two new propagational heuristic graph search algorithms PRA and PRA* are presented, based on the concept of propagation. Algorithm PRA* is admissible, and it has an advantage over algorithm RA* on run time. Based on the concept of tie-resolution, the relation theorem between RA s run time and PRA s run time is investigated. |
| |
| Keywords: | |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《软件学报》浏览原始摘要信息 |
|
点击此处可从《软件学报》下载全文 |
|
