• Publications
  • Influence
The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks
TLDR
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
Landmarks Revisited
TLDR
This work proposes a novel approach for using landmarks in planning by deriving a pseudo-heuristic and combining it with other heuristics in a search framework and shows how additional landmarks and orderings can be found using the information present in multi-valued state variable representations of planning tasks. Expand
GQR – A Fast Reasoner for Binary Qualitative Constraint Calculi
GQR (Generic Qualitative Reasoner) is a solver for binary qualitative constraint networks. GQR takes a calculus description and one or more constraint networks as input, and tries to solve theExpand
Lama 2008 and 2011
TLDR
Two versions of LAMA are described: the original LAMA as developed for the 2008 competition and a new re-implementation that uses the latest version of the Fast Downward Planning Framework. Expand
Fast Downward Stone Soup
Fast Downward Stone Soup is a sequential portfolio planner that uses various heuristics and search algorithms that have been implemented in the Fast Downward planning system. We present a simpleExpand
BJOLP: The Big Joint Optimal Landmarks Planner
BJOLP, the Big Joint Optimal Landmarks Planner, uses landmarks to derive an admissible heuristic, which is then used to guide a search for a cost-optimal plan. In this paper we review landmarks andExpand
GQR: A Fast Solver for Binary Qualitative Constraint Networks
TLDR
GQR (Generic Qualitative Reasoner) is a tool that provides reasoning services for arbitrary binary qualitative calculi and aims to provide a generic and extensible solver that preserves efficiency and scalability. Expand
Transition Constraints: A Study on the Computational Complexity of Qualitative Change
TLDR
This paper discusses the reasoning task of finding a solution to a temporal sequence of static reasoning problems where this sequence is subject to additional transition constraints, and shows how such transitions can be defined as relations and expressed within qualitative constraint formalisms. Expand
On Combinations of Binary Qualitative Constraint Calculi
TLDR
This paper compares the approach by Gerevini and Renz to a method that generates a new qualitative calculus by exploiting the semantic interdependencies between the component calculi and analyzes some formal relationships between a combined calculus and its components. Expand
...
1
2
3
...