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.

翻译：虽然重力搜索是典型规划最成功的方法之一,但这一规划范式并不直接适用于一般规划(GP),本文件将规划作为重力搜索范式,以适应GP的特殊性,并介绍了对GP的第一种本地重力搜索方法。首先,本文件界定了基于程序的GP解决方案空间,该空间独立于GP问题规划实例的数量和这些实例的大小。第二,该文件界定了GP的BFGP算法,该算法在我们基于程序的解决办法空间中实施最佳的首先搜索,并遵循不同的评价和重力功能。