UGCNET-July-2018-II: 73
In heuristic search algorithms in Artificial Intelligence (AI), if a collection of admissible heuristics $h_1 \dots h_m$ is available for a problem and none of them dominates any of the others, which should we choose? $h(n)=max\{h_1(n), \dots , h_m(n)\}$ $h(n)=min\{h_1(n), \dots , h_m(n)\}$ $h(n)=avg\{h_1(n), \dots , h_m(n)\}$ $h(n)=sum\{h_1(n), \dots , h_m(n)\}$
In heuristic search algorithms in Artificial Intelligence (AI), if a collection of admissible heuristics $h_1 \dots h_m$ is available for a problem and none of them dominates any of the others, which should we choose? $h(n)=max\{h_1(n), \dots , h_m(n)\}$ $h(n)=min\{h_1(n), \dots , h_m(n)\}$ $h(n)=avg\{h_1(n), \dots , h_m(n)\}$ $h(n)=sum\{h_1(n), \dots , h_m(n)\}$
asked
Jul 13, 2018
in Artificial Intelligence
Pooja Khatri
888 views