Bonet, Blai; Geffner, Héctor
(Association for the Advancement of Artificial Intelligence (AAAI), 2012)
In the presence of non-admissible heuristics, A* and other best-first algorithms can be converted into anytime optimal algorithms over OR graphs, by simply continuing the search after the first solution is found. The same ...