Properties of Planning Algorithm

Cover Properties of Planning Problem, Linear vs Non-Linear, STRIPS Planning algorithm in just 15mins.

Properties of Planning Algorithm

1. Complete - A planning algorithm is said to be complete, if a solution can be found whenever one actually exist.
2. Optimal – If the order in which solutions are found is consistent with some measure of plan quality.
3. Strictly complete – If ALL the solutions are included in search space.
4. Sound – A planning algorithm is sound if:

• All solutions found on legal plans.
• No constraints are violated
• All preconditions & goals are satisfied

UGCNET PYQ JUNE 2019

Q) STRIPS Full Form - Stanford Research Institute Problem Solver

We always provide extra information, so let's discuss what are the properties of STRIPS :-

1. Initial state with incomplete information.
2. Nondeterministic actions with more than one outcome.
3. Representation of the duration of actions
4. Exogenous events
5. Sensing actions.
6. A more expressive solution.

For detail explanation, Click on the Youtube video from our Educator : Rashmi Prabha

If you are running short of time and needed a quick revision. Then, Click on the link to DOWNLOAD our Expert designed notes.