Readings for next class and references from this class

[Subbarao Kambhampati <rao@parichaalak.eas.asu.edu>]

Please read the sections 3-7 (at least) of the following paper for the next 
class (talks about how to convert planning graphs into CSP).

http://rakaposhi.eas.asu.edu/gp-csp-sub.pdf

Also, the full gory details of the  EBL memoization for graphplan that I 
discussed in the class can be found in:

http://rakaposhi.eas.asu.edu/kambhampati00a.pdf (sections 3-5 should be 
sufficient).

  The results on using level-based ordering strategies for Graphplan search 
can be found in the section 8 of the AltAlt AIJ paper.


Terry's experiments with more aggesive exploitation of the Graphplan search 
episodes as well as getting cost-optimal plans from Graphplan are still to 
be published. You can send him a mail (zim@asu.edu) if you want to read his 
under-review versions.

Rao