| 摘要: |
| 本文基于传播值的概念,提出了一个新的传播式启发式图搜索算法PRA及PRA,算法PRA是可采纳的,且在运行时间上优于算法RA,本文还基于约束消解的概念,研究了算法RA与PRA之间在运行结果上的关系定理。 |
| 关键词: |
| DOI： |
| 分类号: |
| 基金项目:国家自然科学基金 |
|
| PROPAGATIONAL HEURISTIC GRAPH SEARCH ALGORITHMS PRA AND PRA |
|
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. |
| Key words: |
