摘要
给出了一个包含有向回路的与或图的求解算法 ,以及如何确定被扩展节点的祖先节点的优先数 ,并通过优先数有效地选取祖先节点的方法也在本文中给出。
In this paper, a solution algorithm for AND/OR graph with directed circuits is presented. Methods for determining the ancestor nodes' priority number of the expanded node and selecting effectively the ancestor nodes by means of the priority number are also given.
出处
《山东科技大学学报（自然科学版）》
CAS
2000年第1期92-94,共3页
Journal of Shandong University of Science and Technology(Natural Science)
关键词
与或图
优先数
评价函数
人工智能
算法
AND/OR graph
priority number
evaluation function
solved node
cost
local solution graph
