| ACTIVITIES | PERCENTAGES |
|---|---|
| Mid-term quiz | 25% |
| Final exam | 40% |
| Problem sets | 35% |
Lectures: 2 sessions / week, 1.5 hours / session
Recitations: 1 session / week, 1 hour / session
This course provides a survey of reasoning, learning, and optimal decision making methodologies for creating highly autonomous systems and decision support aids. It focuses on principles, algorithms, and their application, taken from the disciplines of artificial intelligence and operations research.
Reasoning paradigms include uninformed, informed and game search, logic and deduction, constraint modeling, model-based diagnosis, planning and execution, and reasoning under uncertainty. Machine learning paradigms include expectation maximization and reinforcement learning. Optimal decision making paradigms include linear and integer programming, dynamic programming and Markov decision processes.
The graduate subject 16.413 meets with undergraduate subject 16.410, but requires more advanced programming and written assignments, including an advanced tutorial in Java.
Learning Objectives and Assessment
[AIMA] =
Russell, Stuart, and Peter Norvig. Artificial Intelligence: A Modern Approach. 3rd ed. Prentice Hall, 2009. ISBN: 9780136042594.
[IOR] =
Hillier, Frederick, and Gerald Lieberman. Introduction to Operations Research. 9th ed. McGraw-Hill, 2009. ISBN: 9780077298340.
[PA] =
LaValle, Steven. Planning Algorithms. Cambridge University Press, 2006. ISBN: 9780521862059.
[JINS] =
Flanagan, David. Java in a Nutshell. 5th ed. O'Reilly, 2005. ISBN: 9780596007737.
Your grade in 16.410 or 16.413 will be determined by the following approximate weighting.
| ACTIVITIES | PERCENTAGES |
|---|---|
| Mid-term quiz | 25% |
| Final exam | 40% |
| Problem sets | 35% |
| ACTIVITIES | PERCENTAGES |
|---|---|
| Mid-term quiz | 20% |
| Final exam | 35% |
| Project | 15% |
| Problem sets | 30% |
However, you must do all problem sets to pass the course; a passing grade based on the other parts may be converted to a failing grade if you do not turn in all the problem sets, where turning in a problem set means including a serious attempt to complete each problem set.