Computing Programs for Generalized Planning as Heuristic Search
Abstract
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.
Keywords
Cite
@article{arxiv.2205.06259,
title = {Computing Programs for Generalized Planning as Heuristic Search},
author = {Javier Segovia-Aguas and Sergio Jiménez and Anders Jonsson},
journal= {arXiv preprint arXiv:2205.06259},
year = {2022}
}
Comments
Extended abstract accepted at IJCAI-22 Sister Conferences Best Paper Track. arXiv admin note: substantial text overlap with arXiv:2103.14434