Question: Suppose you have a state-space search problem defined by the usual stuff: A set of states s; An initial state s 0 ;
Suppose you have a state-space search problem defined by the usual stuff:
• A set of states s;
• An initial state s0;
• A set of actions A including the NoOp action that has no effect;
• A transition model Result(s, a);
• A set of goal states G.
Unfortunately, you have no search algorithms! All you have is a CSP solver. How could you reformulate this as a CSP? You may assume that you are given the maximum number of steps, T that any plan can have. Make sure that your formulation makes it easy to see what the plan is.
Step by Step Solution
3.48 Rating (155 Votes )
There are 3 Steps involved in it
The straightforward solution is to have variables S 0 S T for ... View full answer
Get step-by-step solutions from verified subject matter experts
