<h1>CS 1571: Homework 10</h1>

    <h2 class="cse">Planning Algorithms (Chapter 11): Paper (100 pts)</h2>

    <P>
      Assigned: November 20, 2008 (by end of day)
    </P>    
     <P>
      Due: December 4, 2008
    </P>

    <P>

<h4>1. Partial Order (50 pts)</h4>
<p>
Consider the following simple domain:
<li>   Initial State: A, B, C
<li>  Goal: C, D, E
<li>  Operator O1 Preconditions: A; Add Effects: F; Delete Effects: C
<li>  Operator O2 Preconditions: A; Add Effects: D; Delete Effects: B
<li>  Operator O3 Preconditions: B; Add Effects: C
<li>  Operator O4 Preconditions: F; Add Effects: D, E, G

<p> Trace in detail how a partial-order regression planner finds a
    plan for this problem. This means show the various partial-order
    plans together with their ordering constraints and causal links.
<p>
To get full credit, you should first - in words - describe each step in your plan space search. For example:
<li>
Step 0 The plan is created with only the start and goal states.
<li> Step 1 The planner selects for a subgoal the precondition  from the goal state. It then chooses
the blah operator to satisfy this subgoal. It places the following ordering constraints and causal links. Etc.
<p>
In addition, you should create a corresponding diagram representing the partial plan for each state.Here's one suggested
notation, similar to that used in class. Use a labelled square to represent an operator. Use letters
above the squares for preconditions and letters below for
effects. Use single width arrow lines for ordering constraints, and double
width arrow lines for causal links. (As discussed in class, not all
ordering constraints need to be shown in the graph as causal links are
assumed to be accompanied by a similar ordering constraint).



<h4>1. STRIPS (50 pts)</h4>
<p>
Assume a blocks world where <i>ON(x,y)</i> means that block x is directly on block y and <i>Clear(x)</i> means that the top of the block x is clear.  The initial state is
<li><i>ON(B,A), ON(A,C), ON(C,Table), On(D,Table), Clear(B), Clear(D)<i>
The goal condition is:
<li><i>ON(C,B),On(B,A),On(A,D)</i>
<p>
<a>Write two STRIPS operators for the following actions:
<li>put-on(x,y) for stacking a block x on another block y
<li>put-table(x) to put the block on the table
<p>
<b>As we search for the plan using forward (goal-progression) search.  Descirbe the state we obtain after the operator put-table(B)