利用最长路径的线性化计算平面长度的界
Computing Plan-Length Bounds Using Lengths of Longest Paths
摘要:
我们设计了一种方法来精确地计算最长的简单路径的长度因子化的状态空间,像在经典规划中遇到的状态空间。虽然这个问题的复杂性是NEXP困难的,我们表明,我们的方法可以用来计算实际上有用的上限计划的长度。我们表明,计算的上限是显着的(在许多情况下,数量级)优于以前的边界技术产生的界限,它们可以用来提高SAT为基础的规划。
英文摘要:
We devise a method to exactly compute the length of the longest simple path in factored state spaces, like state spaces encountered in classical planning. Although the complexity of this problem is NEXP-Hard, we show that our method can be used to compute practically useful upper-bounds on lengths of plans. We show that the computed upper-bounds are significantly (in many cases, orders of magnitude) better than bounds produced by previous bounding techniques and that they can be used to improve the SAT-based planning.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。