Course contentsShow
Computer Science
Lesson 1010 of 2,87223. Shortest Path AlgorithmsPro lesson

Weighted A* and Suboptimality

Learn weighted A* using f(n) = g(n) + ε*h(n) to trade optimality for speed with bounded suboptimality.

This lesson is for subscribers

You've completed the free preview. Subscribe to unlock every lesson in every course.