Artificial Intelligence-Artificial Intelligence (AI) is a field that is constantly growing and changing.

Artificial Intelligence (AI) is a field that is constantly growing and changing.

Artificial Intelligence

Artificial Intelligence (AI) is a field that is constantly growing and changing.

A brief summary

Artificial Intelligence (AI) is a field that is still constantly growing and changing. You’ll learn the basics of modern AI as well as some of the representative applications of AI. You will also learn about the numerous applications and huge possibilities in the field of AI, which continues to expand human capability beyond our imagination.Artificial Intelligence (AI) technology is increasingly prevalent in our everyday lives. It has uses in a variety of industries from gaming, journalism/media, to finance, as well as in the state-of-the-art research fields from robotics, medical diagnosis, and quantum science.


These are the videos from NPTEL, provided in a structured form, in order to make the learning process easy.

Instructor:

NPTEL

What you will learn

Introduction to AI                     State Space Search

Heuristic Search                      Randomized Search

Finding Optimal Path               Problem Decomposition

Game Playing                          Planning and Constraint Satisfaction

Logic and Inferences

Course Fee: Free

Certification By: Not Certified

Introduction

Artificial Intelligence: Introduction, AI Introduction Philosophy

State Space Search, Heuristic Search

State Space Search Intro, Search-DFS and BFS, Search DFID, Heuristic Search, Hill Climbing

Randomized Search, Finding Optimal Path

Solution Space Search,Beam Search, TSP Greedy Methods, Tabu Search, Optimization I (Simulated Annealing), Optimization II (Genetic Algorithms), Population Based Methods for Optimization, Branch and Bound,Dijkstra's Algorithm

Problem Decomposition, Game Playing

A* Algorithm, Admissibility of A*, A* Monotone Property,Iteractive Deeping A*, Recursive Best First Search,Sequence Allignment, Pruning the Open and Closed Lists, Problem Decomposition with goal Trees, AO * Algorithm, Game Playing, Game Playing Minimax Search, Game Playing AlphaBeta, Game Playing SSS

Planning and Constraint Satisfaction, Logic and Inferences

Rule Based Systems, Inference Engines, Rete Algorithm, Planning, Planning FSSP,BSSP,Goal Stack Planning Sussman's Anomaly, Non Linear Planning, Graph Plan, Constraint Satisfaction Problems, CSP Continued, Knowlege Based Systems, Propositional Logic, Resolution Refutation for PL, First Order Logic (FOL), Reasoning in FOL, Backward Chaining, Resolution for FOL

Back to top