计算机科学 ›› 2010, Vol. 37 ›› Issue (7): 169-173.
• 数据库与数据挖掘 • 上一篇 下一篇
王雪松,赵岭忠,古天龙
出版日期:
发布日期:
基金资助:
WANG Xue-song,ZHAO Ling-zhong,GU Tian-long
Online:
Published:
摘要: 与或图搜索是人工智能领域一项重要的问题求解技术。基于传统数据结构的与或图表示技术极大地限制了与或图搜索算法可求解问题的规模。在无圈与或图符号OI3D1)表示的基础上,给出了一种求解无圈与或图最小代价解图的符号搜索算法。实验结果表明,与AO*算法相比,该算法可处理问题的规模有较大的提高。
关键词: 与或图,最小代价解图,OBDDs
Abstract: Searching AND/OR graph is an important problem-solving technique in the area of artificial intelligence. The representation of AND/OR graph based on traditional data structures greatly limits the scale of the graph that could be handled with existing AND/OR graph searching algorithm. Based on the symbolic representation of acyclic AND/OR graph using 0BDD(ordered binary decision diagram),we proposed a novel symbolic algorithm for searching minimal-cost solution graph of acyclic AND/OR graph. It is shown that the symbolic algorithm has lower space complexity and can be used to handle larger-scale acyclic AND/OR graphs.
Key words: AND/OR graph, Minimal-cost solution graph, OBDDs
王雪松,赵岭忠,古天龙. 无圈与或图搜索的符号OBDD算法研究[J]. 计算机科学, 2010, 37(7): 169-173. https://doi.org/
WANG Xue-song,ZHAO Ling-zhong,GU Tian-long. OBDD Based Symbolic Algorithm for Searching Acyclic AND/OR Graphs[J]. Computer Science, 2010, 37(7): 169-173. https://doi.org/
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: https://www.jsjkx.com/CN/
https://www.jsjkx.com/CN/Y2010/V37/I7/169
Cited