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

Discussion

What does uniform cost search expand first?

  • A.The frontier node with the lowest path cost from the start
  • B.The frontier node at the shallowest depth in the tree
  • C.The frontier node estimated to be closest to the goal
  • D.The frontier node generated most recently by the algorithm

Answer: A

Ordering the frontier by the cost of the path from the start makes the search expand cheap paths first, which guarantees optimality with any non-negative step costs. Shallowest is breadth first, an estimate to the goal would be a heuristic, and most recent is depth first. Uniform cost is Dijkstra's algorithm arrived at from the search direction, and recognising them as the same algorithm connects two literatures.

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

Post your comment

Please log in or register to post a comment.