Local Search Topology in Planning Benchmarks: A Theoretical Analysis (2002)
Cached
Download Links
| Citations: | 46 - 6 self |
BibTeX
@MISC{Hoffmann02localsearch,
author = {Jörg Hoffmann},
title = {Local Search Topology in Planning Benchmarks: A Theoretical Analysis},
year = {2002}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Many state-of-the-art heuristic planners derive their heuristic function by relaxing the planning task at hand, where the relaxation is to assume that all delete lists are empty. The success of such planners on many of the current benchmarks suggests that in those task's state spaces relaxed goal distances yield a heuristic function of high quality. Recent work has revealed empirical evidence confirming this intuition, stating several hypotheses about the local search topology of the current benchmarks, concerning the non-existence of dead ends and of local minima, as well as a limited maximal distance to exits on benches.
