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 A1
(47487) |
234 |
2024-09-03 - 2024-12-09 (TR)
14:00 - 15:20
|
|
| Section | Capacity | Class times | Login to view Instructor(s) and Location |
|---|---|---|---|
|
LAB D01
(47628) |
234 |
2024-09-03 - 2024-12-09 (M)
17:00 - 19:50
|
|