30 citations · 52 across the 6 of their papers we have counts for
7 papers
Generalized Planning as Heuristic Search: A new planning search-space that leverages pointers over objects
Javier Segovia-Aguas, Sergio Jiménez, Anders Jonsson
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…
Scaling-up Generalized Planning as Heuristic Search with Landmarks
Javier Segovia-Aguas, Sergio Jiménez, Anders Jonsson +1
Landmarks are one of the most effective search heuristics for classical planning, but largely ignored in generalized planning. Generalized planning (GP) is usually addressed as a c…
Generalized Planning as Heuristic Search
Javier Segovia-Aguas, Sergio Jiménez, 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). Plan…
Generalized Planning with Positive and Negative Examples
Javier Segovia-Aguas, Sergio Jiménez, Anders Jonsson
Generalized planning aims at computing an algorithm-like structure (generalized plan) that solves a set of multiple planning instances. In this paper we define negative examples fo…
Hierarchical Finite State Controllers for Generalized Planning
Javier Segovia-Aguas, Sergio Jiménez, Anders Jonsson
Finite State Controllers (FSCs) are an effective way to represent sequential plans compactly. By imposing appropriate conditions on transitions, FSCs can also represent generalized…
Generalized Planning With Procedural Domain Control Knowledge
Javier Segovia-Aguas, Sergio Jiménez, Anders Jonsson
Generalized planning is the task of generating a single solution that is valid for a set of planning problems. In this paper we show how to represent and compute generalized plans…
Scaling up Heuristic Planning with Relational Decision Trees
Tomas De la Rosa, Sergio Jimenez, Raquel Fuentetaja +1
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are worth…