Skip to search formSkip to main contentSkip to account menu
  • Publications
  • Influence
The FF Planning System: Fast Plan Generation Through Heuristic Search
TLDR
A novel search strategy is introduced that combines hill-climbing with systematic search, and it is shown how other powerful heuristic information can be extracted and used to prune the search space.
View PDF on arXiv
The Metric-FF Planning System: Translating ''Ignoring Delete Lists'' to Numeric State Variables
  • J. Hoffmann
  • Computer Science
    J. Artif. Intell. Res.
  • 1 December 2003
TLDR
A natural extension of "ignoring delete lists" to numeric state variables is presented, preserving the relevant theoretical properties of the STRIPS relaxation under the condition that the numeric task at hand is "monotonic".
View PDF on arXiv
Ordered Landmarks in Planning
TLDR
This work extends Koehler and Hoffmann's definition of reasonable orders between top level goals to the more general case of landmarks and shows how landmarks can be found, how their reasonable orders can be approximated, and how this information can be used to decompose a given planning task into several smaller sub-tasks.
View PDF on arXiv
The Deterministic Part of IPC-4: An Overview
We provide an overview of the organization and results of the deterministic part of the 4th International Planning Competition, i.e., of the part concerned with evaluating systems doing deterministic…
View PDF on arXiv
Conformant planning via heuristic forward search: A new approach
View via Publisher
Extending Planning Graphs to an ADL Subset
TLDR
An extension of Graphplan to a subset of ADL that allows conditional and universally quantified effects in operators is described and it is proved that Graphplan''s termination test remains complete under subset memoization.
View via Publisher
Flexible Abstraction Heuristics for Optimal Sequential Planning
TLDR
An approach to deriving consistent heuristics for automated planning, based on explicit search in abstract state spaces, which subsumes planning with pattern databases as a special case and shows that the approach is competitive with the state of the art.
View Paper
Contingent Planning via Heuristic Forward Search witn Implicit Belief States
TLDR
This paper proposes the targeted use of an additional relaxation, mapping the relaxed contingent problem into a relaxed conformant problem, and shows that the resulting planning system, Contingent-FF, is highly competitive with the state-of-the-art contingent planners POND and MBP.
View Paper
On Reasonable and Forced Goal Orderings and their Use in an Agenda-Driven Planning Algorithm
TLDR
The paper formally defines and discusses two different goal orderings, which are called the reasonable and the forced ordering, and shows how the ordering relations can be used to compute a so-called goal agenda that divides G into an ordered set of subgoals.
View PDF on arXiv
FF: The Fast-Forward Planning System
TLDR
The algorithmic techniques used in FF in comparison to hsp are described and their benefits in terms of run-time and solution-length behavior are evaluated.
View via Publisher
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License