This course covers important Al topics, including hidden Markov models and advanced search algorithms (D-lite and cooperative path finding). Students also examine uncertainty handling (Dempster-Shafer theory), learning (kernel machines), and advanced topics in planning (conditional and adversarial planning).
Prerequisites
CS 380 or CS 580, CS 381 or CS 581