- Trivially, on a straight line, A* and greedy best-first do equivalent. GBFS will often find the lowest cost path, A* will ALWAYS find the lowest-cost path, so it can't compete that way. A* is faster than breadth first search and more optimal than greedy best-first search. So it sounds perfect, and a lot of people treat it that way. Still, nothing is free, and optimality comes at a cost. And in the some situations, that cost might be quite large (as in orders of magnitude). If you're having a hard time visualizing what those situations might be, i posted a path planning tool (see earlier forum post) where you can compare the algorithms on maps you create (or use the ones that come with it)
Best-first search - Wikipedia, the free encyclopedia
- Some authors have used "best-first search" to refer specifically to a search with a heuristic that attempts to predict how close the end of a path is to a solution, so that paths which are judged to be closer to a solution are extended first. This specific type of search is called greedy best-first search.[2]
Posted from Diigo. The rest of my favorite links are here.
