Question: Suppose that a high-level action has exactly one implementation as a sequence of primitive actions. Give an algorithm for computing its preconditions and effects, given
Suppose that a high-level action has exactly one implementation as a sequence of primitive actions. Give an algorithm for computing its preconditions and effects, given the complete refinement hierarchy and schemas for the primitive actions.
Step by Step Solution
3.49 Rating (175 Votes )
There are 3 Steps involved in it
To simplify the problem we assume that at most one refinement of a highlevel action will be applica... View full answer
Get step-by-step solutions from verified subject matter experts
