Which algorithm places two actions into a plan without specifying which should come first?
a) Full-order planner
b) Total-order planner
c) Semi-order planner
d) Partial-order planner
Explanation: Any planning algorithm that can place two actions into a plan without specifying which should come first is called partial-order planner.
How many possible plans are available in
partial-order solution?
a) 3
b) 4
c) 5
d) 6
Explanation: The partial-order solution corresponds to six possible total-order plans.
What is the other name of each and every total-order plans?
a) Polarization
b) Linearization
c) Solarization
d) None of these
Explanation: Each and every total order plan is also called as linearization of the partial-order plan.
What are present in the empty plan?
a) Start
b) Finish
c) Modest
d) Both Start & Finish
Explanation: The ’empty’ plan contains just the start and finish actions.
What are not present in start actions?
a) Preconditions
b) Effect
c) Finish
d) None of these
Explanation: Start has no precondition and has as its effects all the literals in the initial state of the planning problem.
What are not present in finish actions?
a) Preconditions
b) Effect
c) Finish
d) None of these
Explanation: Finish has no effects and has as its preconditions the goal literals of the planning algorithm.
