Open AccessFF The Fast‐Forward Planning System
Author(s) -
Hoffmann Jörg
Publication year - 2001
Publication title -
ai magazine
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.597
H-Index - 79
eISSN - 2371-9621
pISSN - 0738-4602
DOI - 10.1609/aimag.v22i3.1572
Subject(s) - planner , computer science , scheduling (production processes) , heuristic , operations research , artificial intelligence , state (computer science) , state space , mathematical optimization , algorithm , engineering , mathematics , statistics
fast ‐ forward ( ff ) was the most successful automatic planner in the Fifth International Conference on Artificial Intelligence Planning and Scheduling (AIPS'00) planning systems competition. Like the well‐known hsp system, ff relies on forward search in the state space, guided by a heuristic that estimates goal distances by ignoring delete lists. It differs from hsp in a number of important details. This article describes the algorithmic techniques used in ff in comparison to hsp and evaluates their benefits in terms of run‐time and solution‐length behavior.