CMSC 421
Introduction to Artificial Intelligence
Fall 2002
Approximate Schedule*
This schedule shows for each class session: the topics that will be covered, the required and optional readings and any assignments that are due that day. All homework and programming assignments are due at the beginning of class. THIS SCHEDULE WILL CHANGE, PLEASE CHECK IT REGULARLY!
| Session | Date | Topic | Notes | Required Reading | Optional Reading | Assignment | slides** |
|---|---|---|---|---|---|---|---|
|
|
| Introduction and Course Overview |
ch. 1
|
Lecture1-notes | |||
|
|
| Intelligent Agents & Problem Solving |
ch. 2
| ||||
|
|
| Search |
ch. 3
|
hw1
due at start of class Thu 9/24
|
Lecture3-notes | ||
|
|
| Heuristic Search |
|
ch. 4
| |||
|
|
| Search cont. | |||||
|
|
| Constraint Satisfaction Problems (CSP) | guest lecturer | ||||
|
|
| CSP/Game Playing |
ch. 5
| ||||
|
|
| Game Playing |
hw2 due noon Fri 10/11
| ||||
|
|
| KR & Propositional Logic |
ch. 6
|
pa1
due 9AM Tue 10/15
| |||
|
|
| Propositional Logic and Inference | |||||
|
|
| Resolution & Theorem Proving | |||||
|
|
| First Order Logic (FOL) |
ch. 7
| ||||
|
|
| FOL & Theorem Proving, Review |
ch. 9
| ||||
|
|
|
Midterm
| |||||
|
|
| Planning |
ch. 11
|
hw3
due noon Tue 11/5
| |||
|
16
|
Oct 24
|
Planning
|
ch. 12
| ||||
|
17
|
Oct 29
| Planning | |||||
|
18
|
Oct 31
| Reasoning Under Uncertainty | |||||
|
19
|
Nov 5
| Bayesian Networks |
hw4
due noon Tue 11/19
| ||||
|
20
|
Nov 7
| Bayesian Networks | |||||
|
21
|
Nov 12
| Decision Making Under Uncertainty |
ch. 16
| ||||
|
22
|
Nov 14
| Decision Making cont. | |||||
|
23
|
Nov 19
| Learning - Decision Trees |
ch. 18
| ||||
|
24
|
Nov 21
| Learning -Neural Networks |
ch. 19
| ||||
|
25
|
Nov 26
| Learning cont. | |||||
|
26
|
Nov 28
|
thanksgiving
| |||||
|
27
|
Dec 3
| Reinforcement Learning |
ch. 20
| ||||
|
28
|
Dec 5
| SNOW DAY NO CLASS | |||||
|
29
|
Dec 10
| Robotics |
ch. 25
| ||||
|
30
|
Dec 12
| Review | |||||
|
Tuesday |
Final
| ||||||
Key:
RN = Russell
& Norvig, Artificial Intelligence: A Modern Approach
H = homework assignment
P = project
* This schedule is subject to change. There are a number of readings that will be added, and the assignment dues dates are still being tuned. Please check it periodically.
** Lecture-notes are the daily announcements/reminders for each class. The lecture content is in the file with the appropriate topic name. The course slides are based on the course notes of Jean-Claude Latombe at Stanford, Marie desJardins at UMBC, Daphne Koller at Stanford and others.