| LEC # | Topics | KEY DATEs |
|---|---|---|
| 1 | Principles of Autonomy and Decision Making | |
| 2 | A Very Brief Introduction to Java® | |
| 3 | Formulating Problem Solving as State Space Search Optional Lecture: More Fun with Java® | |
| 4 | Problem Solving with Java® | Problem set 1 due |
| 5 | Asymptotic Analysis of Uninformed Search Methods | |
| 6 | Global Path-Planning via Optimal Search and Shortest Paths | Problem set 2 due |
| 7 | Roadmaps and Adversarial Games | |
| 8 | Solving Linear Programs using Simplex | Problem set 3 due |
| 9 | Kinodymanic Path-Planning using Linear Programs | Problem set 4 due |
| 10 | Formulating Visual Interpretation using Constraint Programming | |
| 11 | Solving Constraint Programs using Inference and Search | Problem set 5 due |
| 12 | Activity Planning and Plan Graphs | |
| 13 | Plan Extraction in Graph Plan | Problem set 6 due |
| Mid-term Examination | ||
| 14 | Planning and Execution in a Changing World | |
| 15 | Modelling using Propositional Logic | |
| 16 | Propositional Satisfiability | Problem set 7 (problems 1, 2, 4) due 16.413 Final project phase 1 due |
| 17 | Entailment and Inference in Propositional Logic | |
| 18 | Model-Based Diagnosis and Conflict-directed Search | Problem set 7 (problem 3) due Problem set 8 due 16.413 Final project phase II due |
| 19 | Introduction to Probabilistic Reasoning | |
| 20 | Probabilistic State Estimation and Robot Localization | |
| 21 | Formulating Utility-based Agents using Markov Decision Processes | |
| 22 | 16.413 Student Project Presentations | Problem set 9 due 16.413 Final project written presentation due 2 days after lecture 22 |
| 23 | Learning from Observations through Inductive Methods | |
| 24 | Learning from Observations through Statistical Methods | 16.413 Final project full report due 2 days after lecture 24 |
| 25 | Making Decisions through Finite Domain Constraint Optimization | Problem set 10 due |
| 26 | Final Exam Review | |
| Final Exam |