In heuristic search algorithms in Artificial Intelligence (AI), i
In heuristic search algorithms in Artificial Intelligence (AI), if a collection of admissible heuristics h1.......hm is available for a problem and none of them dominates any of the others, which should we choose ?
A. h(n)=max{h<sub>1</sub>(n),....,h<sub>m</sub>(n)}
B. h(n)=min{h<sub>1</sub>(n),....,h<sub>m</sub>(n)}
C. h(n)=avg{h<sub>1</sub>(n),....,h<sub>m</sub>(n)}
D. h(n)=sum{h<sub>1</sub>(n),....,h<sub>m</sub>(n)}
Please scroll down to see the correct answer and solution guide.
Right Answer is: A
SOLUTION
Concept:
Heuristic search refers to a search strategy that attempts to optimize a problem by iteratively improving the solution based on a given heuristic function or cost measure. Several commonly used heuristic search methods include hill climbing, best first search, A* algorithm, simulated annealing.
Explanation:
Real valued hash function are used as a means for constraining search in combinatorial large problem spaces. A strategy is considered to be a function which for a given state in some problem domain returns sequences of states over the problem domain.
A heuristic function h(n) finds the cost of cheapest path from a node to the goal node.
- The function h(n) is an underestimate if h(n) is less than or equal to the actual cost of a lowest cost path from a node to the goal node
- The heuristic value of a path is the heuristic value of the node at the end of the path.
- Two ways are there to use the heuristic function: one is for heuristic depth first search and another for best first search
- If heuristic function h(n) = max{h1(n),....,hm(n)}, then a collection of admissible heuristics h1.......hm is available for a problem and none of them dominates any of the others.
- Composite heuristic function dominates all of its component functions and is consistent if none of the components overestimates.