基于子目标的放松启发式方法用于带有无限动作的数值规划
Subgoaling Relaxation-based Heuristics for Numeric Planning with Infinite Actions
AI总结:
本文提出一种方法,将带有无限动作的数值规划问题转换为简单任务,利用子目标启发式方法进行有效求解。
摘要:
带有控制参数的数值规划扩展了标准数值规划模型,通过引入动作参数作为自由数值变量,在规划过程中必须进行实例化。这导致在某个状态中可能有无限多个适用的动作。在这种情况下,利用动作结构的现成数值启发式方法不可行。在本文中,我们识别出一个可处理的子集问题——即可控的简单数值问题,并提出一种乐观的编译方法,将它们转换为简单的数值任务。为此,我们将依赖控制的表达式抽象为有界常数效应和放松的先决条件。所提出的编译方法使能够有效地使用子目标启发式方法来估计数值规划问题中包含控制参数的目标距离。我们的结果表明,这种方法是将传统数值启发式方法应用于具有无限可能动作设置的有效且计算上可行的方式,推动了当前最先进水平的边界。
英文摘要:
Numeric planning with control parameters extends the standard numeric planning model by introducing action parameters as free numeric variables that must be instantiated during planning. This results in a potentially infinite number of applicable actions in a state. In this setting, off-the-shelf numeric heuristics that leverage the action structure are not feasible. In this paper, we identify a tractable subset of these problems--namely, controllable, simple numeric problems--and propose an optimistic compilation approach that transforms them into simple numeric tasks. To do so, we abstract control-dependent expressions into bounded constant effects and relaxed preconditions. The proposed compilation makes it possible to effectively use subgoaling heuristics to estimate goal distance in numeric planning problems involving control parameters. Our results demonstrate that this approach is an effective and computationally feasible way of applying traditional numeric heuristics to settings with an infinite number of possible actions, pushing the boundaries of the current state of the art.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。