| 摘要: |
| 本文首先根据三角模概念，定义了一类新的更具普遍意义的广义ＡＮＤ／ＯＲ图．根据新定义的启发式函数ｈ（ｎ，ｘ）以及广义ＡＮＤ／ＯＲ图的最佳解树之所有子树亦是最佳子解树的原理，提出了广义ＡＮＤ／ＯＲ图的自底向上的启发式搜索算法ＢＨＡＯ．文中证明了算法ＢＨＡＯ的可采纳性．本文还提出了两类新的启发式函数的单调限制概念，并据此研究了算法ＢＨＡＯ的单调限制性质，研究了两个ＢＨＡＯ算法间的比较性质． |
| 关键词: 广义AND／OR图，启发式搜索，启发式函数，单调限制，算法 |
| DOI： |
| 分类号: |
| 基金项目:广义AND／OR图，启发式搜索，启发式函数，单调限制，算法 |
|
| BACKWARD HEURISTIC SEARCH ALGORITHM BHAO FOR GENERAL AND/OR GRAPH |
|
Wang Shitong
|
| Abstract: |
| n this paper, general AND/OR graphs of a new type are defined on triangle norm. The backward heuristic search algorithm BHAO for general AND/OR graphs is presented, in terms of newly-defined heuristic function h(n,x) and the principle that every subtree of the optimum solution tree is also optimum solution one. The admissibility of algorithm BHAO is proved. Based on two newly - defined monotone restrictions for heuristic function h (n, x), the characteristic of monotone restrictions for algorithm BHAO is also investigated, and the comparison between two BHAO algorithms is also discussed. |
| Key words: General AND/OR graph heuristic search heuristic function monotone restriction algorithm. |
