广义规划中的新颖性与提升的有用动作
Novelty and Lifted Helpful Actions in Generalized Planning
AI总结:
本文针对广义规划问题,提出了基于动作新颖性排名的求解器BFS($v$)和PGP($v$),并引入提升的有用动作、新评估函数与程序限制以扩大搜索规模,实验证明其优于现有最先进方法。
摘要:
最近的研究表明,经典规划中的成功技术,如面向目标的启发式和路标,能够提升计算广义规划(GP)问题规划程序的能力。在本研究中,我们引入了动作新颖性排名的概念,该排名计算相对于规划程序的新颖性,并提出了基于新颖性的广义规划求解器,当新生成的规划程序的最频繁动作重复大于给定界限 $v$ 时将其剪枝,该求解器由基于新颖性的最佳优先搜索 BFS($v$) 及其渐进变体 PGP($v$) 实现。此外,我们引入了源自动作模式的 GP 中的提升的有用动作,并提出了新的评估函数和结构化程序限制以扩大搜索规模。我们的实验表明,新算法 BFS($v$) 和 PGP($v$) 在标准广义规划基准上优于 GP 领域的最先进方法。本文还简要讨论了上述广义规划方法的实际发现。
英文摘要:
It has been shown recently that successful techniques in classical planning, such as goal-oriented heuristics and landmarks, can improve the ability to compute planning programs for generalized planning (GP) problems. In this work, we introduce the notion of action novelty rank, which computes novelty with respect to a planning program, and propose novelty-based generalized planning solvers, which prune a newly generated planning program if its most frequent action repetition is greater than a given bound $v$, implemented by novelty-based best-first search BFS($v$) and its progressive variant PGP($v$). Besides, we introduce lifted helpful actions in GP derived from action schemes, and propose new evaluation functions and structural program restrictions to scale up the search. Our experiments show that the new algorithms BFS($v$) and PGP($v$) outperform the state-of-the-art in GP over the standard generalized planning benchmarks. Practical findings on the above-mentioned methods in generalized planning are briefly discussed.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。