Discuss the possible advantages of the following state-space search strategy: obtain by some method a path to
Fantastic news! We've Found the answer you've been seeking!
Question:
Discuss the possible advantages of the following state-space search strategy: obtain by some method a path to a goal node and its associated cost f(Goal)=C. This cost is not necessarily minimal but it gives an upper bound on the minimal cost. Now use A* with an admissible h function and discard immediately any frontier nodes reached whose f values are greater than C.
- Explain if the modified A* algorithm with this strategy is guaranteed to find an optimal solution if one exists or not. Be precise.
- Explain if the fact that the algorithm discards some of the rrontier nodes (i.e. nodes in the frontier) means that fewer nodes are expanded. Be short but precise.
- Does this strategy reduce the total storage requirements? Explain your reasoning.
Related Book For
Purchasing and Supply Chain Management
ISBN: 978-1285869681
6th edition
Authors: Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. Patterson
Posted Date: