The following is a schedule of the lectures and presentations for CS 4013/5013 Artificial Intelligence for Spring 2017. This schedule will be updated throughout the semester. All readings are from Artificial Intelligence by Russell & Norvig third edition (blue book) unless otherwise noted.
| Date | Topic | Assigned Reading | Assigned | Due |
|---|---|---|---|---|
| Jan 16 (Week 1: Intro and Agent Design) | Martin Luther King day - holiday | |||
| Jan 18 | Introduction to AI & intelligent agents |
|||
| Jan 23 (Week 2: Search) | Search and problem formulation, Agents and environments | Ch 2 through 2.3, 3.1 | Project 0: setting up your account | |
| Jan 25 | Problem formulation, Effective knowledge representations |
3.2-3.3 | Homework 1 | |
| Jan 30 (Week 3: Search) | Uninformed search | 3.4, | Project 1: Reflex agents and knowledge representations | Project 0 |
| Feb 1 | Uninformed search, Informed search, Heuristic search, A* |
Homework 1 | ||
| Feb 6 (Week 4: Games) | A*, Constructing admissible heuristics |
3.5-3.6 | Project 2: Intelligent search, Homework 2 | |
| Feb 8 | Adversarial search, Alpha-beta pruning | 4.1-4.5, 5.1-5.3 |
|
Project 1 |
| Feb 13 (Week 5: CSPs) | Project 1 demos, Adversarial search, Alpha-beta pruning, Handling larger-scale games | 5.4-5.8 | Homework 2 | |
| Feb 15 | Large scale games, Local search and search in the real world | Homework 3 | ||
| Feb 20 (Week 6: Midterm) | Midterm review | Project 2 | ||
| Feb 22 | Midterm 1 |
|||
| Feb 27 (Week 7: Learning) | Midterm discussion, Project 2 demos | Homework 3 | ||
| Mar 1 | Constraint satisfaction problems | 6.1-6.5 | Homework 4 | |
| Mar 6 (Week 8: Learning) | Introduction to learning, Linear regression, Nearest neighbor, Kernel regression | 18.1-18.2, 18.6 | ||
| Mar 8 | Evolutionary Computation and Project discussion | 4.1.4 | Project 3: Learning | Homework 4 |
| Mar 11-19 | Spring Break! |
|||
| Mar 20 (Week 9: Learning) | Class cancelled | |||
| Mar 22 | Overfitting, Learning curves, Evolutionary Computation | |||
| Mar 27 (Week 10: Learning) | Decision trees |
18.3, 18.8.1, 18.8.4, 18.3.5 | ||
| Mar 29 | Simulated annealing, Decision trees, Project discussion, Learning wrapup
|
4.1 | ||
| Apr 3 (Week 11: Midterm) | Midterm 2 review |
|||
| Apr 5 | Midterm 2 |
|||
| Apr 10 (Week 12: Multi-agent systems and Planning) | Linear regression, Introduction to logic, Introduction to classical planning | 12, 10.1 | Project 3 | |
| Apr 12 | Classical planning: STRIPS and derived representations |
10.2 |
Project 4: Planning, Multi-agent systems and tying it all together | Homework 5 (note tht it is longer than usual) |
| Apr 17 (Week 13: Multi-agent systems and Planning) | STRIPS and PDDL examples, Forward and backwards search, Planning and acting in the real-world |
11.1-11.2 | ||
| Apr 19 | Introduction to multi-agent systems | HW 6 | ||
| Apr 24 (Week 14: Multi-agent systems and Planning) | Effective communication and coordination strategies for MAS | |||
| Apr 26 | Advanced topics (may include: Multi-Carlo Tree Search, Upper Confidence Bounds/UCT search) | Introduction to UCT and Introduction to MCTS | ||
| May 1 (Week 15: Multi-agent systems and Planning) | Tying it all together |
HW 6 | ||
| May 3 (Course wrapup) | Project 4 demos, Final review | Project 4 | ||
| May 10 | Final exam 8:00-10:00 am |
|||