摘要
本文在感兴趣集的基础上,提出了一个基于感兴趣集的求图的最佳路径的启发式搜索算法IA~*,并证明了算法IA~*的可采纳性和其较优越的性能。
A heurstie searching algorithm IA~* is presented based on the concept of interesting set (IS). Then the admissibility and improned performance of the algorithm IA~* are proved.
关键词
启发式算法
感兴趣集
搜索算法
Optimization
Heuristic approch
Admissible sets
