Arad 118 71 Oradea Zerind 151 75 140 Sibiu Fagaras 99 80 Rimnicu Vilcea Timisoara Neamt 口 87 Iasi 92 142 Vaslui 211 111 Pitesti Lugoj 97 70 98 Hirsova Mehadia 146 85 101 Urziceni 86 75 138 Bucharest Drobeta 120 90 Craiova Eforie Giurgiu Figure 3.2 A simplified road map of part of Romania. Arad 366 Mehadia 241 Bucharest 0 Neamt 234 Craiova 160 Oradea 380 Drobeta 242 Pitesti 100 Eforie 161 Rimnicu Vilcea 193 Fagaras 176 Sibiu 253 Giurgiu 77 Timisoara 329 Hirsova 151 Urziceni 80 Iasi 226 Vaslui 199 Lugoj 244 Zerind 374 Figure 3.22 Values of hSLD-straight-line distances to Bucharest. Using an A* search you are trying to find a path from Arad to Bucharest. The algorithm will begin by analyzing the nodes connected to Arad. As shown below, these are Sibiu, Timisoara, and Zerind. The straight-line distance from every city (node) to Bucharest is listed in the table below. Using this measurement as the heuristic calculate the total path cost to each of these cities and list them below. Use the evaluation function: where f(n) = g(n) + h(n) g(n) cost so far to reach node h(n) the straight line distance to Bucharest = Supply your answer in the following format: Sibiu: # Timisoara: # Zerind: # Finally, explain which node will be expanded next.
Arad 118 71 Oradea Zerind 151 75 140 Sibiu Fagaras 99 80 Rimnicu Vilcea Timisoara Neamt 口 87 Iasi 92 142 Vaslui 211 111 Pitesti Lugoj 97 70 98 Hirsova Mehadia 146 85 101 Urziceni 86 75 138 Bucharest Drobeta 120 90 Craiova Eforie Giurgiu Figure 3.2 A simplified road map of part of Romania. Arad 366 Mehadia 241 Bucharest 0 Neamt 234 Craiova 160 Oradea 380 Drobeta 242 Pitesti 100 Eforie 161 Rimnicu Vilcea 193 Fagaras 176 Sibiu 253 Giurgiu 77 Timisoara 329 Hirsova 151 Urziceni 80 Iasi 226 Vaslui 199 Lugoj 244 Zerind 374 Figure 3.22 Values of hSLD-straight-line distances to Bucharest. Using an A* search you are trying to find a path from Arad to Bucharest. The algorithm will begin by analyzing the nodes connected to Arad. As shown below, these are Sibiu, Timisoara, and Zerind. The straight-line distance from every city (node) to Bucharest is listed in the table below. Using this measurement as the heuristic calculate the total path cost to each of these cities and list them below. Use the evaluation function: where f(n) = g(n) + h(n) g(n) cost so far to reach node h(n) the straight line distance to Bucharest = Supply your answer in the following format: Sibiu: # Timisoara: # Zerind: # Finally, explain which node will be expanded next.
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
can you help me with this:
Transcribed Image Text:Arad
118
71
Oradea
Zerind
151
75
140
Sibiu
Fagaras
99
80
Rimnicu Vilcea
Timisoara
Neamt
口
87
Iasi
92
142
Vaslui
211
111
Pitesti
Lugoj
97
70
98
Hirsova
Mehadia
146
85
101
Urziceni
86
75
138
Bucharest
Drobeta
120
90
Craiova
Eforie
Giurgiu
Figure 3.2
A simplified road map of part of Romania.
Arad
366
Mehadia
241
Bucharest
0
Neamt
234
Craiova
160
Oradea
380
Drobeta
242
Pitesti
100
Eforie
161
Rimnicu Vilcea
193
Fagaras
176
Sibiu
253
Giurgiu
77
Timisoara
329
Hirsova
151
Urziceni
80
Iasi
226
Vaslui
199
Lugoj
244
Zerind
374
Figure 3.22
Values of hSLD-straight-line distances to Bucharest.
Transcribed Image Text:Using an A* search you are trying to find a path from Arad to Bucharest. The algorithm will begin
by analyzing the nodes connected to Arad. As shown below, these are Sibiu, Timisoara, and
Zerind. The straight-line distance from every city (node) to Bucharest is listed in the table below.
Using this measurement as the heuristic calculate the total path cost to each of these cities and
list them below. Use the evaluation function:
where
f(n) = g(n) + h(n)
g(n) cost so far to reach node
h(n) the straight line distance to Bucharest
=
Supply your answer in the following format:
Sibiu: #
Timisoara: #
Zerind: #
Finally, explain which node will be expanded next.
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 2 steps
Similar questions
Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education