6 Question 6 (Informed Search) 6.1 Use Start state = A and goal state = K. Perform a Greedy search on the graph below and answer the following questions: [18] Heuristic values for reaching the goal state K A 22 B 20 C 18 D 17 E 15 F 8 G 11 H 9 I 10 J 4 K 0 L 1 M 5 6.1.1 Show all the steps in a table with the following headings: Step # Current node Open list Closed list Cost (9) 6.1.2 What is the path from the start to the goal? What is the real cost of that path? Is this guaranteed to be the shortest path? (3) 6.2 Why is heuristic search often chosen instead of depth-first or breadth-first search? (1) 6.3 Now consider the A* search algorithm for the same start state and goal state 6.3.1 Explain how the A* algorithm can make more informed decisions. (2) 6.3.2 Is the A* algorithm guaranteed to find the shortest path? (1) 6.3.3 Why can the A* algorithm not use the heuristic values as given in this example? (2)
Added by Erica P.
Close
Step 1
The heuristic values indicate an estimate of the cost from any node to the goal. We start with the start state A. Show more…
Show all steps
Your feedback will help us improve your experience
Lien Le and 92 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
You are given below a state-space graph that consists of nine states, the costs of the connections between them, and a heuristic, h(n), for each state. Your task is to find a path from start state S to goal state F. In order to find a solution path, one can use a number of different search methods. In the following questions, you are to find the path from S to F that the search algorithm given in the question would yield. 1.1 Using Depth First Search algorithm, please present the path from start state to the goal state. Expand the successors of a node in alphabetical order (e.g., if a node has 3 successors, A, B, and C, then A will be expanded before B, and B will be expanded before C). Show the search tree to find this solution 1.2 Using Breadth First Search algorithm, please present the path from start state to the goal state. Expand the successors of a node in alphabetical order (e.g., if a node has 3 successors, A, B, and C, then A will be expanded before B, and B will be expanded before C). Show the search tree to find this solution 1.3 Using Greedy Algorithm, please present the path from start state to the goal state. Show the search tree to find this solution 1.4 Using A* search algorithm, please present the path from start state to the goal state. Find the search tree to find this solution.
Akash M.
Subject: Artificial Intelligence. Consider the search problem below with start state S and goal state G. The transition costs are next to the edges, and the heuristic values are next to the states. Question 1: If we use Depth First Search, and it terminates as soon as it reaches the goal state, what is the final path for this DFS search? If a node has multiple successors, then we always expand the successors in increasing alphabetical order.
Sri K.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Watch the video solution with this free unlock.
EMAIL
PASSWORD