YoVDO

A* Search: How Map Applications Find Shortest Routes

Offered By: Reducible via YouTube

Tags

Graph Theory Courses Computer Science Courses Data Structures Courses Greedy Algorithms Courses Heuristics Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the algorithms behind modern mapping applications for finding optimal routes in this 16-minute video. Delve into graph representation, greedy approaches, Uniform Cost Search (UCS), and A* Search. Learn how A* Search combines rigorous and opportunistic approaches to optimize time, distance, and cost. Discover the principles behind route optimization through step-by-step explanations and animations. Gain insights into the comparison between greedy methods and UCS, as well as the optimality of A* Search. Understand how these algorithms power the shortest route calculations in map applications you use daily.

Syllabus

Introduction and Graph Representation
Greedy Approach
Uniform Cost Search UCS
Greedy vs UCS
A* Search
Optimality of A* Search
Sponsorship


Taught by

Reducible

Related Courses

Algorithms: Design and Analysis, Part 2
Stanford University via Coursera Conception et mise en œuvre d'algorithmes.
École Polytechnique via Coursera Biology Meets Programming: Bioinformatics for Beginners
University of California, San Diego via Coursera 算法基础
Peking University via Coursera 算法基础 | Fundamental Algorithms
Peking University via edX