We present two "motion planning" algorithms: algorithms which find a path for an object among obstacles. The target for these algorithms is the motion of a robot. the space is a two-dimensional space; the the robot and the obstacles are polygons.
In this presentation, the robot polygon and the obstacles are fixed, and so the visualization of the algorithm simply displays the steps to be followed in order to compute a path without collisions among the obstacles. In the second presentation, the algorithm finds the shortest path among the obstacles; this algorithm relies on Dijkstra's shortest path algorithm, which is not presented or visualized here.
These movies were made by Nicholas Bergson-Shilcock, F&M, 2006.
Click the Download button at the right to download a zipped file of all movies described on this page.