GraphPlan

What are present in the planning graph?

• a) Sequence of levels

• b) Literals

• c) Variables

• d) Heuristic estimates

Which kind of problem are suitable for planning graph?

• Propositional planning problem

• Planning problem

• Action problem

• None of the mentioned

What is meant by persistence actions?

• Allow a literal to remain false

• Allow a literal to remain true

• Allow a literal to remain false & true

• None of the mentioned

How many conditions are available between two actions in mutex relation?

• 1

• 2

• 3

• 4

Which is used to extract solution directly from the planning graph?

• Planning algorithm

• Graphplan

• Hill-climbing search

• All of the mentioned

What are present in each level of planning graph?

• Literals

• Actions

• Variables

• Both Literals & Actions

What is called inconsistent support?

• If two literals are not negation of other

• If two literals are negation of other

• Mutually exclusive

• None of the mentioned

Which data structure is used to give better heuristic estimates?

• Forwards state-space

• Backward state-space

• Planning graph algorithm

• None of the mentioned

7. What is meant by persistence actions?

• a) Allow a literal to remain false

• b) Allow a literal to remain true

• c) Allow a literal to remain false & true

• d) None of the mentioned