Question

Let h1(s) be an admissible A* heuristic. Let h2(s)=2*h1(s)

  1. Is the solution found by A* tree search with h2 guaranteed to be an optimal solution? Justify your answer
  2. Is the solution found by A* tree search with h2 guaranteed to have a cost at most twice as much as the optimal path? Justify your answer
  3. Consider the state space graph shown below in which some of the states are missing a heuristic value. Determine the possible range for each missing heuristic value so that the heuristic is admissible and consistent. If this isn’t possible write so

QUESTION 2 Let h(s) be an admissible A* heuristic. Let h2(s) = 2 h;(s) optimal solution? Justify (a) Is the solution found by

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Question 2 а) Solution False Explanation In h2 is not a guaranteed process to an optimal solution because only one side oftheSuch that g h0 g 2h1 <2(gh1)2C For C is the optimal cost Therefore g can be found path is twice then that of optimal path 2CFor s D Heuristic (D) c(D, G) heuristic (G) heuristic (D) <3 heuristic (B)c(B, D) heuristic (D) - 0heuristic (D) heuristic (F

Add a comment
Know the answer?
Add Answer to:
Let h1(s) be an admissible A* heuristic. Let h2(s)=2*h1(s) Is the solution found by A* tree...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT