Local Search Topology in Planning Benchmarks: An Empirical Analysis
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence. Pages 453-457.
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. Looking at a collection of planning benchmarks, we measure topological properties of state spaces with respect to that relaxation. The results suggest that, given the heuristic based on the relaxation, many planning benchmarks are simple in structure. This sheds light on the recent success of heuristic planners employing local search.
Jörg Hoffmann. 2001. Local Search Topology in Planning Benchmarks: An Empirical Analysis. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI-01. IJCAI, 453–457. https://ijcai.org/proceedings/2001/63
Hoffmann, J. (2001). Local Search Topology in Planning Benchmarks: An Empirical Analysis. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI-01 (pp. 453–457). IJCAI. https://ijcai.org/proceedings/2001/63
@inproceedings{ijcai2001p63,
title = {Local Search Topology in Planning Benchmarks: An Empirical Analysis},
author = {Hoffmann, Jörg},
booktitle = {Proceedings of the Seventeenth International Joint Conference on
Artificial Intelligence, {IJCAI-01}},
publisher = {International Joint Conferences on Artificial Intelligence},
pages = {453--457},
year = {2001},
url = {https://ijcai.org/proceedings/2001/63},
}
TY - CPAPER TI - Local Search Topology in Planning Benchmarks: An Empirical Analysis AU - Hoffmann, Jörg T2 - Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI-01 PB - International Joint Conferences on Artificial Intelligence PY - 2001 SP - 453 EP - 457 UR - https://ijcai.org/proceedings/2001/63 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
