Learning Heuristic Selection with Dynamic Algorithm Configuration
Proceedings of the International Conference on Automated Planning and Scheduling · 17.05.2021 · 31 · 597-605
DOI: 10.1609/icaps.v31i1.16008 ↗Kurz gefasst
Fachartikel in der Zeitschrift Proceedings of the International Conference on Automated Planning and Scheduling, online erschienen am 17.05.2021. Verfasst von David Speck und 4 weiteren Autor:innen. Die Arbeit wurde bisher 15-mal zitiert (Crossref).
Abstract (Originalsprache)
A key challenge in satisficing planning is to use multiple heuristics within one heuristic search. An aggregation of multiple heuristic estimates, for example by taking the maximum, has the disadvantage that bad estimates of a single heuristic can negatively affect the whole search. Since the performance of a heuristic varies from instance to instance, approaches such as algorithm selection can be successfully applied. In addition, alternating between multiple heuristics during the search makes it possible to use all heuristics equally and improve performance. However, all these approaches ignore the internal search dynamics of a planning system, which can help to select the most useful heuristics for the current expansion step. We show that dynamic algorithm configuration can be used for dynamic heuristic selection which takes into account the internal search dynamics of a planning system. Furthermore, we prove that this approach generalizes over existing approaches and that it can exponentially improve the performance of the heuristic search. To learn dynamic heuristic selection, we propose an approach based on reinforcement learning and show empirically that domain-wise learned policies, which take the internal search dynamics of a planning system into account, can exceed existing approaches.
Zitieren
APA
Speck, D., Biedenkapp, A., Hutter, F., Mattmüller, R., & Lindauer, M. (2021). Learning Heuristic Selection with Dynamic Algorithm Configuration. Proceedings of the International Conference on Automated Planning and Scheduling, 31, 597-605. https://doi.org/10.1609/icaps.v31i1.16008
Vancouver
Speck D, Biedenkapp A, Hutter F, Mattmüller R, Lindauer M. Learning Heuristic Selection with Dynamic Algorithm Configuration. Proceedings of the International Conference on Automated Planning and Scheduling. 2021;31:597-605. doi:10.1609/icaps.v31i1.16008
BibTeX
@article{Speck2021,
author = {Speck, David and Biedenkapp, André and Hutter, Frank and Mattmüller, Robert and Lindauer, Marius},
title = {Learning Heuristic Selection with Dynamic Algorithm Configuration},
journal = {Proceedings of the International Conference on Automated Planning and Scheduling},
year = {2021},
volume = {31},
pages = {597--605},
doi = {10.1609/icaps.v31i1.16008}
}
EUVIMED