Consequences of Monotonicity
Consistent heuristics are called monotone because the estimated final cost of a partial solution, is monotonically non-decreasing along the best path to the goal, where is the cost of the best path from start node to . It's necessary and sufficient for a heuristic to obey the triangle inequality in order to be consistent.
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 cycles). In fact, if the search graph is given cost for a consistent, then A* is equivalent to best-first search on that graph using Dijkstra's algorithm. 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.
Read more about this topic: Consistent Heuristic
Famous quotes containing the words consequences of and/or consequences:
“There is not much that even the most socially responsible scientists can do as individuals, or even as a group, about the social consequences of their activities.”
—Eric J. Hobsbawm (b. 1917)
“There is not much that even the most socially responsible scientists can do as individuals, or even as a group, about the social consequences of their activities.”
—Eric J. Hobsbawm (b. 1917)