Heuristic Search for Route Finding
Route finding is a good example for heuristic search because an excellent
heuristic function exists: straight-line (or great-circle) distance
between points. This heuristic function has the features:
- It is easily computed.
- It is non-overestimating; therefore, the lowest-cost solution
is guaranteed to be found.
- It is powerful (good estimate of true cost).
Contents
Page-10
Prev
Next
Page+10
Index