0
$\begingroup$

Let's say we have a "monkey and banana" problem. Let's say we have 3 places: A, B and C. We also have the operator move(X, Y), which moves the monkey from X to Y, where X and Y are variables. There is also the state At(Y) (the monkey is at Y) in his add list.

Now, let's say that, on top of the stack, we have some unsatisfied goal such as At(B).

According to the STRIPS algorithm, must the operator that I choose be of the form move(X, B), or it doesn't matter which places from A, B, C do I put in X and in Y?

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.