Corpus ID: 232380345

Generalized Planning as Heuristic Search

  title={Generalized Planning as Heuristic Search},
  author={Javier Segovia Aguas and Sergio Jim{\'e}nez Celorrio and Anders Jonsson},
Although heuristic search is one of the most successful approaches to classical planning, this planning paradigm does not apply straightforwardly to Generalized Planning (GP). Planning as heuristic search traditionally addresses the computation of sequential plans by searching in a grounded statespace. On the other hand GP aims at computing algorithmlike plans, that can branch and loop, and that generalize to a (possibly infinite) set of classical planning instances. This paper adapts the… Expand

Figures and Tables from this paper


Planning as heuristic search
A family of heuristic search planners are studied based on a simple and general heuristic that assumes that action preconditions are independent, which is used in the context of best-first and hill-climbing search algorithms, and tested over a large collection of domains. Expand
Computing programs for generalized planning using a classical planner
A novel formalism for representing generalized plans that borrows two mechanisms from structured programming: control flow and procedure calls is introduced that allows to compactly represent generalized plans. Expand
Generalized Potential Heuristics for Classical Planning
This paper shows that several interesting planning domains possess compact generalized heuristics that can guide a greedy search in guaranteed polynomial time to the goal, and which work for any instance of the domain, and develops two variations of the approach that progressively refine the heuristic as new states are encountered. Expand
The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks
It is found that using landmarks improves performance, whereas the incorporation of action costs into the heuristic estimators proves not to be beneficial, and in some domains a search that ignores cost solves far more problems, raising the question of how to deal with action costs more effectively in the future. Expand
Directed Search for Generalized Plans Using Classical Planners
The resulting hybrid approach shows that solving only a few, small, classical planning problems can be sufficient to produce a generalized plan that applies to infinitely many problems with unknown numbers of objects. Expand
The Fast Downward Planning System
  • M. Helmert
  • Computer Science, Mathematics
  • J. Artif. Intell. Res.
  • 2006
A full account of Fast Downward's approach to solving multivalued planning tasks is given and a new non-heuristic search algorithm called focused iterative-broadening search, which utilizes the information encoded in causal graphs in a novel way is presented. Expand
Best-First Width Search: Exploration and Exploitation in Classical Planning
This work shows first that width-based exploration in GBFS is more effective than GBFS with local GBFS search (GBFS-LS), and forms a simple and general computational framework where standard goal-oriented search (exploitation) and widthbased search (structural exploration) are combined to yield a search scheme that is better than both and which results in classical planning algorithms that outperform the state-of-the-art planners. Expand
Generalized Planning with Positive and Negative Examples
Experiments show that incorporating negative examples can accelerate plan synthesis in several domains and leverage quantitative metrics to evaluate the generalization capacity of the synthesized plans. Expand
Planning Through Stochastic Local Search and Temporal Action Graphs in LPG
This paper focuses on temporal planning, introducing TA-graphs and proposing some techniques to guide the search in LPG using this representation, and shows that these techniques can be very effective. Expand
A review of generalized planning
The paper reviews recent advances in generalized planning and relates them to existing planning formalisms, such as planning with domain control knowledge and approaches for planning under uncertainty, that also aim at generality. Expand