Artificial Intelligence
**Planning with Iterated Widening**
Let’s compare against a dedicated planning algorithm, ratherthan applying graph search naively.
Planning domains have some significant differences from generalgraph search problems—let’s reflect on what they might be.
11. In graph search, what is the goal of a search? How is thatdifferent from the goal of a planning problem?
12. In graph search, what are the preconditions for traversing anedge? How does this differ in a planning problem?
13. In graph search, detecting cycles is relatively cheap. Is thatthe case for planning problems?
14. Is there more than one type of “cycle” in our crafting planningproblem?
Think about a recipe like making
PayPal Gateway not configured
PayPal Gateway not configured