arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1210.6415cs.AI
收藏

词汇划分:一种新的BDD搜索方法

Lex-Partitioning: A New Option for BDD Search

Universität Bremen(不来梅大学);Universität des Saarlandes(萨尔大学);Universidad Carlos III de Madrid(马德里卡洛斯三世大学)

Stefan Edelkamp, Peter Kissmann, Álvaro Torralba

摘要:

对于大型状态空间的探索,使用二叉决策图(BDD)的符号搜索可以节省大量的内存和计算时间。状态集通过访问和操作其特征函数来表示和修改。BDD分割用于将图像计算为较小子图像的析取。在本文中,我们提出了一种新的BDD划分选项。划分是字典式的,在由BDD表示的集合中包含的状态的二进制表示中,并且相对于所表示的状态的数量是均匀的。在划分中控制状态集大小的动机是最终弥合显式搜索和符号搜索之间的差距。设n为二进制状态向量的大小。我们提出了一个O(n)的排名和unranking计划,支持否定的边缘和操作的顶部预先计算的satcount值。对于BDD的均匀分割,我们使用unranking来提供分割BDD的路径。时间复杂度是O(n)的。这些算法完全集成在CUDD库中,并在强有力地解决一般游戏基准中进行评估。

英文摘要:

For the exploration of large state spaces, symbolic search using binary decision diagrams (BDDs) can save huge amounts of memory and computation time. State sets are represented and modified by accessing and manipulating their characteristic functions. BDD partitioning is used to compute the image as the disjunction of smaller subimages. In this paper, we propose a novel BDD partitioning option. The partitioning is lexicographical in the binary representation of the states contained in the set that is represented by a BDD and uniform with respect to the number of states represented. The motivation of controlling the state set sizes in the partitioning is to eventually bridge the gap between explicit and symbolic search. Let n be the size of the binary state vector. We propose an O(n) ranking and unranking scheme that supports negated edges and operates on top of precomputed satcount values. For the uniform split of a BDD, we then use unranking to provide paths along which we partition the BDDs. In a shared BDD representation the efforts are O(n). The algorithms are fully integrated in the CUDD library and evaluated in strongly solving general game playing benchmarks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑