Heuristic subset selection in classical planning

Lelis HS Levi, Santiago Franco, Marvin Abisrror, Mike Barley, Sandra Zilles, Robert Holte

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

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.
Original languageEnglish
Title of host publicationProceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI-16)
EditorsSubbarao Kambhampati
PublisherAAAI press
Pages3185-3195
Number of pages11
ISBN (Print)9781577357704
Publication statusPublished - 2016
Externally publishedYes
EventTwenty-Fifth International Joint Conference on Artificial Intelligence - New York, United States
Duration: 9 Jul 201615 Jul 2016
Conference number: 25
http://ijcai-16.org/ (Link to Conference Website)

Conference

ConferenceTwenty-Fifth International Joint Conference on Artificial Intelligence
Abbreviated titleIJCAI 2016
CountryUnited States
CityNew York
Period9/07/1615/07/16
Internet address

Fingerprint

Set theory
Planning

Cite this

Levi, L. HS., Franco, S., Abisrror, M., Barley, M., Zilles, S., & Holte, R. (2016). Heuristic subset selection in classical planning. In S. Kambhampati (Ed.), Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI-16) (pp. 3185-3195). AAAI press.
Levi, Lelis HS ; Franco, Santiago ; Abisrror, Marvin ; Barley, Mike ; Zilles, Sandra ; Holte, Robert. / Heuristic subset selection in classical planning. Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI-16). editor / Subbarao Kambhampati. AAAI press, 2016. pp. 3185-3195
@inproceedings{49bc074832e54dfeac612f9a26622d16,
title = "Heuristic subset selection in classical planning",
abstract = "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.",
author = "Levi, {Lelis HS} and Santiago Franco and Marvin Abisrror and Mike Barley and Sandra Zilles and Robert Holte",
year = "2016",
language = "English",
isbn = "9781577357704",
pages = "3185--3195",
editor = "Subbarao Kambhampati",
booktitle = "Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI-16)",
publisher = "AAAI press",

}

Levi, LHS, Franco, S, Abisrror, M, Barley, M, Zilles, S & Holte, R 2016, Heuristic subset selection in classical planning. in S Kambhampati (ed.), Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI-16). AAAI press, pp. 3185-3195, Twenty-Fifth International Joint Conference on Artificial Intelligence, New York, United States, 9/07/16.

Heuristic subset selection in classical planning. / Levi, Lelis HS; Franco, Santiago; Abisrror, Marvin; Barley, Mike; Zilles, Sandra; Holte, Robert.

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI-16). ed. / Subbarao Kambhampati. AAAI press, 2016. p. 3185-3195.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Heuristic subset selection in classical planning

AU - Levi, Lelis HS

AU - Franco, Santiago

AU - Abisrror, Marvin

AU - Barley, Mike

AU - Zilles, Sandra

AU - Holte, Robert

PY - 2016

Y1 - 2016

N2 - 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.

AB - 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.

UR - http://www.ijcai.org/Proceedings/2016

M3 - Conference contribution

SN - 9781577357704

SP - 3185

EP - 3195

BT - Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI-16)

A2 - Kambhampati, Subbarao

PB - AAAI press

ER -

Levi LHS, Franco S, Abisrror M, Barley M, Zilles S, Holte R. Heuristic subset selection in classical planning. In Kambhampati S, editor, Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI-16). AAAI press. 2016. p. 3185-3195