Generalized Planning as Heuristic Search: A new planning search-space that leverages pointers over objects

TL;DR

This paper introduces a novel heuristic search method for Generalized Planning that uses pointers over objects, enabling the handling of large, variable-sized problem instances without grounding states or actions.

Contribution

It presents the first native heuristic search approach for GP, with a pointer-based solution space and evaluation functions that scale to large, variable-sized instances.

Findings

New pointer-based solution space for GP

Heuristic functions that do not require grounding states

An upgraded Best-First Generalized Planning algorithm

Abstract

Planning as heuristic search is one of the most successful approaches to classical planning but unfortunately, it does not extend trivially to Generalized Planning (GP). GP aims to compute algorithmic solutions that are valid for a set of classical planning instances from a given domain, even if these instances differ in the number of objects, the number of state variables, their domain size, or their initial and goal configuration. The generalization requirements of GP make it impractical to perform the state-space search that is usually implemented by heuristic planners. This paper adapts the planning as heuristic search paradigm to the generalization requirements of GP, and presents the first native heuristic search approach to GP. First, the paper introduces a new pointer-based solution space for GP that is independent of the number of classical planning instances in a GP problem and the size of those instances (i.e. the number of objects, state variables and their domain sizes). Second, the paper defines a set of evaluation and heuristic functions for guiding a combinatorial search in our new GP solution space. The computation of these evaluation and heuristic functions does not require grounding states or actions in advance. Therefore our GP as heuristic search approach can handle large sets of state variables with large numerical domains, e.g.~integers. Lastly, the paper defines an upgraded version of our novel algorithm for GP called Best-First Generalized Planning (BFGP), that implements a best-first search in our pointer-based solution space, and that is guided by our evaluation/heuristic functions for GP.