Data Entry: Please note that the research database will be replaced by UNIverse by the end of October 2023. Please enter your data into the system https://universe-intern.unibas.ch. Thanks
Generalized Potential Heuristics for Classical Planning
Editor(s)
Kraus, Sarit
Book title (Conference Proceedings)
Proceedings of the 28th International Joint Conference on Artificial Intelligence
Place of Conference
Macao, China
Publisher
International Joint Conferences on Artificial Intelligence
Pages
5554-5561
ISSN/ISBN
978-0-9992411-4-1
Abstract
Generalized planning aims at computing solutions that work for all instances of the same domain. In this paper, we show that several interesting planning domains possess compact generalized heuristics that can guide a greedy search in guaranteed polynomial time to the goal, and which work for any instance of the domain . These heuristics are weighted sums of state features that capture the number of objects satisfying a certain first-order logic property in any given state. These features have a meaningful interpretation and generalize naturally to the whole domain. Additionally, we present an approach based on mixed integer linear programming to compute such heuristics automatically from the observation of small training instances. We develop two variations of the approach that progressively refine the heuristic as new states are encountered. We illustrate the approach empirically on a number of standard domains, where we show that the generated heuristics will correctly generalize to all possible instances.
