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

Formally, for every node N and each successor P of N, the estimated cost of reaching the goal from N is no greater than the step cost of getting to P plus the estimated cost of reaching the goal from P. That is:

${\displaystyle h(N)\leq c(N,P)+h(P)}$ and

${\displaystyle h(G)=0.\,}$

where

• h is the consistent heuristic function
• N is any node in the graph
• P is any descendant of N
• G is any goal node
• c(N,P) is the cost of reaching node P from N

Informally, every node i will give an estimate that, accounting for the cost to reach the next node, is always lesser than the estimate at node i+1.

A consistent heuristic is also admissible, i.e. it never overestimates the cost of reaching the goal (the converse, however, is not always true). Assuming non negative edges, this can be easily proved by  induction.^[1]

Let ${\displaystyle h(N_{0})=0}$ be the estimated cost for the goal node. This implies that the base condition is trivially true as 0 ≤ 0. Since the heuristic is consistent, ${\displaystyle h(N_{i+1})\leq c(N_{i+1},N_{i})+h(N_{i})\leq c(N_{i+1},N_{i})+c(N_{i},N_{i-1})+...+c(N_{1},N_{0})+h(N_{0})}$ by expansion of each term. The given terms are equal to the true cost, ${\displaystyle \sum _{i=1}^{n}c(N_{i},N_{i-1})}$, so any consistent heuristic is also admissible since it is upperbounded by the true cost.

The converse is clearly not true as we can always construct a heuristic that is always below the true cost but is nevertheless inconsistent by, for instance, increasing the heuristic estimate from the farthest node as we get closer and, when the estimate ${\displaystyle h(N_{i})}$ becomes at most the true cost ${\displaystyle h^{*}(N_{i})}$, we make ${\displaystyle h(N_{i-1})=h(N_{i})-c(N_{i},N_{i-1})}$.

Consequences of monotonicity

Consistent heuristics are called monotone because the estimated final cost of a partial solution, ${\displaystyle f(N_{j})=g(N_{j})+h(N_{j})}$ is monotonically non-decreasing along any path, where ${\displaystyle g(N_{j})=\sum _{i=2}^{j}c(N_{i-1},N_{i})}$ is the cost of the best path from start node ${\displaystyle N_{1}}$ to ${\displaystyle N_{j}}$. It's necessary and sufficient for a heuristic to obey the triangle inequality in order to be consistent.^[2]

In the A* search algorithm, using a consistent heuristic means that once a node is expanded, the cost by which it was reached is the lowest possible, under the same conditions that Dijkstra's algorithm requires in solving the shortest path problem (no negative cost edges). In fact, if the search graph is given cost ${\displaystyle c'(N,P)=c(N,P)+h(P)-h(N)}$ for a consistent ${\displaystyle h}$, then A* is equivalent to best-first search on that graph using Dijkstra's algorithm.^[3] In the unusual event that an admissible heuristic is not consistent, a node will need repeated expansion every time a new best (so-far) cost is achieved for it.

If the given heuristic ${\displaystyle h}$ is admissible but not consistent, one can artificially force the heuristic values along a path to be monotonically non-decreasing by using

${\displaystyle h'(P)\gets \max(h(P),h'(N)-c(N,P))}$

as the heuristic value for ${\displaystyle P}$ instead of ${\displaystyle h(P)}$, where ${\displaystyle N}$ is the node immediately preceding ${\displaystyle P}$ on the path and ${\displaystyle h'(start)=h(start)}$. This idea is due to László Mérō^[4] and is now known as pathmax. Contrary to common belief, pathmax does not turn an admissible heuristic into a consistent heuristic. For example, if A* uses pathmax and a heuristic that is admissible but not consistent, it is not guaranteed to have an optimal path to a node when it is first expanded.^[5]

See also

• Admissible heuristic

References

This page was last edited on 3 March 2024, at 04:06