Motion Planning Algorithms
from start to finish without bumping into obstacles
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 does 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.
Remember the guidelines for the use of these movies.
Three movies are available: Finding two different paths among four objects; finding the shortest path among four objects. One of the motion planning movies includes pauses to pose questions to the viewer. The movies were made by Nicholas Bergson-Shilcock, F&M 2006.
|
||
|
