Learn · Artificial Intelligence: Search Methods For Problem solving
Lecture 45 of 95Week 6
Divide & Conquer Frontier Search.
Prof. Deepak Khemani · IIT Madras
Credits and licence
- From
- Artificial Intelligence: Search Methods For Problem solving, IIT Madras (at NPTEL)
- Licence
- CC BY-NC-SA, as NPTEL states it. Non-commercial use only.
- Attribution
- NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge.
- Who can watch
- Tweens profiles and older. How courses are placed
All the lectures
- 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
- 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
- State Space Search
- Domain Independent Algorithms
- Deterministic Search
- DFS and BFS
- Comparing DFS and BFS
- Depth First Iterative Deepening
- Heuristic Search
- Heuristic Functions and the Search Landscape
- Solution Space Search
- The Traveling Salesman Problem
- Escaping Local Optima
- Stochastic Local Search
- Genetic Algorithms: Survival of the Fittest
- Genetic Algorithms and SAT
- Genetic Algorithms for the TSP
- Emergent Systems
- Ant Colony Optimization
- Finding Optimal Paths
- Branch & Bound
- Algorithm A*
- A*: An illustrated example
- Is A* Admissible?
- Admissibility of A*
- Higher, Faster ...
- 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
- 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
- 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
- Means-Ends Analysis
- The Planning Graph
- Algorithm Graphplan
- Problem Decomposition
- Algorithm AO*
- AO*: An Illustration
- 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
- Reasoning in Logic
- Rules of Inference
- Forward Reasoning
- First Order Logic
- Implicit Quantifier Notation
- Backward Reasoning
- Depth First Search on Goal Trees
- Incompleteness...
- Constraint Satisfaction Problems
- Binary Constraint Networks
- Interpreting Line Drawings
- Model Based Diagnosis
- Solving CSPs
- Arc Consistency
- Propagation = Reasoning
- Lookahead Search