arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1912.04816cs.AI
收藏

定性数字规划:约简与复杂性

Qualitative Numeric Planning: Reductions and Complexity

Universidad Simón Bolívar(西蒙·玻利瓦尔大学);ICREA(加泰罗尼亚研究与高等教育机构);Universitat Pompeu Fabra(庞培法布拉大学)

Blai Bonet, Hector Geffner

摘要:

定性数值规划是经典的规划扩展与非负的实变量,可以增加或减少“定性”,即,不确定的金额。数值型确定性规划一般是不可判定的,而定性数值型规划是可判定的,为广义规划提供了一个方便的抽象模型。定性数值问题(QNP)的解对应于一个相关的完全可观测非确定性(FOND)问题的强循环解。这导致了一个生成和测试算法,用于解决QNP的FOND问题的解决方案是一个接一个地生成和测试终止。然而,这种解决QNP的方法的计算缺点是,它不是简单的修改FOND规划器生成所有的解决方案,并且要检查的解决方案的数量可以是变量数量的双指数。在这项工作中,我们解决这些限制,同时提供更多的见解QNP。更确切地说,我们引入了两个多项式时间的减少,一个从QNP到FOND问题,另一个从FOND问题到QNP,这两个都不涉及终止测试。这些减少的结果是,QNP被证明具有相同的表达能力和相同的复杂性FOND问题。

英文摘要:

Qualitative numerical planning is classical planning extended with non-negative real variables that can be increased or decreased "qualitatively", i.e., by positive indeterminate amounts. While deterministic planning with numerical variables is undecidable in general, qualitative numerical planning is decidable and provides a convenient abstract model for generalized planning. The solutions to qualitative numerical problems (QNPs) were shown to correspond to the strong cyclic solutions of an associated fully observable non-deterministic (FOND) problem that terminate. This leads to a generate-and-test algorithm for solving QNPs where solutions to a FOND problem are generated one by one and tested for termination. The computational shortcomings of this approach for solving QNPs, however, are that it is not simple to amend FOND planners to generate all solutions, and that the number of solutions to check can be doubly exponential in the number of variables. In this work we address these limitations while providing additional insights on QNPs. More precisely, we introduce two polynomial-time reductions, one from QNPs to FOND problems and the other from FOND problems to QNPs both of which do not involve termination tests. A result of these reductions is that QNPs are shown to have the same expressive power and the same complexity as FOND problems.

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

↑