We saw that planning graphs can handle only propositional actions. What if we want to use planning graphs for a problem with variables in the goal, such as At (P1, x) ^ At (P2, x), where x ranges over a finite domain of locations? How could you encode such a problem to work with planning graphs?
Answer to relevant QuestionsGiving examples from the airport domain, explain how symbol-splitting reduces the size of the precondition axioms and the action exclusion axioms. Derive a general formula for the size of each axiom set in terms of the ...Give an example in the house-building domain of two abstract sub plans that cannot be merged into a consistent plan without sharing steps.Conditional effects were illustrated for the Suck action in the vacuum world—which square becomes clean depends on which square the robot is in. Can you think of a new set of propositional variables to define states of the ...To the medication problem in the previous exercise, add a Jest action that has the conditional effect Culture Growth when Disease is true and in any case has the perceptual effect Know (Culture Growth). Diagram a conditional ...After your yearly checkup, the doctor has bad news and good news. The bad news is that you tested positive for a serious disease and that the test is 99% accurate (i.e., the probability of testing positive when you do have ...
Post your question