V Consider the following search space in which the goal is to find the p from S to G, next(S,A,5), next(S,B,2),next(A,G,5), next (B,D,1), next(B,C,2), next (C,G,2), next(D,G,5), where next(X,Y,Z) means that Y is a child of X and the cost of going from X to Y is Z. ho(S)=0, ho(A)=0, ho(B)=0, ho(C)=0, ho(D)=0, ho(G)=0, h₁(S)-5, h₁(A)=3, h₁(B)=4, h₁(C)=2, h₁ (D)=5, h₁(G)=0, h₂(S)=6, h₂(A)=5, h₂(B)=2, h₂(C)=5, h₂(D)=3, h₂(G)=0, 1. Which of the above heuristic functions ho,h1 and h2 are admissible? Give the solution of the longest path found by the A algorithm using the admissible heuristic function.
V Consider the following search space in which the goal is to find the p from S to G, next(S,A,5), next(S,B,2),next(A,G,5), next (B,D,1), next(B,C,2), next (C,G,2), next(D,G,5), where next(X,Y,Z) means that Y is a child of X and the cost of going from X to Y is Z. ho(S)=0, ho(A)=0, ho(B)=0, ho(C)=0, ho(D)=0, ho(G)=0, h₁(S)-5, h₁(A)=3, h₁(B)=4, h₁(C)=2, h₁ (D)=5, h₁(G)=0, h₂(S)=6, h₂(A)=5, h₂(B)=2, h₂(C)=5, h₂(D)=3, h₂(G)=0, 1. Which of the above heuristic functions ho,h1 and h2 are admissible? Give the solution of the longest path found by the A algorithm using the admissible heuristic function.
Related questions
Question
Transcribed Image Text:Q5/ Consider the following search space in which the goal is to find the p
from
S to G, next(S,A,5), next(S,B,2),next(A,G,5), next (B,D,1), next(B,C,2), next
(C,G,2), next(D,G,5), where next(X,Y,Z) means that Y is a child of X and the
cost of going from X to Y is Z.
ho(S)=0, ho(A)=0, ho(B)=0, ho(C)=0, ho(D)=0, ho(G)=0,
h₁(S)-5, h₁(A)=3, h₁(B)=4, h₁(C)=2, h₁(D)=5, h₁(G)=0,
h₂(S)=6, h₂(A)=5, h₂(B)=2, h₂(C)=5, h₂(D)=3, h₂(G)=0,
A. Which of the above heuristic functions ho,h1 and h2 are admissible?
Give the solution of the longest path found by the A algorithm using the
admissible heuristic function.
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 3 steps
