arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2205.06259cs.AI
收藏

广义规划的启发式搜索计算程序

Computing Programs for Generalized Planning as Heuristic Search

Universitat Pompeu Fabra(庞培法布拉大学)

Javier Segovia-Aguas, Sergio Jiménez, Anders Jonsson

摘要:

虽然启发式搜索是经典规划中最成功的方法之一,但这种规划范式并不直接适用于广义规划(GP)。本文将规划作为启发式搜索的一种范式,应用于规划问题的特殊性,提出了第一种求解规划问题的原生启发式搜索方法。首先,本文定义了一个基于程序的解决方案空间GP是独立的规划实例的数量在GP问题,这些实例的大小。其次,本文定义了BFGP算法的GP,实现了最佳优先搜索在我们的程序为基础的解决方案空间,并指导不同的评价和启发式功能。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑