Article :Browse 3185 Download 2860
Received:February 21, 1990 Revised:June 29, 1990
Received:February 21, 1990 Revised:June 29, 1990
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:
Foundation items:
Author Name | Affiliation |
Wang Shitong | 镇江船舶学院计算机系 镇江 212003 |
Reference text:
Wang Shitong.PROPAGATIONAL HEURISTIC GRAPH SEARCH ALGORITHMS PRA AND PRA.Journal of Software,1992,3(1):49-54
Wang Shitong.PROPAGATIONAL HEURISTIC GRAPH SEARCH ALGORITHMS PRA AND PRA.Journal of Software,1992,3(1):49-54