Symbolic Top-k Planning
Symbolic Top-k Planning
复制标题
象征性Top-k规划
DOI：
--
复制
发表时间：
2020
期刊：
影响因子：
--
通讯作者：
Bernhard Nebel
中科院分区：
文献类型：
--
作者：
David Speck;Robert Mattmüller;Bernhard Nebel
The objective of top-k planning is to determine a set of k different plans with lowest cost for a given planning task. In practice, such a set of best plans can be preferred to a single best plan generated by ordinary optimal planners, as it allows the user to choose between different alternatives and thus take into account preferences that may be difficult to model. In this paper we show that, in general, the decision problem version of top-k planning is PSPACE-complete, as is the decision problem version of ordinary classical planning. This does not hold for polynomially bounded plans for which the decision problem turns out to be PP-hard, while the ordinary case is NP-hard. We present a novel approach to top-k planning, called sym-k, which is based on symbolic search, and prove that sym-k is sound and complete. Our empirical analysis shows that sym-k exceeds the current state of the art for both small and large k.
利用随机过程代数工具CASPA进行k最短路径的符号计算及相关测度
DOI：
10.1145/1772630.1772635
发表时间：
2010
期刊：
影响因子：
--
作者：
M. Guenther;J. Schuster;M. Siegle
通讯作者：
M. Siegle
行动计划的道德许可性
DOI：
10.1609/aaai.v33i01.33017635
发表时间：
2019
期刊：
影响因子：
--
作者：
F. Lindner;R. Mattmüller;B. Nebel
通讯作者：
B. Nebel
影响因子：
14.4
作者：
Aljazzar, Husain;Leue, Stefan
通讯作者：
Leue, Stefan