Learning heuristics for A*

Danilo Numeroso, Davide Bacciu, Petar Veličković

Path finding in graphs is one of the most studied classes of problems in computer science. In this context, search algorithms are often extended with heuristics for a more efficien…