Learning (to improve) Optimal LP based planning heuristics
||Learning (to improve) Optimal LP based planning heuristics|
||SNIC Small Compute|
||Paul Höft <firstname.lastname@example.org>|
||2022-11-07 – 2023-12-01|
We plan to use the resources to explore and classify the generalization capabilities of Linear Programm based planning heuristics over systematically generated pattern heuristics. Previous results of ours show that heuristics based on linear programs have an exploitable generalization. Our goal is to use Machine Learning to predict the reusability of these heuristics to speed up the computation of existing classical planning heuristics. We further plan to extend that approach to reinforcement learning techniques.