[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Readings for next class + additional material for todays'
- To: "Rao Kambhampati" <email@example.com>
- Subject: Readings for next class + additional material for todays'
- From: "Subbarao Kambhampati" <firstname.lastname@example.org>
- Date: Tue, 29 Jan 2008 17:31:51 -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:in-reply-to:mime-version:content-type:content-transfer-encoding:content-disposition:references:x-google-sender-auth; bh=tr/awIsqWjnifWb7IyPEn3CiNIBzlhRfuvu31p5IMlQ=; b=LJ+GbFrbm5OkGysr2Z54iR0JBxQg79yehAv/KHaZsK720dTzYddWpHXz8oPPpaqZivlhHSAZanT/eCeBCdAI8DtCPnZ4pzQ59Up6+S3yDVKOmgTQeiBi8JdtktaIQM4G1dK2GKCU0q8DHBg6WPSOUtnJfOcnEZ5bZEIDJeXZNRM=
- Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=message-id:date:from:sender:to:subject:in-reply-to:mime-version:content-type:content-transfer-encoding:content-disposition:references:x-google-sender-auth; b=pQKNpJzUOotgkrc8UHTTVgsi6qFIUSizzBMQWxfXh4s3COqyCP2g9C/DOkJbw/0Gh3V/o6iIc6fSMALv602q6e/SBL6dxyamNmv66EiUFO0n93UmsfdB+RP8wipm8RtvdFcZf2qJxywJbhXHTh1Chi6mgk3Eqt2ISH1vLQSGrqQ=
- In-reply-to: <email@example.com>
- References: <firstname.lastname@example.org>
- Sender: email@example.com
As I said, we will discuss any outstanding questions on heuristics
(including probably a quick discussion on use of reachability
Plan-space planning), and then discuss bounded-length planning as a
combinatorial problem. What we did with Graphplan today will become
a simple subcase--with other cases being pushing planning as SAT/CSP/IP etc.
The additional reading for tomorrow's class is:
Chapters 6 and 7 in Nau et. al.'s text book
or if you want a shorter version, Chapter 11 (sections 4 and 5) in
Russell and Norvig (if you don't have the text, here is that chapter
from AIMA site:
Also, if any of you felt a little lost today and wanted a more
structured lecture on the heuristics, check out
which is the first part of the tutorial based closely on the paper you
read and slides you saw.