基于OBDD的含圈与或图搜索算法研究

OBDD based symbolic algorithm for searching cyclic AND/OR graphs

在含圈与或图理论框架基础上,给出了基于OBDD的含圈与或图符号表示方法,并提出了一种求解含圈与或图最小代价解图的符号搜索算法。实验结果表明,该算法在处理大规模含圈与或图时具有明显优势。

Based on the framework for searching cyclic AND/OR graphs,proposed an OBDD based representation of cyclic AND/OR graphs,on which formulated a symbolic algorithm for searching minimal-cost solution graph of cyclic AND/OR graphs.It shows that the algorithm has significant advantage over traditional algorithms in handling larger-scale cyclic AND/OR graphs.