Consider the following map and the straight-line distance to the city entitled “M” from every other city. Find the shortest path from “A” to “M” using A* searching algorithm. Draw the tree structure and trace algorithm using open and closed list. Also state the shortest route with cost. H(n) value of each city is given in the following table. To calculate the final f(n) of each city use the following formula except city M. g(n)=Straight line distance(n)+last two digits of your registration number i-e 58 F(n)=g(n) + H(n) Heuristic value H(n) of each city given in the following table A B C D E F G H I J K L M 223 222 166 192 165 136 122 111 100 60 32 102 0
Consider the following map and the straight-line distance to the city entitled “M” from every other city. Find the shortest path from “A” to “M” using A* searching algorithm. Draw the tree structure and trace algorithm using open and closed list. Also state the shortest route with cost. H(n) value of each city is given in the following table. To calculate the final f(n) of each city use the following formula except city M. g(n)=Straight line distance(n)+last two digits of your registration number i-e 58 F(n)=g(n) + H(n) Heuristic value H(n) of each city given in the following table A B C D E F G H I J K L M 223 222 166 192 165 136 122 111 100 60 32 102 0
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Consider the following map and the straight-line distance to the city entitled “M” from every other city. Find the shortest path from “A” to “M” using A* searching
H(n) value of each city is given in the following table. To calculate the final f(n) of each city use the following formula except city M.
g(n)=Straight line distance(n)+last two digits of your registration number i-e 58
F(n)=g(n) + H(n)
Heuristic value H(n) of each city given in the following table
|
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
|
223 |
222 |
166 |
192 |
165 |
136 |
122 |
111 |
100 |
60 |
32 |
102 |
0 |
Transcribed Image Text:(START)
A
36
61
31
80
32
D
52
31
E
102
112
43
K
122
32
H.
M
36
40
(END)
45
20
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 with 1 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY