Heuristic Search and A* Search Algorithm - Lecture 5

Explore the fundamentals of heuristic search and the A* search algorithm in this comprehensive lecture from the Introduction to Artificial Intelligence course. Delve into informed search techniques, including Best-First Search (BeFS) and Greedy Best-First Search (GBeFS), while understanding the crucial role of heuristic functions. Examine the concept of admissible heuristics before diving deep into the A* search algorithm, its pseudocode, performance characteristics, and a detailed example. Conclude with an introduction to Weighted A* Search and observe its application through an interactive demo. Access the provided search demo link to visualize and experiment with the concepts discussed throughout the lecture.

- Intro
- Informed Heuristic Search
- Best-First Search BeFS
- Heuristic Function hn
- Greedy Best-First Search GBeFS
- Search Demo
- Admissible Heuristic
- A* Search Algorithm
- Consistent Heuristic
- A* Pseudocode Comparison / Optimization
- A* Search Performance
- A* Search Detailed Example
- Weighted A* Search
- Weighted A* Demo