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 | Class times | Login to view Instructor(s) and Location |
|---|---|---|---|
|
LECTURE B1
(70793) |
150 |
2025-01-06 - 2025-04-09 (MWF)
11:00 - 11:50
|
|
| Section | Capacity | Class times | Login to view Instructor(s) and Location |
|---|---|---|---|
|
LAB H01
(70794) |
150 |
2025-01-06 - 2025-04-09 (R)
17:00 - 19:50
|
|