This course provides an introduction to search and planning in artificial intelligence. The course covers deterministic single-agent and multi-agent problems. Students will learn how to model real-world problems as state-space search problems and how to solve such problems. The course covers algorithms for solving deterministic shortest path problems with factored and non-factored states, combinatorial optimization problems, constraint satisfaction problems, and multi- agent problems. Prerequisites: CMPUT 204 or 275, and CMPUT 272.
| Section | Capacity | Dates + Times | Instructor(s) |
|---|---|---|---|
|
LECTURE B1
(41213) |
200 |
2023-01-05 - 2023-04-12
MWF 11:00 - 11:50 (ETLC E1-007)
|
Primary Instructor: Levi Santana de Lelis
|
| Section | Capacity | Dates + Times | Instructor(s) |
|---|---|---|---|
|
LAB H01
(41214) |
200 |
2023-01-05 - 2023-04-12
H 17:00 - 19:50 (ETLC E1-007)
|
|