Michael Fink

Learn More
In this paper we learn heuristic functions that efficiently find the shortest path between two nodes in a graph. We rely on the fact that often, several elementary admissible heuristics might be provided , either by human designers or from formal domain abstractions. These simple heuris-tics are traditionally composed into a new admissible heuristic by(More)
  • 1