A class of search algorithms in artificial intelligence that use domain-specific heuristic knowledge to guide exploration of the search space, reducing computational cost compared to uninformed search. Canonical examples include A* and greedy best-first search, which evaluate states using an estimate of the remaining cost to a goal.
Semantic Classification
Content
Overview
Informed Search represents an abstract concept in the ai ontology hierarchy.