Paper ID: 2310.19463

Optimize Planning Heuristics to Rank, not to Estimate Cost-to-Goal

Leah Chrestien, Tomás Pevný, Stefan Edelkamp, Antonín Komenda

In imitation learning for planning, parameters of heuristic functions are optimized against a set of solved problem instances. This work revisits the necessary and sufficient conditions of strictly optimally efficient heuristics for forward search algorithms, mainly A* and greedy best-first search, which expand only states on the returned optimal path. It then proposes a family of loss functions based on ranking tailored for a given variant of the forward search algorithm. Furthermore, from a learning theory point of view, it discusses why optimizing cost-to-goal \hstar\ is unnecessarily difficult. The experimental comparison on a diverse set of problems unequivocally supports the derived theory.

Submitted: Oct 30, 2023