Track 07
Motion Planning
Getting the robot from A to B without hitting anything, violating limits, or burning actuators. From A* to trajectory optimization.
10 published · 0 planned · 10 lessons total
- 01→
Configuration space and C-obstacles
PublishedThe mental shift that makes motion planning tractable: stop thinking about the robot as a shape moving through the world. Think of it as a point moving through a higher-dimensional space.
~13 min
- 02→
Graph search: A*, Dijkstra, D*-lite
PublishedThe classics, and the reason D*-lite still runs on real robots in 2026. Path-planning fundamentals you'll re-implement for 80% of mobile-robot work.
~14 min
- 03→
Sampling-based planning: PRM
PublishedProbabilistic roadmaps — precomputed paths for repeated queries in high-DOF spaces. The first sampling-based planner, still the right answer when you'll plan from many starts to many goals on the same map.
~12 min
- 04→
RRT, RRT*, and variants
PublishedThe go-to sampling-based planner for high-DOF arms. How the tree grows, why RRT* gives asymptotically optimal paths, and the variants (informed-RRT*, BIT*) that made it ship in production.
~17 min
- 05→
Trajectory optimization: direct collocation and shooting
PublishedPlanning via continuous optimization. The backbone of modern MPC, long-horizon arm motion, and aggressive drone trajectories. Direct collocation, shooting, and the practical patterns that converge.
~14 min
- 06→
CHOMP and STOMP
PublishedGradient-based and sampling-based trajectory optimizers that power MoveIt's advanced planners. The two ways to refine a noisy initial trajectory into smooth, collision-free motion.
~12 min
- 07→
MPC as a motion planner
PublishedWhen the line between control and planning blurs. MPC re-plans every tick over a finite horizon, replacing a slow planner + fast controller with a single layer that does both. The pattern autonomous cars adopted.
~12 min
- 08→
Task and motion planning (TAMP)
PublishedCombining discrete logic (what to do) with continuous motion (how to move). The frontier of long-horizon autonomy — and the architecture behind 'put the dish in the dishwasher.'
~13 min
- 09→
Behavior trees for robot autonomy
PublishedThe structure every modern robot-autonomy stack (Nav2, NASA, Sony) converged on. Why trees beat state machines, and how to actually use BT.cpp / py_trees in production.
~13 min
- 10→
Planning under uncertainty
PublishedPOMDPs, belief-space planning, and the algorithms for robots that can't see everything. Why most robot tasks are partially observable, and the practical methods that handle it.
~13 min