Credits: 3
Hours per Week: L:3 T:0 P:0
This course aims to:
After undergoing this course, the students will be able to:
Concept of AI, history, current status, scope, agents, environments, Problem Formulations, Review of tree and graph structures, State space representation, Search graph and Search tree.
[8hrs] (CO 1)
Random search, Search with closed and open list, Depth first and Breadth first search, Heuristic search, Best first search, A* algorithm, Game Search.
[9hrs] (CO 2)
Probability, conditional probability, Bayes Rule, Bayesian Networks- representation, construction and inference, temporal model, hidden Markov model.
[6hrs] (CO 3)
MDP formulation, utility theory, utility functions, value iteration, policy iteration and partially observable MDPs.
[6hrs] (CO 4)
Passive reinforcement learning, direct utility estimation, adaptive dynamic programming, temporal difference learning, active reinforcement learning- Q learning.
[6hrs] (CO 5)
Credits: 1
Hours per Week: L:0 T:0 P:2
Upon completion of this lab, students will be able to: