Machine-translated by Google. Questions are authored in English.
Top

Discussion

What is the drawback of the satisfiability encoding of planning?

  • A.The formula grows with the horizon and can become enormous
  • B.The solver cannot handle formulas containing negation
  • C.The resulting plans are always longer than necessary
  • D.The encoding cannot express actions with preconditions

Answer: A

Each time step requires a copy of every fluent and every action variable, so a long horizon produces a formula of millions of variables. Compact encodings and parallel semantics, allowing several non-interfering actions per step, mitigate it. Negation, plan length and preconditions are handled correctly. A translation whose size grows with a parameter that must be searched over is one whose practicality depends entirely on how large that parameter must be.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.