Learn different types of Planning Problems in AI

Features of Planning Problem, STRIPS, LINEAR VS NON-LINEAR Planning

Properties of Planning Algorithm

a)Complete - A planning algorithm is said to be complete, if a solution can be found whenever one actually exist.

b)Optimal – If the order in which solutions are found is consistent with some measure of plan quality.

c)Strictly complete – If ALL the solutions are included in search space.

d)Sound – A planning algorithm is sound if:

❖All solutions found on legal plans.

❖No constraints are violated

❖All preconditions & goals are satisfied

STRIPS properties (Most expected for upcoming exam)

⮚Initial state with incomplete information.

⮚ Nondeterministic actions with more than one outcome.

⮚Representation of the duration of actions.

⮚Exogenous events.

⮚Sensing actions.

⮚A more expressive solution.