Underwater path planing using fast marching algorithms

@article{Petres2005UnderwaterPP,
  title={Underwater path planing using fast marching algorithms},
  author={Clement Petres and Yan Pailhas and Y. P{\'e}tillot and D. M. Lane},
  journal={Europe Oceans 2005},
  year={2005},
  volume={2},
  pages={814-819 Vol. 2}
}
In this paper, new tools for obstacle avoidance and path planning for underwater vehicles are presented. The authors' technique, based on a level set formulation of the path planning problem, extracts optimal paths from complex and continuous environments in a complete and consistent manner. Fast marching algorithm is known to be efficient for finding cost optimal path in mobile robotics because of its reliability, precision, and simple implementation. Fast marching algorithm originally… CONTINUE READING
Highly Cited
This paper has 49 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 32 extracted citations

Intelligent Robotics and Applications

Lecture Notes in Computer Science • 2014
View 11 Excerpts
Highly Influenced

Path planning for reconfigurable rovers in planetary exploration

2017 IEEE International Conference on Advanced Intelligent Mechatronics (AIM) • 2017
View 1 Excerpt

References

Publications referenced by this paper.
Showing 1-9 of 9 references

LaVallee, Plunning Algorifhm

S M.
University of Illinois, • 2005

Fast methods for the eikonal and related hamiltonjacobi equations on ustnrctured meshes

A. Vladimirsky
Applied Muthemarics • 2004

Front propagation with cuvature dependent speed : algorithms based on hamiltonjacobi formulations

S. J. Osher
Journal of Computational Physics • 2003

Fast methods for the Eikonal and related Hamilton- Jacobi equations on unstructured meshes.

Proceedings of the National Academy of Sciences of the United States of America • 2000

Similar Papers

Loading similar papers…