UGC-NET | UGC NET CS 2018 July – II | Question 73

In heuristic search algorithms in Artificial Intelligence (AI), if a collection of admissible heuristics h ₁ …….h_m is available for a problem and none of them dominates any of the others, which should we choose?
(A) h(n)=max{h₁ (n),….,h _m (n)}
(B) h(n)=min{h₁(n),….,h_m (n)}
(C) h(n)=avg{h₁ (n),….,h_m (n)}
(D) h(n)=sum{h ₁ (n),….,h_m (n)}

Answer: (A)
Explanation: In heuristic search algorithms in Artificial Intelligence (AI), if a collection of admissible heuristics h ₁ …….h_m is available for a problem and none of them dominates any of the others then h(n)=max{h₁ (n),….,h _m (n)}.
For more information on heuristic search algorithm in Artificial Intelligence please Refer:
Option (A) is correct.
Quiz of this Question