摘要
本文在文[1]基础上,对两种RA~*算法进行了比较研究,通过引入感兴趣集,给出了RA~*算法的改进算法IRA~*和IRA’,并且证明了IRA~*算法的可采纳性.从算法所扩展的结点数目这一角度来看,IRA~*算法明显优于RA~*算法.若感兴趣集并不包含最佳路径上的结点,则IRA~*算法的变形——IRA’算法可用来寻找一条较佳的求解路径.
The comparison between two RA* algorithms is presented. By introducing interesting set, improved algorithms IRA* and IRA' for heuristic graph search algorithm RA* are proposed, and the admissibility of IRA* is proved. From the viewpoint of the number of expanded nodes, IRA* is obviously better than RA*. If interesting set does not involve nodes which are in the best solution path, modified algorithm IRA' of IRA* can be used to find a better solution path.
出处
《计算机学报》
EI
CSCD
北大核心
1991年第3期192-198,共7页
Chinese Journal of Computers
基金
国家自然科学基金
关键词
人工智能
图搜索
IRA
算法
Artificial intelligence, heuristic graph search, interesting sets, algorithm
