@inproceedings{e8a0ac4f4d1b482da59fb73adbdc80c1,
title = "Learning and Exploiting Progress States in Greedy Best-First Search",
abstract = "Previous work introduced the concept of progress states. After expanding a progress state, a greedy best-first search (GBFS) will only expand states with lower heuristic values. Current methods can identify progress states only for a single task and only after a solution for the task has been found. We introduce a novel approach that learns a description logic formula characterizing all progress states in a classical planning domain. Using the learned formulas in a GBFS to break ties in favor of progress states often significantly reduces the search effort.",
author = "Patrick Ferber and Liat Cohen and Jendrik Seipp and Thomas Keller",
note = "Publisher Copyright: {\textcopyright} 2022 International Joint Conferences on Artificial Intelligence. All rights reserved.; 31st International Joint Conference on Artificial Intelligence, IJCAI 2022 ; Conference date: 23-07-2022 Through 29-07-2022",
year = "2022",
language = "אנגלית",
series = "IJCAI International Joint Conference on Artificial Intelligence",
pages = "4740--4746",
editor = "{De Raedt}, Luc and {De Raedt}, Luc",
booktitle = "Proceedings of the 31st International Joint Conference on Artificial Intelligence, IJCAI 2022",
}