Question: 11.8 POP is a nondeterministic algorithm, and has a choice about which operator to add to the plan at each step and how to resolve
11.8 POP is a nondeterministic algorithm, and has a choice about which operator to add to the plan at each step and how to resolve each threat. Can you think of any domain-independent heuristics for ordering these choices that are likely to improve POP's efficiency? Will they help in Shakey's world? Are there any additional, domain-dependent heuristics that will improve the efficiency still further?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
