--> A short (4 page) paper on FF (explains the enforced hill climbing
and other little changes it makes on top of relaxed plan heuristic)
http://rakaposhi.eas.asu.edu/cse574/ff-aimag.pdf
-->A (10 page) paper on Fast-Downward (that detects multi-valued
fluents masquerading as boolean ones, and uses relaxed planning graph
ideas after that detection)
ftp://ftp.informatik.uni-freiburg.de/documents/papers/ki/helmert-icaps04.pdf
--> A short (3 page) paper on Macro-FF, that selectively learns
macros on top of FF
http://www.cs.ualberta.ca/%7Eadib/Research/Planning/ipc4Alberta.pdf
--> A paper on learning search control rules from failures using EBL
http://rakaposhi.eas.asu.edu/ebl-po-aaai94.pdf
(a longer but perhaps cleaner description is
http://rakaposhi.eas.asu.edu/ebljpap.pdf
also, for relations between EBL, dependency directed backtracking in
CSP (no-good learning) as well as planning, see
http://rakaposhi.eas.asu.edu/jour-ddb.pdf )
Rao
No comments:
Post a Comment