Lectures related to Pathfinding

Covers global navigation, path planning algorithms, cell decomposition, potential field methods, and stigmergy-based path optimization.

Covers Dijkstra's algorithm and its application to the all-pairs shortest path problem.

Explores optimization problems solved with greedy algorithms and proves the optimality of the Cashier's Algorithm for U.S. coins.

Explores optimization problems and greedy algorithms to find the best solutions efficiently.

Introduces the concept of shortest path, discussing weighted paths, Hamiltonian paths, and path optimization algorithms.

Explores Dijkstra's algorithm for finding the shortest path in a network with non-negative costs and permanent labels.

Explores paths in networks, brain connectivity, shortest path routing, network efficiency, navigation, and upcoming midterm.

Covers Dijkstra's algorithm for shortest path problems and its application in ALL-TO-ONE and ALL-PAIRS algorithms.