Answered step by step
Verified Expert Solution
Question
1 Approved Answer
You want to reduce the memory used by A*. You come up with the following idea: you keep in the queue only the N best
You want to reduce the memory used by A*. You come up with the following idea: you keep in the queue only the N best nodes (i.e, the nodes with lower costs), for some positive value of N. When the queue is full and a new node has to be stored, the worst node is deleted from the queue and removed from consideration.
- If an admissible heuristic is used, will the modified algorithm find the optimal solution? Explain why (or why not). Are there any additional constraints?
- If a perfect heuristic is used, i.e. for all n h(n)=h*(n), where h*(n) is the cost of the optimal path from n to goal, will the modified algorithm find the optimal solution? Explain.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started