EXAMPLE: Suppose we want to use the A* algorithm on the graph below to find the shortest path from node S to node G. Each node is labeled by a capital letter and the value of a heuristic function. Each edge is labeled by the cost to traverse that edge. A, h=4 C, h=4 E, h=1 3 3 S, h=6 1 1 G, h=0 3 B, h=4 D, h=3.5 F, h=1 Perform the A* algorithm on this graph, filling in the table below. Indicate the f, g, and h values of each node on the queue as shown in the first two rows of the table. You need not write the contents of the (priority) queue in order in the table. Assume that if you find a path to a node already on the queue that you update its cost (using the lower f value) instead of adding another copy of that node to the queue. Show the path found by the A* algorithm on the graph above. 2.
EXAMPLE: Suppose we want to use the A* algorithm on the graph below to find the shortest path from node S to node G. Each node is labeled by a capital letter and the value of a heuristic function. Each edge is labeled by the cost to traverse that edge. A, h=4 C, h=4 E, h=1 3 3 S, h=6 1 1 G, h=0 3 B, h=4 D, h=3.5 F, h=1 Perform the A* algorithm on this graph, filling in the table below. Indicate the f, g, and h values of each node on the queue as shown in the first two rows of the table. You need not write the contents of the (priority) queue in order in the table. Assume that if you find a path to a node already on the queue that you update its cost (using the lower f value) instead of adding another copy of that node to the queue. Show the path found by the A* algorithm on the graph above. 2.
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
100%
can you mak a sloution as table like this example
![EXAMPLE on A* ALGORITHM (cont.)
EXAMPLE: Use A* search algorithm to find the solution.
Initial state: S, Goal state: G, or G,
node h(n) node h(n) |node | h(n)
A
11
D
8.
H
7
В
E
4
I
3
4
C
F
2
A) g(A)=4
B g(B)=1
Solution:
2,
2
g(E)=2
1.
It.
Node
Priority queue
g(F)=3
expanded
F
S=0
g(C)=1
g(D)=2
4
2,
1
1
А315, В36
В
E=7, F=6, A=15
g(H)=4 H
g(I)=2
I=9, G2=5, E=7,
A=15
F
g(G,)=3
g(G2)=1
G2
S, B,F, G2
4
G2](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F95dbe5c7-09dd-489f-afc6-3825865a235f%2Fe9085e59-5a83-4633-af3e-79213c0cc943%2F53k9qfs_processed.png&w=3840&q=75)
Transcribed Image Text:EXAMPLE on A* ALGORITHM (cont.)
EXAMPLE: Use A* search algorithm to find the solution.
Initial state: S, Goal state: G, or G,
node h(n) node h(n) |node | h(n)
A
11
D
8.
H
7
В
E
4
I
3
4
C
F
2
A) g(A)=4
B g(B)=1
Solution:
2,
2
g(E)=2
1.
It.
Node
Priority queue
g(F)=3
expanded
F
S=0
g(C)=1
g(D)=2
4
2,
1
1
А315, В36
В
E=7, F=6, A=15
g(H)=4 H
g(I)=2
I=9, G2=5, E=7,
A=15
F
g(G,)=3
g(G2)=1
G2
S, B,F, G2
4
G2
![EXAMPLE: Suppose we want to use the A* algorithm on the graph below
to find the shortest path from node S to node G. Each node is labeled by
a capital letter and the value of a heuristic function. Each edge is labeled
by the cost to traverse that edge.
A, h=4
C, h=4
E, h=1
3
3
2,
2
S, h=6
1
1
G, h=0
3
2
B, h=4
D, h=3.5
F, h=1
Perform the A* algorithm on this graph, filling in the table below. Indicate the f,
g, and h values of each node on the queue as shown in the first two rows of the
table. You need not write the contents of the (priority) queue in order in the
table.
Assume that if you find a path to a node already on the queue that you update
its cost (using the lower f value) instead of adding another copy of that node to
the queue. Show the path found by the A* algorithm on the graph above.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F95dbe5c7-09dd-489f-afc6-3825865a235f%2Fe9085e59-5a83-4633-af3e-79213c0cc943%2Fid48z8_processed.png&w=3840&q=75)
Transcribed Image Text:EXAMPLE: Suppose we want to use the A* algorithm on the graph below
to find the shortest path from node S to node G. Each node is labeled by
a capital letter and the value of a heuristic function. Each edge is labeled
by the cost to traverse that edge.
A, h=4
C, h=4
E, h=1
3
3
2,
2
S, h=6
1
1
G, h=0
3
2
B, h=4
D, h=3.5
F, h=1
Perform the A* algorithm on this graph, filling in the table below. Indicate the f,
g, and h values of each node on the queue as shown in the first two rows of the
table. You need not write the contents of the (priority) queue in order in the
table.
Assume that if you find a path to a node already on the queue that you update
its cost (using the lower f value) instead of adding another copy of that node to
the queue. Show the path found by the A* algorithm on the graph above.
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 3 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education