For the nice formal properties to hold, we need h to satisfy a
few properties:
- Admissibility: For any node u,
. - Monotonicity (triangle inequality): For any pair of nodes u and
v,
. - Destination: h(t) = 0 (follows from admissibility).
Here are some useful definitions.
: shortest diverted path.
: estimated distance.
Next: Observations
Up: A*
Previous: Admissible Heuristic