Artificial Intelligence Course Summary by Mouli Sankaran

Full Course Contents on Scribd
Full Course Link:
In 40 Hours of Lectures
Artificial Intelligence – © 2020 Mouli Sankaran Email: mouli.sankaran@yahoo.com

References (1, 2 & 3)
Ref 1 Ref 2
Ref 3
2
Session 1: Summary
 Course Introduction
3
Session 2: Summary
 AI Definitions
 AI and its Related Fields
 Evolution of Sub-disciplines in AI
1. Qualitative Reasoning
2. Medical Diagnosis
3. Logic in AI
4. Uncertain Reasoning
5. Meta-level Reasoning
 Expectations on AI
◦ Daily Life
◦ In Science
4
Session 3: Summary
 Sense  Deliberate  Act
 Topics in AI
◦ Speech Recognition
◦ Computer Vision
◦ Artificial Neural Networks
 Real-life applications using ANN
◦ Expert Systems
 Example Medical Diagnostics System
◦ AI: Grouping of Topics
 Quiz 1 – MCQ on AI Topics
 Quiz 2 – Generations of Computer
 Quiz 3 – Find the Closest Match
5
Session 4: Summary
 Homework: AI History
 Turing Test
 Thinking and Acting Humanly
◦ Rational Agents
◦ Limited Rationality
 Agents and Environments
◦ Agent Function and Agent Program
◦ Vacuum Cleaner Example
 Performance Measures
◦ Deciding Performance Measures
6
Session 5: Summary
 Session 4 - Recap
 Performance Measures
◦ Rational Agent Definition
◦ Omniscience
◦ Rationality and Perfection
◦ Information Gathering
◦ Learning and Autonomy
 The Nature of Environments
 Specifying Environments
◦ PEAS for Automated Taxi Driver
◦ PEAS for Some other Systems
 Different Kinds of Environments
◦ Fully Observable Vs Partially Observable
◦ Single Agent Vs Multiagent
7
Session 6: Summary
 Session 5: Quiz 1- Recap
 Different Kinds of Environments
◦ Deterministic vs Stochastic
◦ Uncertain and Nondeterministic
◦ Episodic vs Sequential
◦ Static vs Dynamic vs Semidynamic
◦ Discrete vs Continuous
◦ Known vs Unknown
 Quiz 2: Identify the Environment Types
 Max-AI: For recycling: In action
 Welcome my friend to the class …
8
Session 7: Summary
 Quiz 1: Types of Environment
 The Structure of Agents
 Agent Programs
◦ Coroutines
◦ VC Agent Program
 Types of Agent Programs
◦ Simple Reflex Agents
9
Session 8: Summary
 Quiz 1: On Session 2D - recap
 Types of Agent Programs
1. Simple Reflex Agents – Covered in Session 2D
2. Model-based Reflex Agents
3. Goal-based Agents
4. Utility-based Agents
 Learning Agents
◦ Learning Element
◦ Critic
◦ Problem Generator
 Announcement 1: Assignment 1
 Announcement 2: Test1 and Test 2 Dates
10
Session 9: Summary
 Problem Solving
◦ Domain Independent
◦ State Space
◦ Start and Goal States
 Search Trees
◦ Generate and Test Algorithm
◦ Domain Specific Functions
 MoveGen() and GoalTest()
 Bags and Sets (Data structures)
 Search Algorithms
◦ Simple Search 1
 Home Work
◦ Puzzle 1
◦ Puzzle 2
11
Session 10: Summary
 Issues with Simple Search 1 – Quiz 1
 Simple Search 2
◦ Algorithm
◦ Example 1
◦ Example 2
◦ Home work
 Kinds of Search Problems
◦ Configuration Problems (n x n queen)
◦ Planning Problems
 Simple Search 3
◦ Algorithm: Explained
12
Session 11: Summary
 Quiz 1: Simple Search 3 – Recap
 Modified SS3
◦ For Reconstructing the Path
 Depth First Search
◦ Algorithm – Home work
13
Session 12: Summary
 Announcement: Test1 – Schedule change
 Quiz 1: On the Search Tree
 Depth First Search (DFS)
◦ Algorithm
◦ OccursIn(): Explained
◦ MakePairs(): Explained
◦ DFS: Explained
14
Session 13: Summary
 Quiz 1: DFS
 DFS: Order of Search
 Breadth First Search (BFS)
 DFS Vs BFS
15
Session 14: Summary
 DFS Vs BFS
◦ Quiz 3 & 4:– Session 13 recap
◦ Summary
◦ Quiz 3 & 4: DFS Vs BFS: Memory space
 Asymptotic Big O notation
 Performance Measurements
◦ Completeness
◦ Time Complexity
◦ Space Complexity
◦ Quality of Solution
16
Session 15: Summary
 Quiz 1: DFS - Recap
 Quiz 2: Big O notation - Recap
 Analysis of Space Complexity
◦ DFS
◦ BFS
 Analysis of Time Complexity
◦ DFS
◦ BFS
 Performance Measurements Summary:
◦ DFS and BFS
17
Session 16: Focus
 Categories of Search
◦ Uninformed or Blind Search
◦ Informed Search
◦ Comparison Chart
 Depth Limited Search
◦ Depth limit or Diameter of state space
◦ Quiz 1: DLS
 Iterative Deepening DFS
◦ Algorithm
◦ No. of node Generated
18
Session 17: Focus
 Types of Searches
◦ Graph Search and Tree Search
 Quiz 1 – Iterative Deepening DFS - recap
 Bidirectional Search
◦ Quiz 2
◦ Issues
 Comparison of Uninformed Searches: Summary
19
Session 18: Focus
 Heuristic Searches
◦ Heuristic Functions
◦ Euclidean Vs Manhattan Distance
◦ Heuristic Function: Implementation
 Best First Search
◦ Example
◦ Explained
 Performance of Best First Search
◦ Completeness
◦ Quality of Solution
◦ Space and Time Complexity
◦ Effective Branching Factor
◦ Penetrance
20
Session 19: Focus
 Quiz 1: Bi-directional Search – Recap
 Hill Climbing – Heuristic Search
◦ Explained
◦ Algorithm
◦ Issues
◦ Anytime Algorithm
 Different Landscapes of State-space
 Local Maxima in Heuristic Search
◦ Blocks World Problem
◦ Example with h1(n)
21
Session 20: Focus
 Hill Climbing-Heuristic Search
◦ Blocks World Problem with h1(n) – Recap
◦ Example with h2(n)
◦ Quiz 1: Computation of h2(n) of possible moves
◦ Analysis of results of h2(n)
◦ Quiz 2: Handling the Plateau of h(n)
◦ Issues and Solutions
22
Session 21: Focus
 Types of Searches
◦ Constructive Search
◦ Perturbation Search
 SAT Problem
◦ Neighbourhood Problems
 Variable Neighbourhood Search (VNS)
◦ Algorithm
 Beam Search
◦ SAT Example
 Tabu Search
23
Session 22: Focus
 Hill Climbing - Recap
◦ Quiz 1
 Iterated Hill Climbing
◦ Quiz 2
 Escaping Local Maxima
 Home Work:
◦ IteratedHillCliming() Algorithm
24
Session 23: Focus
 Iterated Hill Climbing Algorithm
◦ Sorth() Function
◦ Where is suited?
◦ Footprint of the Heuristic Function
◦ Impact on IHC: Size of Footprint
 Alternative Approach to IHC
◦ Random Walk
◦ Random Walk Vs Hill Climbing
25
Session 24: Focus
 Local and Global Informed Searches
 Simulated Annealing Search
◦ Introduction
◦ Annealing Background
◦ SA Vs Annealing
 Simulated Annealing Search in AI
◦ Financial Saving Strategy: Analogy
◦ Sigmoid Function
◦ Simulated Annealing Algorithm - Homework
26
Session 25: Focus
 Simulated Annealing Search in AI
◦ Sigmoid function - Recap
◦ Simulated Annealing Algorithm
◦ Summary
 Example: Ball on the terrain
 SA: Applications
27
Session 26: Focus
 Roles of AI
◦ Problem Solving and Learning
 Learning: Classification
◦ Knowledge and Feedback Based
 Genetics: An Introduction
◦ Genetics
◦ Food chain
28
Session 27: Focus
 Genetics: An Introduction
◦ Life forms in Nature
 Genetic Algorithm
◦ Introduction
◦ States and Heuristic Function
◦ Genetics Vs GA in AI
 An Example problem using GA
◦ New Airports for Myanmar
 GA Introduction
◦ What is GA?
◦ Initial Population and Terminating Condition
29
Session 28: Focus
 GA-Introduction
◦ What is GA?
◦ Initial Population
◦ Terminating Condition
 GA Implementation
◦ Key Terms
◦ Requirements
◦ Different Stages
◦ Selection
◦ Reproduction and Mutation
◦ Termination Condition
 GA Pseudo code A Short Video
 Applications using GA on AI at the end
30
Session 29: Focus
 Travelling Salesman Problem (TSP)
◦ TSP Introduction
◦ Complexity of TSP
 Solving TSP using GA
◦ Representation
◦ Problems with Classical Crossover
◦ Modified Crossover
◦ Quiz 1
◦ Mutation Operators
◦ Fitness Function
 Results of TSP using GA
A Short Video
on Google AI at the end
31
Session 30: Focus
 Game Playing in AI
 Prisoner’s Dilemma
 Types of Games
 Adversarial Search
◦ Games
 Zero-sum Game
◦ Example: Chess
 Game Trees
◦ Tic-tac-toe: Example
◦ Chess (complexity)
32
Session 31: Focus
 Game Trees
◦ MAX and MIN
◦ Example Game Tree
◦ Quiz 1 and Quiz 2
 Minimax Rule
◦ Backed up Value on Game Tree
33
Session 32: Focus
 Game Trees - Recap
 Game Strategy - Recap
 Game Tree Definition
◦ Example
34
Session 33: Focus
 Game Trees Definitions - Recap
 Minimax Rule
◦ Using the Game tree for Game Playing
◦ Backed up Value on Game Tree
◦ Example
◦ MINIMAX Algorithm (from Ref 1)
35
Session 34: Focus
 Minimax Decision Algorithm
◦ Example
 Three Player Game Tree
◦ Example
36
Session 35: Focus
 Game Playing Strategy
◦ Strategy for MAX
◦ Strategy for both MAX and MIN
◦ Optimal Strategy: And-Or Problem
◦ What more can you do with Game Trees?
37
Session 36: Focus
 Evaluation Function
◦ Range of Outcome Values
◦ Evaluation Function in Chess
◦ Deep Blue: Chess program
 Game Playing Algorithm
◦ One-ply look-ahead
◦ k-ply look-ahead
◦ Game Playing Algorithm
38
Session 37: Focus
 Alpha-Beta Pruning
◦ Issues with Minimax Search
◦ Example 1
◦ Pruning during Minimax Search
◦ Example 2
39
Session 38: Focus
 Quiz 1
 Understanding Minimax Algorithm
 Alpha-Beta Values
◦ Definitions
 Alpha-Beta Cutoffs
 Influence of a Node on the root
 When do cutoffs happen?
 Example 1
 Alpha-Beta Algorithm – Read the Ref 2 book
 Example 2: Homework
40
Session 39: Focus
 Constraint Satisfaction Problems (CSP)
◦ Introduction
◦ Constraints Definition
◦ Example 1: Map Colouring
◦ Advantages of CSP
◦ Example 2: Crypto Arithmetic
◦ More Examples of CSP
 Classical AI vs Modern AI
41
Session 40: Focus
 Short Quiz
42
References (1, 2 & 3)
Ref 1 Ref 2
Ref 3
43

Artificial Intelligence Course Summary by Mouli Sankaran

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Artificial Intelligence Course Summary by Mouli Sankaran

Uploaded by

Copyright:

Available Formats

Full Course Contents on Scribd

Full Course Link:

Artificial Intelligence – © 2020 Mouli Sankaran Email: mouli.sankaran@yahoo.com

You might also like