Question 2 Given the following search graph, write the sequence of node numbers in the search agenda across the search life-time and using A* search. €4 1 2 3 4 5 6 197 C3 €5 €6 569 Assume the following heuristic value per node: Node ID Node Heuristic value 542 569 133 10 161 197 346 44897 Assume distance between cities are as mentioned on the links Apply A* algorithm showing intermediate values for the Agenda, g(n), h(n) Source city is :C5 Destination city:C4 €2 240
Question 2 Given the following search graph, write the sequence of node numbers in the search agenda across the search life-time and using A* search. €4 1 2 3 4 5 6 197 C3 €5 €6 569 Assume the following heuristic value per node: Node ID Node Heuristic value 542 569 133 10 161 197 346 44897 Assume distance between cities are as mentioned on the links Apply A* algorithm showing intermediate values for the Agenda, g(n), h(n) Source city is :C5 Destination city:C4 €2 240
Related questions
Question
Transcribed Image Text:Question 2
Given the following search graph, write the sequence of node numbers in the search
agenda across the search life-time and using A* search.
€4
1
2
3
4
5
6
542
569
133
497
0
161
197
*C3
€5
€6
Assume the following heuristic value per node:
Node ID Node Heuristic value
569
346
44897
240
€1
Assume distance between cities are as mentioned on the links
Apply A* algorithm showing intermediate values for the Agenda, g(n), h(n)
Source city is :C5
Destination city:C4
|||
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 7 images
