ARTIFICIAL INTELLIGENCE
21AM503
Anirudhan Adukkathayar C
Assistant professor,
AIML Dept.
NMAMIT
ARTIFICIAL INTELLIGENCE
Credits – 3
• Course Code 21AM503
• CIE Marks. 50
• Number of Contact Hours/Week. 3:0:0
• SEE Marks. 50
• Total Number of Contact Hours. 39
• Exam Hours. 03
Evaluation
Internal
• Tasks : 3 - 10 marks, MSE : 2 - 40 marks
• Assignment 1 - Unit I - 5 Marks
• Assignment 2 - Unit II - 3 marks
• Quiz - Unit III - 2 marks
• MSE 1 - 20 marks
• MSE 2 - 20 marks
• Total - 50 marks
Course Learning Objectives
At the end of the course student will be able to:
• Understanding history of Arti cial Intelligence (AI) and its foundation.
• Learn basic principles of AI in solutions that require problem solving,
inference, perception, knowledge representation and learning
• Analyze various applications of AI techniques in intelligent agents, expert
systems, arti cial neural networks and other machine learning models.
• Identify and explain the pro ciency developing applications of AI language,
expert system shell, or data mining tool.
• Determine an ability to share in discussions of AI, its current scope and
limitations.
fi
fi
fi
Syllabus
Unit I Contact Hours : 10
• Introduction: what is AI, Acting Humanly: The Turing Test approach, Thinking
Humanly: The cognitive modelling approach, Thinking rationally: The laws of
thought apprach, Acting Rationally: The rational agent approach. The state of
art
• Intelligent Agents: Agents and Environments, Good behaviour: The concept of
rationality, The nature of environments, properties of task environments,
Structure of Agents: Agent Programs, lTypes of agent programs
• Solving Problems by Searching: Problem solving Agents, wel de ned
problems and solutions, formulating problems, Example problems: Toy
problems: Vacuum world, 8-Queen’s problem, Real world problem: Airline Route
nding problem
fi
fi
Syllabus..
Unit II Contact Hours : 12
• Searching for solutions: Infrastructure for search algorithms, measuring problem
solving performance, Uninformed search strategies: Breadth rst search, Cost search,
Depth rst search, Informed search strategies: Greedy best search, A* algorithms,
Heuristic functions
• Quantifying Uncertainty: Acting under uncertainty, summarizing uncertainty,
Uncertainty and rational decisions, Basic probability notation, what probabilities are
about. The language of propositions in probability assertions, Inference using full joint
distribution, Bayes’ rule and its use, Applying Bayes’ rule for simple use case
• Probability Reasoning Over time: Time and Uncertainty, States and observations,
Transition and Sensor models, Inference in temporal models, Smoothing, Hidden
Markov model, Simpli ed matrix algorithms, Hidden Markov model: Localization,
Kalman Filter basics.
fi
fi
fi
Syllabus..
Unit III Contact Hours : 10
• Reinforcement Learning: Introduction, Passive reinforcement learning,
Generalization in reinforcement learning, Applications of reinforcement
learning,
• Q-Learning Intuition: Plan of attack, Bellman Equation, The Plan, Markov
Decision Process, Policy vs Plan, Adding Living penalty, Temporal Di erence
ff
Course Outcomes
At the end of the course student will be able to:
[Link] the fundamental understanding of the history of Arti cial Intelligence (AI) and
its foundation.
[Link] the basic principles of AI in solutions that require problem solving, inference,
perception, knowledge representation and learning
[Link] the awareness and fundamental understanding of various applications of AI
techniques in intelligent agents, expert systems, arti cial neural networks and other
machine learning models.
[Link] and explain the pro ciency developing applications of AI language, expert
system shell, or data mining tool
[Link] an ability to share in discussions of AI, its current scope and limitations.
fi
fi
fi
Reference Books:
• 1. Arti cial Intelligence by Rich and Knight, The McGraw Hill, 2017
• 2. Arti cial Intelligence: A new synthesis by Nils and Nilson, Elsevier,1997.
• 3. Arti cial Intelligence by Luger, Pearson Education, 2002.
• 4. Arti cial Intelligence by Padhy, Oxford Press, 2005.
fi
fi
fi
fi
Text book
Introduction