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 | Instructor(s) |
|---|---|---|---|
|
LECTURE A1
(81712) |
210 |
2023-09-05 - 2023-12-08 (TR)
14:00 - 15:20
ETLC E1-017
Final Exam: 2023-12-20
09:00 - 12:00
ETLC E1-007
2023-12-20
09:00 - 12:00
ETLC E1-003
|
Primary Instructor: Levi Santana de Lelis
|
| Section | Capacity | Class times | Instructor(s) |
|---|---|---|---|
|
LAB D01
(81878) |
210 |
2023-09-05 - 2023-12-08 (M)
17:00 - 19:50
ETLC E1-007
|
|
| Section | Capacity | Class times | Instructor(s) |
|---|---|---|---|
|
LECTURE B1
(10900) |
212 |
2024-01-08 - 2024-04-12 (MWF)
11:00 - 11:50
ESB 3-27
|
Primary Instructor: Levi Santana de Lelis
|
| Section | Capacity | Class times | Instructor(s) |
|---|---|---|---|
|
LAB H01
(10901) |
212 |
2024-01-08 - 2024-04-12 (R)
17:00 - 19:50
ETLC E1-003
|
|