Introduction – State space search – State space search – DFS – DFID – Heuristic Search – Hill Climbing – Solution space search , Beam search – TSP greedy methods – Tabu search – Randomized: Simulated Annealing – Genetic Algorithms (GA) – GAs continued – GAs for TSP, Ant colony optimization – Branch & Bound – A* – A* admissibility – A* – Monotone condition, IDA* – RBFS, Sequence alignment – Pruning – DCFS, SMGS, BSS, DCBSS – Problem Decomposition – AO* – Game playing – Game playing – Minimax – Game playing – AlphaBeta – Game Playing – SSS* – Rule Based Systems – Inference Engines – Rete Algorithm – Planning – Planning FSSP, BSSP – Goal Stack Planning. Sussman’s Anomaly – Non-linear planning – Plan Space Planning – GraphPlan – Constraint Satisfaction Problems (CSP) – CSP, AC-1 – Knowledge Based Systems – Knowledge Based Systems – Propositional Logic – Resolution refutation for PL – First Order Logic (FOL) – Reasoning in FOL – Backward Chaining – Resolution method for FOL

Other Resources

Course Curriculum

Artificial Intelligence: Introduction Details 56:3
Introduction to AI Details 51:55
AI Introduction Philosophy Details 44:12
AI Introduction I Details 53:19
Introduction Philosophy Details 35:12
State Space Search Intro Details 54:3
Search-DFS and BFS Details 54:11
Search DFID Details 51:10
Heuristic Search Details 55:49
Hill Climbing Details 44:28
Solution Space Search,Beam Search Details 42:40
TSP Greedy Methods Details 52:26
Tabu Search Details 38:18
Optimization I (Simulated Annealing) Details 48:14
Optimization II (Genetic Algorithms) Details 53:39
Population Based Methods for Optimization Details 51:7
Population Based Methods II Details 58:25
Branch and Bound,Dijkstra’s Algorithm Details 56:7
A* Algorithm Details 49:32
Admissibility of A* Details 51:23
A* Monotone Property,Iteractive Deeping A* Details 46:31
Recursive Best First Search,Sequence Allignment Details 49:46
Pruning the Open and Closed Lists Details 50:24
Problem Decomposition with goal Trees Details 48:12
AO * Algorithm Details 47:3
Game Playing Details 44:7
Game Playing Minimax Search Details 45:59
Game Playing AlphaBeta Details 47:46
Game Playing SSS I Details 50:13
Rule Based Systems Details 47:32
Inference Engines Details 41:9
Rete Algorithm Details 49:27
Planning Details 50:23
Planning FSSP,BSSP Details 53:30
Goal Stack Planning Sussman’s Anomaly Details 50:10
Non Linear Planning Details 45:54
Plan Space Planning Details 50:50
Graph Plan Details 47:50
Constraint Satisfaction Problems Details 0:52
CSP Continued Details 49:25
Knowlege Based Systems Details 53:21
Knowledge Based Systems PL I Details 49:39
Propositional Logic Details 48:56
Resolution Refutation for PL Details 40:59
First Order Logic (FOL) Details 52:46
Reasoning in FOL Details 49:18
Backward Chaining Details 53:10
Resolution for FOL Details 46:6

This course is part of NPTEL online courses, delivered by IIT Madras.

Course Reviews

N.A

ratings
  • 5 stars0
  • 4 stars0
  • 3 stars0
  • 2 stars0
  • 1 stars0

No Reviews found for this course.

About

FreeVideoLectures Provides you complete information about best courses online, Video tutorials, helps you in building a career !!

help@freevideolectures.com

Learn More About us

About Us
Privacy Policy
FAQ

FREEVIDEOLECTURES.COM ALL RIGHTS RESERVED.
top
FreeVideoLectures.com All rights reserved.

Setup Menus in Admin Panel