广义AND/OR图的自底向上的启发式搜索算法BFA0

Backward Heuristic Search Algorithm BFAO for General AND/OR Graph

本文首先根据三角模及其扩张运算概念,定义了一类新的更具普遍意义的模糊广义AND/OR图。根据新定义的启发式函数h(n,x)以及模糊广义AND/OR图的最佳解树之所有子树亦是最佳子解树的原理,提出了自底向上的启发式搜索算法BFAO·。文中证明了算法BFAO·的可采纳性。本文还提出了两类新的启发式函数的单调限制概念,并据此研究了算法BFAO·的单调限制性质,研究了两个BFAO·算法间的比较性质。

Fuzzy general AND/OR graphs of a new type are defined on triangle norm and its extension.The backward heuristic search algorithm BFAO' for fuzzy general AND/OR graphs is presented,in terms of newly-defined heuristic function h(n,x) and the principle that all subtrees of the optimum solution tree for fuzzy general AND/OR graph are also optimum subtrees.The admissibliry of algorithm BFAO is proved.In this paper,two new monotone restrictions for heuristic function h(n,x) are also defined.Based on these,the characteristic of monotone restrictions for algorithm BFAO is investigated,and the comparison between two BFAO algorithm is discussed.