Artificial Intelligence by Prof. Deepak Khemani

Deepak Khemani, Professor at IIT Madras at the Department of Computer Science and Engineering, is providing an introduction to artificial intelligence.

Topics include Introduction: Overview and Historical Perspective, Turing test, Physical Symbol Systems and the scope of Symbolic AI, Agents; State Space Search: Depth First Search, Breadth-First Search, DFID; Heuristic Search: Best First Search, Hill Climbing, Beam Search, Tabu Search; Randomized Search: Simulated Annealing, Genetic Algorithms, Ant Colony Optimization; Finding Optimal Paths: Branch and Bound, A*, IDA*, Divide and Conquer approaches, Beam Stack Search; Problem Decomposition: Goal Trees, AO*, Rule-Based Systems, Rete Net; Game Playing: Minimax Algorithm, Alpha-Beta Algorithm, SSS*; Planning and Constraint Satisfaction: Domains, Forward and Backward Search, Goal Stack Planning, Plan Space Planning, Graphplan, Constraint Propagation; Logic and Inferences: Propositional Logic, First Order Logic, Soundness and Completeness, Forward and Backward chaining.

Mod-01 Lec-01 Artificial Intelligence: Introduction

Mod-01 Lec-02 Introduction to AI

Mod-01 Lec-03 AI Introduction Philosophy

Mod-01 Lec-04 AI Introduction

Mod-01 Lec-05 Introduction Philosophy

Mod-01 Lec-06 State Space Search Intro

Mod-01 Lec-07 Search-DFS and BFS

Mod-01 Lec-8 Search DFID

Mod-01 Lec-9 Heuristic Search

Mod-01 Lec-10 Hill Climbing

Mod-01 Lec-11 Solution Space Search,Beam Search

Mod-01 Lec-12 TSP Greedy Methods

Mod-01 Lec-13 Tabu Search

Mod-01 Lec-14 Optimization I (Simulated Annealing)

Mod-01 Lec-15 Optimization II (Genetic Algorithms)

Mod-01 Lec-16 Population Based Methods for Optimization

Mod-01 Lec-17 Population Based Methods II

Mod-01 Lec-18 Branch and Bound,Dijkstra’s Algorithm

Mod-01 Lec-19 A* Algorithm

Mod-01 Lec-20 Admissibility of A*

Mod-01 Lec-21 A* Monotone Property,Iteractive Deeping A*

Mod-01 Lec-22 Recursive Best First Search,Sequence Allignment

Mod-01 Lec-23 Pruning the Open and Closed Lists

Mod-01 Lec-24 Problem Decomposition with goal Trees

Mod-01 Lec-25 AO * Algorithm

Mod-01 Lec-26 Game Playing

Mod-01 Lec-27 Game Playing Minimax Search

Mod-01 Lec-28 Game Playing AlphaBeta

You May Also Like

Leave a Reply

Your email address will not be published. Required fields are marked *