4. (13 points) A*and Heuristics Consider the search state graph shown below, where S is a...

Transcribed Image Text:

4. (13 points) A*and Heuristics Consider the search state graph shown below, where S is a start state and G1 and G2 are goal states. S 3 G1 SABC G1 G2 0 0 0 0 0 0 h₁9 6 4 1 h₂ 0 0 0 0 h3 8 5 5 1 B G2 14 (a) (3 pts) Which heuristics are admissible (or write none)? (b) (3 pts) Which heuristics are consistent (or write none)? (c) (3 pts) For heuristic h₁, what order will nodes (paths) be added to the fringe in A*graph search? Present info as ((S), g+h= f), ((S-A-C), 12+1=13), etc. (d) (2 pts) For heuristic h₁, what order will states be added to the closed/explored set in A*graph? (e) (2 pts) For heuristic h₁, what path with A*graph search return? 4. (13 points) A*and Heuristics Consider the search state graph shown below, where S is a start state and G1 and G2 are goal states. S 3 G1 SABC G1 G2 0 0 0 0 0 0 h₁9 6 4 1 h₂ 0 0 0 0 h3 8 5 5 1 B G2 14 (a) (3 pts) Which heuristics are admissible (or write none)? (b) (3 pts) Which heuristics are consistent (or write none)? (c) (3 pts) For heuristic h₁, what order will nodes (paths) be added to the fringe in A*graph search? Present info as ((S), g+h= f), ((S-A-C), 12+1=13), etc. (d) (2 pts) For heuristic h₁, what order will states be added to the closed/explored set in A*graph? (e) (2 pts) For heuristic h₁, what path with A*graph search return?

Answer rating: 100% (QA)

The image contains a search state graph with nodes S A B C G1 and G2 along with associated heuristic values h1 h2 and h3 for each node This graph is used to answer questions regarding A heuristics abo... View the full answer