CMPUT 366 - Search Planning in Artificial Intelligence
Undergraduate course,
Computing Science Department
University of Alberta
An introductory course to search and planning in artificial intelligence. It covers deterministic single-agent and multi-agent problems; how to model real-world problems as state-space search problems and how to solve such problems. It covers algorithms for solving deterministic shortest path problems with combinatorial optimization problems, constraint satisfaction problems, and multi- agent problems.