Artificial Intelligence Search Methods For Problem Solving by NPTEL
- Offered byNPTEL
Artificial Intelligence Search Methods For Problem Solving by NPTEL at NPTEL Overview
Duration | 12 weeks |
Total fee | Free |
Mode of learning | Online |
Difficulty level | Beginner |
Official Website | Explore Free Course |
Credential | Certificate |
Artificial Intelligence Search Methods For Problem Solving by NPTEL at NPTEL Highlights
- Offered by IIT Madras
- Final score comprises of 25% of average of best 8 assignments and 75% of the proctored certification exam score out of 100
- Enrollments start from 20 July 2020
- Course conducted by Prof. Deepak Khemani (IIT Madras alumni)
- Enroll for free
- Pay for Certification Examination
Artificial Intelligence Search Methods For Problem Solving by NPTEL at NPTEL Course details
- In this first course on AI we study a wide variety of search methods that agents can employ for problem solving. In a follow up course ? AI: Knowledge Representation and Reasoning ? we will go into the details of how an agent can represent its world and reason with what it knows. These two courses should lay a strong foundation for artificial intelligence, which the student can build upon. A third short course ? AI: Constraint Satisfaction Problems ? presents a slightly different formalism for problem solving, one in which the search and reasoning processes mentioned above can operate together.
Artificial Intelligence Search Methods For Problem Solving by NPTEL at NPTEL Curriculum
Week 1:
Introduction: Overview and Historical Perspective, Turing Test, Physical Symbol Systems and the scope of Symbolic AI, Agents
Week 2:
State Space Search: Depth First Search, Breadth First Search, DFID
Week 3:
Heuristic Search: Best First Search, Hill Climbing, Beam Search
Week 4:
Traveling Salesman Problem, Tabu Search, Simulated Annealing
Week 5:
Population Based Search: Genetic Algorithms, Ant Colony Optimization
Week 6:
Branch & Bound, Algorithm A*, Admissibility of A*
Week 7:
Monotone Condition, IDA*, RBFS, Pruning OPEN and CLOSED in A*
Week 8:
Problem Decomposition, Algorithm AO*, Game Playing
Week 9:
Game Playing: Algorithms Minimax, AlphaBeta, SSS*
Week 10:
Rule Based Expert Systems, Inference Engine, Rete Algorithm
Week 11:
Planning: Forward/Backward Search, Goal Stack Planning, Sussman?s Anomaly
Week 12:
Plan Space Planning, Algorithm Graphplan