A* search

Applies to: general, robotics

A* is graph search that orders nodes by cost-so-far plus a heuristic estimate to the goal.

f(n) = g(n) + h(n)

See also: graph, priority-queue, dijkstra