Consistent heuristic
en construction
Définition
...
Français
...
Anglais
Consistent heuristic
In the study of path-finding problems in artificial intelligence, a heuristic function is said to be consistent, or monotone, if its estimate is always less than or equal to the estimated distance from any neighboring vertex to the goal, plus the cost of reaching that neighbor.
Contributeurs: wiki
