Which can be adapted for planning algorithms?
a) Most-constrained variable
b) Most-constrained literal
c) Constrained
d) None of these
Explanation: The most-constrained variable heuristic from CSPs can be adapted for planning algorithm and seems to work well.
Graph Plan Algorithm:
Which data structure is used to give better heuristic estimates?
a) Forwards state-space
b) Backward state-space
c) Planning graph algorithm
d) None of these
Explanation: A special data structure called planning graph is used to give better heuristic estimates.
Which is used to extract solution directly from the planning graph?
a) Planning algorithm
b) Graphplan
c) Hill-climbing search
d) All of the mentioned
Explanation: We can extract the solution directly from the planning graph, using a specialized algorithm called Graphplan.
What are present in the planning graph?
a) Sequence of levels
b) Literals
c) Variables
d) Heuristic estimates
Explanation: A planning graph consists of sequence of levels correspond to time steps.
What is the starting level of planning graph?
a) Level 3
b) Level 2
c) Level 1
d) Level 0
