Stanford AA274A Principles of Robotic Autonomy | Autumn 2019 | Motion Planning Graph Search Methods

Stanford Online · 75:22

This lecture introduces motion planning as an optimal-control problem with non-convex obstacle constraints, then shows how to turn the continuous problem into a graph search via grids and label-correction methods (Dij...

Read the full summary on tuber

Redirecting...