Question: Question 5 - ( mathbf { A } ^ { * } ) - search. Given the search space on fig. 1

Question 5-\(\mathbf{A}^{*}\)-search. Given the search space on fig. 1, where \(\mathbf{S}\) is the initial state and \( G 1\) and \( G 2\) satisfy the goal test. Arcs are labeled with the cost of traversing them (so lower is better)
Figure 1: State space for search problems
and the estimated cost to a goal (i.e. value of heuristic function) is reported inside nodes. For \(\mathrm{A}^{*}\) search of state space given on fig. 1 answer the following questions
1.(\(25\%\) of the credit) Which goal will be reached?
2.(\(25\%\) of the credit) What is the state of the node that will be expanded (popped off frontier)\(4^{\text {th }}\)?(note that every node popped off the frontier counts)
3.(\(50\%\) of the credit) Show what is the contents of the frontier (i.e. show in correct order all nodes) after expansion of \(4^{\text {th }}\) node. Recall that a node in frontier is a 4-tuple (state, parent-state, value of cost function \( g \), value of evaluation function \( f \)). FOR EACH NODE IN FRONIER ALL COMPONENTS MUST BE SHOWN.
Question 5 - \ ( \ mathbf { A } ^ { * } \ ) -

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!