Papers from yesterday's class

[Subbarao Kambhampati <rao@asu.edu>]

The paper on the follow-up to qudaratic planning graphs, by Haslum, is here:

http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.170.2502

The paper that uses polynomial planning graphs and propagation algorithm for landmarks is here:

http://www.dtic.upf.edu/~ekeyder/ECAI10_Landmarks.pdf

=====

Here is a paper that expounds on my view of graphplan, its mutexes etc

http://rakaposhi.eas.asu.edu/ewsp-graphplan.pdf

Here is the paper that shows how memo computation can be made significantly better

http://rakaposhi.eas.asu.edu/ijcai-gp-ebl.pdf

Here is a "screed" about the pitfalls of equating graphplan plans with any notion of parallel optimality:

http://raos-ruminations.blogspot.com/2006/07/on-suboptimality-of-optimal-planning.html

=======

Here is the paper that talks about SAT encodings of planning graph

http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.27.2863&rep=rep1&type=ps

(Here is a version that talks about different types of encodings--corresponding to different proof strategies:

   http://www.cs.rochester.edu/~kautz/papers/plankr96.ps  

)