摘要
本文引入了NP操作,提出了改进的双向启发式图搜索算法BRA~*;定义了2-单调限制的概念,并据此研究了算法BRA~*的重要性质;文中还研究了两个BRA~*算法间的比较定理,所得结果与Nilsson教授所得结论有本质区别。最后本文还分析了算法BRA~*的搜索效率。
In the paper, the improved bidirectional heuristic graph search algorithm BRA* is presented by introducing NP operation. The conception of 2-monotonous restriction is defined, and some important characteristics of algorithm BRA* are discussed. The comparison theorem between those two algorihms is investigated. The search efficiency of algorihm BRA* is also analyzed at the end of this paper.
关键词
人工智能
启发式搜索
图论算法
artficial intelligence
heuristic search
graph-theoretical algorithms
