Current heuristic estimators for classical domain-independent planning are usually based
on one of four ideas: delete relaxations, critical paths, abstractions, and, most recently …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

In this work we aim to narrow the gap between plan recognition and planning by exploiting
the power and generality of recent planning algorithms for recognizing the set G∗ of goals G …

Introduction Page 1 Journal of Artificial Intelligence Research 22 (2004) 215-278 Submitted
05/04; published 11/04 Ordered Landmarks in Planning Jiorg Hoffmann г б вв бд Йз Кбд К …

Search has been vital to artificial intelligence from the very beginning as a core technique in
problem solving. The authors present a thorough overview of heuristic search with a balance …

This paper investigates symbolic heuristic search with BDDs for solving domain-
independent action planning problems cost-optimally. By distributing the impact of operators …

We present some techniques for planning in domains specified with the recent standard
language PDDL2. 1, supporting'durative actions' and numerical quantities. These …

Liste der Autoren Page 1 Liste der Autoren Clemens Beckstein Gerhard Brewka Christian
Borgelt Wolfram Burgard Hans-Dieter Burkhard Stephan Busemann Thomas Christaller Leonie …

Many areas of computer science require answering questions about reachability in
compactly described discrete transition systems. Answering such questions effectively …

We describe how to convert the heuristic search algorithm A* into an anytime algorithm that
finds a sequence of improved solutions and eventually converges to an optimal solution …