Novelty Heuristics, Multi-Queue Search, and Portfolios for Numeric Planning

Heuristic search is a powerful approach for solving planning problems and numeric planning is no exception. In this paper, we boost the performance of heuristic search for numeric planning with various powerful techniques orthogonal to improving heuristic informedness: numeric novelty heuristics, th...

Full description

Saved in:
Bibliographic Details
Published inProceedings of the International Symposium on Combinatorial Search Vol. 17; pp. 203 - 207
Main Authors Chen, Dillon Z., Thiébaux, Sylvie
Format Journal Article Conference Proceeding
LanguageEnglish
Published 01.06.2024
Online AccessGet full text
ISSN2832-9171
2832-9163
2832-9163
DOI10.1609/socs.v17i1.31559

Cover

More Information
Summary:Heuristic search is a powerful approach for solving planning problems and numeric planning is no exception. In this paper, we boost the performance of heuristic search for numeric planning with various powerful techniques orthogonal to improving heuristic informedness: numeric novelty heuristics, the Manhattan distance heuristic, and exploring the use of multi-queue search and portfolios for combining heuristics.
ISSN:2832-9171
2832-9163
2832-9163
DOI:10.1609/socs.v17i1.31559