1 citations · 1 across the 3 of their papers we have counts for
3 papers
Optimize Planning Heuristics to Rank, not to Estimate Cost-to-Goal
Leah Chrestien, Tomás Pevný, Stefan Edelkamp +1
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 condi…
A Differentiable Loss Function for Learning Heuristics in A*
Leah Chrestien, Tomas Pevny, Antonin Komenda +1
Optimization of heuristic functions for the A* algorithm, realized by deep neural networks, is usually done by minimizing square root loss of estimate of the cost to goal values. T…
Heuristic Search Planning with Deep Neural Networks using Imitation, Attention and Curriculum Learning
Leah Chrestien, Tomas Pevny, Antonin Komenda +1
Learning a well-informed heuristic function for hard task planning domains is an elusive problem. Although there are known neural network architectures to represent such heuristic…