Artificial Intelligence Search Methods For Problem Solving

Overview

Syllabus 13

1. Week 0
   • Prologue
   • The Winograd Schema Challenge
   • Introduction (2013 version)
   • Can Machines Think?
   • The Turing Test
   • Language and Thought
   • The Willing Suspension of Disbelief
   • Machines with Wheels and Gears
2. Week 1
   • The Notion of Mind in Philosophy
   • Reasoning = Computation
   • Concepts and Categories
   • How did AI get its name?
   • The Chess Saga
   • A Brief History of AI
   • The Worlds in our Minds
   • Epiphemona in Computers
3. Week 2
   • State Space Search
   • Domain Independent Algorithms
   • Deterministic Search
   • DFS and BFS
   • Comparing DFS and BFS
   • Depth First Iterative Deepening
4. Week 3
   • Heuristic Search
   • Heuristic Functions and the Search Landscape
   • Solution Space Search
   • The Traveling Salesman Problem
   • Escaping Local Optima
   • Stochastic Local Search
5. Week 4
   • Genetic Algorithms: Survival of the Fittest
   • Genetic Algorithms and SAT
   • Genetic Algorithms for the TSP
   • Emergent Systems
   • Ant Colony Optimization
6. Week 5
   • Finding Optimal Paths
   • Branch & Bound
   • Algorithm A*
   • A*: An illustrated example
   • Is A* Admissible?
   • Admissibility of A*
   • Higher, Faster ...
7. Week 6
   • B&B - A* - wA* - Best First
   • A*: Leaner Admissible Variations
   • The Monotone Condition
   • DNA Sequence Alignment
   • Divide & Conquer Frontier Search.
   • Variations on A*: The story so far
   • Smart Memory Graph Search
   • Breadth First Heuristic Search
   • Beam Stack Search
8. Week 7
   • Game Theory
   • Popular Recreational Games
   • Board Games and Game Trees
   • The Evaluation Function in Board Games
   • Algorithm Minimax and Alpha-Beta Pruning
   • A Cluster of Strategies
   • SSS*: A Best First Algorithm
   • SSS*: A Detailed Example
9. Week 8
   • Automated Domain Independent Planning
   • The Blocks World Domain
   • State Space Planning: Forward and Backward
   • Goal Stack Planning (GSP)
   • GSP: A Detailed Example
   • Plan Space Planning (PSP)
   • PSP: A Tiny Example
   • Multi-Armed Robots
10. Week 9
    • Means-Ends Analysis
    • The Planning Graph
    • Algorithm Graphplan
    • Problem Decomposition
    • Algorithm AO*
    • AO*: An Illustration
11. Week 10
    • Rule Based Expert Systems
    • The Inference Engine
    • The OPS5 Language
    • Conflict Resolution
    • Business Rule Management Systems
    • The Rete Net
    • Rete Algorithm: Optimizing the Match
    • Rete Algorithm: Conflict Resolution
12. Week 11
    • Reasoning in Logic
    • Rules of Inference
    • Forward Reasoning
    • First Order Logic
    • Implicit Quantifier Notation
    • Backward Reasoning
    • Depth First Search on Goal Trees
    • Incompleteness...
13. Week 12
    • Constraint Satisfaction Problems
    • Binary Constraint Networks
    • Interpreting Line Drawings
    • Model Based Diagnosis
    • Solving CSPs
    • Arc Consistency
    • Propagation = Reasoning
    • Lookahead Search

Advantages and disadvantages

Some points apply to every course of this kind; see how we rank.

Taught by

• Prof. Deepak KhemaniIIT Madras