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 ?
1
h(n)=max{h1(n),....,hm(n)}
2
h(n)=min{h1(n),....,hm(n)}
3
h(n)=avg{h1(n),....,hm(n)}
4
h(n)=sum{h1(n),....,hm(n)}