Lecture 2: Discrete motion planning

(Big slides Download Big slides) (Small slides Download Small slides) (Recordings from 2023)

This lecture explains some main ideas of discrete motion planning:

• Shortest path problems
• Finding the shortest path by value iteration
• Dijkstra's algorithm
• The A* algorithm --- find shortest path to a particular node

Recommended text: Section 1.1-2.3 of the book "Planning Algorithms" by LaValle. Links to an external site.