Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 4 additions & 0 deletions GeometricMotionPlanning.ipynb
Original file line number Diff line number Diff line change
Expand Up @@ -416,6 +416,10 @@
" --- straightening the path when possible --- can be made to find the\n",
"shortest path passing through the cells produced by the algorithm. However, the sequence of cells may indeed miss the true shortest path.\n",
"\n",
"An animated explanation of the process described above can be found here\n",
"\n",
"<video src=\"animations/media/motion_planning/TrapezoidDecomp.mp4\" width=\"500\" height=\"300\" controls></video>\n",
"\n",
"### Approximate cell decomposition\n",
"\n",
"Exact cell decomposition algorithms have been extended to 3D spaces with polyhedral obstacles, but in general require sophisticated geometric reasoning about how the free space is cut into convex polyhedra. An alternative technique is *approximate cell decomposition*, in which we do not worry about creating a decomposition of the true free space, but rather create cells that are contained in the free space.\n",
Expand Down
Loading