Examine the definition of bidirectional search in Chapter 3.

a. Would bidirectional state-space search be a good idea fior planning?

b. What about bidirectional search in the space of partial-order plans?

e. Devise a version of partial-order planning in which an action can be added to a plan if its preconditions can be achieved by the effects of actions already in the plan. Explain how to deal with conflicts and ordering constraints. Is the algorithm essentially identical to forward state-space search?

d. Consider a partial-order planner that combines the method in part

(c) with the standard method of adding actions to achieve open conditions. Would the resulting algorithm be the same as part (b)?