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 1 …….hm is available for a problem and none of them dominates any of the others, which should we choose?
(A) h(n)=max{h1 (n),….,h m (n)}
(B) h(n)=min{h1(n),….,hm (n)}
(C) h(n)=avg{h1 (n),….,hm (n)}
(D) h(n)=sum{h 1 (n),….,hm (n)}


Answer: (A)

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

Quiz of this Question



My Personal Notes arrow_drop_up


Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.