[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Optional readings for references from today's class
- To: "Rao Kambhampati" <rao@asu.edu>
- Subject: Optional readings for references from today's class
- From: "Subbarao Kambhampati" <rao@asu.edu>
- Date: Thu, 14 Feb 2008 19:32:31 -0700
- Dkim-signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=gamma; h=domainkey-signature:received:received:message-id:date:from:sender:to:subject:mime-version:content-type:content-transfer-encoding:content-disposition:x-google-sender-auth; bh=CduhOIpCLkaqkDlTPi0b+ul1tfZ7XdYl/tERj65mCvk=; b=PXe/AsV7xqBmeOu2RmdFo5u/qGJT7P68LjjwFAqlIWYgwiN+LrxV5xyAwXq6/Ps6OqRm79eP4gRDHhnaEsQSny5LjQBl6CLsIQLIL1AqeSbzyYKy6eX9mXCNNivxEXIzUOP2ejwc9O6s6J/8KyBWlWykAGeBrxtUxIDMQOrDm20=
- Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=message-id:date:from:sender:to:subject:mime-version:content-type:content-transfer-encoding:content-disposition:x-google-sender-auth; b=rJB90hCvP4t8I+AXHRC3f89S6fuu3Uf8d9SRh2v1EpcY/c8NYGHcN3EgD6h99UhinJznwr8ljDbXvpVvdUUpQK/zB4ZXud/OZiMXlF+Z6qt/Gc3rlXboyNlLLy3hyk9sINCg5smmFUeuADJNgNHWBQphe0D4tDV7/rnpWy72BqE=
- Sender: subbarao2z2@gmail.com
Here are optional readings for references made in the class
--> 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