Overview
Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Learn about heuristic search algorithms and the A* pathfinding technique in this comprehensive lecture from Memorial University's Artificial Intelligence course. Explore the fundamentals of Best-First Search (BeFS) and its greedy variant, understand the crucial concepts of heuristic functions and admissible heuristics, and master the A* search algorithm through detailed explanations and step-by-step examples. Delve into important topics like consistent heuristics, algorithm performance comparisons, and memory optimization techniques. Watch practical demonstrations of search algorithms in action and discover how weighted A* can be implemented for more efficient pathfinding solutions. The lecture concludes with an interactive search demo that reinforces the theoretical concepts through visual examples.
Syllabus
- Introduction
- Heuristic Search
- Best-First Search BeFS
- Heuristic Function hn
- Greedy Best-First Search GBeFS
- Admissible Heuristic
- A* Search Algorithm
- Consistent Heuristic
- Search Algorithm Comparison
- Memory Optimization
- A* Search Performance
- A* Search Step-By-Step Example
- Weighted A*
- Search Demo
Taught by
Dave Churchill