Consistent heuristic

Type of heuristic in path-finding problems

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 neighbouring vertex to the goal, plus the cost of reaching that neighbour.

This keyword could refer to multiple things. Here are some suggestions: