Question

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

This question was addressed to me in an interview.

I would like to ask this question from Partial Order Planning in chapter Planning and Acting in the Real World of Artificial Intelligence

Select the correct answer from above options

Interview Questions and Answers, Database Interview Questions and Answers for Freshers and Experience

Answer 1

The correct choice is (d) Partial-order planner

The best I can explain: Any planning algorithm that can place two actions into a plan without specifying which should come first is called partial-order planner.