Robotic Navigation

These are applets for robotic navigation with constraints. You can lay down a collection of obstacles, design the shape of your own robot, and the fix a starting point and finishing point. Once this is done, the Fast Marching Method will automatically compute and display the the solution. To understand how optimal path planning can be cast as a problem in front propagation, go to the web page on robotic navigation

There are two different applets.

• This one is very fast, but uses a relatively rough approximation mesh.
  
  
• This one is a more accurate approximation, but is somewhat slower.

References

Kimmel, R., and Sethian, J.A., Fast Marching Methods for Robotic Navigation with Constraints Center for Pure and Applied Mathematics Report, Univ. of California, Berkeley, May 1996
Sethian, J.A., Level Set Methods and Fast Marching Methods, Cambridge University Press, 1999.