Path planning for a * algorithm
no vote
If an evaluation function can find the shortest path, we call it admissibility. A * algorithm is the best one that can be adopted. The evaluation function of a * algorithm can be expressed as: F '(n) = g' (n) + H '(n)