MIT 6.4210/2
Robotic Manipulation
Fall 2026, Lecture 6
Visibility graph in Cspace (Lozano-Perez and Wesley) 1977-99
Handey (Lozano-Perez, et al) 1987-89
Sample-based (Barraquand, Kavraki, Latombe, LaValle, et al) 1990-2000
Hardware assist - 2016
https://github.com/KavrakiLab/vamp
CUDA-Accelerated Robot Motion Generation in Milliseconds with NVIDIA cuRobo
start
goal
fixed number of samples
collision-avoidance
(outside the \(L^1\) ball)
nonconvex
Motion Planning around Obstacles with Convex Optimization.
Tobia Marcucci, Mark Petersen, David von Wrangel, Russ Tedrake.
Available at: https://arxiv.org/abs/2205.04422
Accepted for publication in Science Robotics
Claims:
The Probabilistic Roadmap (PRM)
from Choset, Howie M., et al. Principles of robot motion: theory, algorithms, and implementation. MIT press, 2005.
Note: The blue regions are not obstacles.
Mixed-integer formulation with a very tight convex relaxation
Main idea: Multiply constraints + Perspective function machinery
+ time-rescaling