Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

This homework is to be completed on paper using pen/pencil and demonstrating all steps of the search process. This is not a programming assignment. You

image text in transcribed
image text in transcribed
This homework is to be completed on paper using pen/pencil and demonstrating all steps of the search process. This is not a programming assignment. You should upload a pdf file containing the scanned version of your solutions. Consider the Traveling Salesperson Problem for the following cities (nodes) and distances of roads (edges) connecting them. Our goal is to find a tour through all the cities starting from city ' A ' and ending at any other city. The salesperson does not need to return to A at the end of the trip. We want to find the optimal tour by using the A search algorithm. We formulate our search problem as follows: - A State is represented by a partial tour of the cities that starts from city A. For example, the start state is (A). By expanding the start state, we get two possible states (AB) and (AH). And when we expand the state (AB), we get the states (ABA), ( ABC),(ABH), and ( ABJ). Any tour in which a city is repeated is an invalid state (partial tour) and must be excluded from the search. So, (ABA) is not a valid state because is repeats the city A. - The cost of arriving at a state n,(g(n)), is the cost of traversing the partial tour in ' n '. So, g(A) is 0;g(AB) is 16,g(AH) is 18 , and g(ABC) is 26. - All successors of states (children nodes in the search tree) are those states that can be formed by adding one more city at the end of the tour that is directly reachable from the last city mentioned in the parent state's tour. - Heuristic function h1(n) is computed as follows: Take all the cities that are not included in the state at node n and include all the edges that connect these remaining cities. Find the minimum cost spanning tree (MCST) of this graph and then find the total cost of the edges included in the MCST. This total is the estimated cost of the reaching the goal state from the state at node n. - Heuristic function h2(n) is computed as follows: Take all the cities that are not included in the state at node n and include all the edges that connect these remaining cities. Find the minimum edge cost in this remaining graph, and multiply it with (k1) where k is the number of cities in this remaining tree. - The goal state is the tour that includes all the nine cities. (5) Are h1(n) and h2(n) admissible heuristic functions? Give reasons to justify your answers

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Database Security XI Status And Prospects

Authors: T.Y. Lin, Shelly Qian

1st Edition

0412820900, 978-0412820908

More Books

Students also viewed these Databases questions

Question

Evaluate the integrals in Problems 1332. [ 2 (6 - x) dx

Answered: 1 week ago

Question

What is the cerebrum?

Answered: 1 week ago

Question

List the advantages and disadvantages of the pay programs. page 505

Answered: 1 week ago