Advanced · Research
Consistent heuristic
Visual diagram · (in preparation) · Math · (in preparation) · Worked example · 3 difficulty levels.
TL;DR. A consistent heuristic in AI pathfinding ensures that its estimated cost to the goal never overestimate the actual cost from any neighboring state.
Technical Definition
A consistent heuristic in AI pathfinding ensures that its estimated cost to the goal never overestimate the actual cost from any neighboring state.
How it works
In artificial intelligence, specifically in search algorithms like A*, a heuristic function is considered consistent (or monotone) if it satisfies a specific inequality. It guarantees that the estimated cost from a node to the goal is always less than or equal to the cost of moving to a neighbor plus the neighbor's estimated cost to the goal. This property ensures that A* search is optimal and efficient.
Related Concepts
- Artificial intelligence (AI) — Machines that can perform tasks typically requiring human intelligence.
- Pathfinding — The process of automatically determining the shortest or most efficient route between two points, often in a graph or map.