PROPAGATIONAL HEURISTIC GRAPH SEARCH ALGORITHMS PRA AND PRA
传播式启发式图搜索算法PRA及PRA

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.