Levi, Lelis H. S., Franco, Santiago, Abisrror, Marvin, Barley, Mike, Zilles, Sandra and Holte, Robert (2016) Heuristic subset selection in classical planning. In: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI-16). AAAI Press / IJCAI, Palo Alto, California, USA, pp. 3185-3195. ISBN 978-1577357711

In this paper we present greedy methods for selecting a subset of heuristic functions for guiding A* search. Our methods are able to optimize various objective functions while selecting a subset from a pool of up to thousands of heuristics. Specifically, our methods minimize approximations of A*’s search tree size, and approximations of A*’s running time. We show empirically that our methods can outperform state-of-the-art planners for deterministic optimal planning.

451.pdf - Published Version
Restricted to Repository staff only

Download (723kB)
subset-selection.pdf - Accepted Version

Download (291kB) | Preview


Downloads per month over past year

Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email