论文标题
作为启发式搜索，用于广义计划的计算程序
Computing Programs for Generalized Planning as Heuristic Search
论文作者
论文摘要
尽管启发式搜索是经典计划最成功的方法之一，但该计划范式并不直接适用于广义计划（GP）。本文以启发式搜索范式适应了计划，适应了GP的特殊性，并提出了GP的第一种本地启发式搜索方法。首先，本文为GP定义了基于程序的解决方案空间，该解决方案与GP问题中的计划实例的数量以及这些实例的规模无关。其次，本文定义了GP的BFGP算法，该算法在我们基于程序的解决方案空间中实现了最佳搜索，并且在不同的评估和启发式功能的指导下。
Although heuristic search is one of the most successful approaches to classical planning, this planning paradigm does not apply straightforwardly to Generalized Planning (GP). This paper adapts the planning as heuristic search paradigm to the particularities of GP, and presents the first native heuristic search approach to GP. First, the paper defines a program-based solution space for GP that is independent of the number of planning instances in a GP problem, and the size of these instances. Second, the paper defines the BFGP algorithm for GP, that implements a best-first search in our program-based solution space, and that is guided by different evaluation and heuristic functions.
