Lecture 7: Princeton: Introduction to Robotics | "Optimal Discrete Planning"
Introduction to Robotics @ Princeton · 67:14
This lecture moves graph-search motion planning from simply finding a path to finding the lowest-cost path. It covers Dijkstra's algorithm, which always expands the vertex with the lowest estimated cost-to-come, and A...