Partial plan

From Wikipedia, the free encyclopedia

In formal AI planning, a partial plan is a plan which specifies all actions that need to be taken, but does not specify an exact order for the actions where the order does not matter.

A linearization of a partial order plan is a total order plan derived of the particular parital order plan. The number of linearization of a POP is equal to the factorial of the number of actions divided by the 2 to the power of the number of orders.

For example, a plan for baking a cake might start:

• go to the store
• get eggs; get flour; get milk
• pay for all goods
• go to the kitchen

This is a partial plan because the order for finding eggs, flour and milk is not specified, the agent can wander around the store reactively accumulating all the items on its shopping list until the list is complete.