Machine-translated by Google. Questions are authored in English.
Top

Discussion

When does one heuristic dominate another?

  • A.When it is at least as large everywhere and both are admissible
  • B.When it can be computed more quickly than the other one
  • C.When it returns the exact cost at more states than the other
  • D.When it produces a shorter solution path than the other

Answer: A

If h2 is never smaller than h1 and both are admissible, h2 dominates and A star using it expands no more nodes, since every node h1 prunes is pruned by h2 as well. Dominance is therefore the natural ordering on heuristic quality. Computation speed matters practically and may outweigh dominance, exact values at particular states are incidental, and both produce optimal paths. An ordering that guarantees no loss of performance is a strong basis for choosing between alternatives.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.