bn:00259807n
Noun Concept
Categories: Artificial intelligence, Heuristics
EN
admissible heuristic  admissible heuristics  Inadmissible heuristic  Optimistic heuristic
EN
In computer science, specifically in algorithms related to pathfinding, a heuristic function is said to be admissible if it never overestimates the cost of reaching the goal, i.e. the cost it estimates to reach the goal is not higher than the lowest possible cost from the current point in the path. Wikipedia
Definitions
Relations
Sources
EN
In computer science, specifically in algorithms related to pathfinding, a heuristic function is said to be admissible if it never overestimates the cost of reaching the goal, i.e. the cost it estimates to reach the goal is not higher than the lowest possible cost from the current point in the path. Wikipedia