# Question

Let us consider how we might translate a set of STRIPS schemata into the successor-state axioms of situation calculus.

• Consider the schema for Fly (p, from. to). Write a logical definition for the predicate Fly Precond (p, from. to, s), which is true if the preconditions for Fly (p, from, to) are satisfied in situation s.

• Next, assuming that Fly (p, from to) is the only action schema available to the agent, write down a successor-state axiom for A t (p, x, s) that captures the same information as the action schema.

• Now suppose there is an additional method of travel: Teleport (p, from, to). It has the additional precondition -, Warped (p) and the additional affect Warped (p). Explain how the situation calculus knowledge base must be modified.

• Finally, develop a general and precisely specified procedure for carrying out the translation from a set of STREPS schemata to a set of successor-state axioms.

• Consider the schema for Fly (p, from. to). Write a logical definition for the predicate Fly Precond (p, from. to, s), which is true if the preconditions for Fly (p, from, to) are satisfied in situation s.

• Next, assuming that Fly (p, from to) is the only action schema available to the agent, write down a successor-state axiom for A t (p, x, s) that captures the same information as the action schema.

• Now suppose there is an additional method of travel: Teleport (p, from, to). It has the additional precondition -, Warped (p) and the additional affect Warped (p). Explain how the situation calculus knowledge base must be modified.

• Finally, develop a general and precisely specified procedure for carrying out the translation from a set of STREPS schemata to a set of successor-state axioms.

## Answer to relevant Questions

The monkey-and-bananas problem is faced by a monkey in a laboratory with some bananas hanging out of reach from the ceiling. A box is available that will enable the monkey to reach the bananas if he climbs on it. Initially, ...We contrasted forward and backward state-space search planners with partial-order planners, saying that the latter is a plan-space searcher. Explain how forward and backward state-space search can also be considered ...In the SATPLAN algorithm in Figure, each call to the satisfiability algorithm asserts a goal g T where T ranges from 0 to Tmax. Suppose instead that the satisfiability algorithm is called only once, with the goal g0 V g1 V.. ...Consider the following argument: In a framework that allows uncertain initial stares, disjunctive effects are just a notational convenience, not a source of additional representational power. For any action schema a with ...Look at the list of things that the re planning agent can’t do. Sketch an algorithm that can handle one or more of them.Post your question

0