Curvature path planning with high resolution graph for unmanned surface vehicle

29Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we propose a curvature path planning algorithm for unmanned surface vehicles (USVs). To control the USV automatically, various robot navigation techniques can be applied and numerous researchers are working on a grid map-based path planning algorithms. However, the most grid map-based path planning methods for the USVs consider only two-dimensional (x, y) plane without considering vehicle's maximum curvature. Since the most of the USVs are typically highly under-actuated, the ship tends to result in failure and sometimes induces hazardous collision situation when the ship follows the resultant path generated by the two-dimensional path planning algorithm. To solve this problem, we construct a non-uniform grid map which can reflect the geometric cost. Next we extend the dimension to reflect the kinematic constraint of the USV. Finally, to consider the vehicle's dynamic constraint, we propose a new cost function. The result of the proposed algorithm has been demonstrated through the simulation on the real map and the results show that the proposed algorithm generates the most plausible and efficient path. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Kim, H., Park, B., & Myung, H. (2013). Curvature path planning with high resolution graph for unmanned surface vehicle. In Advances in Intelligent Systems and Computing (Vol. 208 AISC, pp. 147–154). Springer Verlag. https://doi.org/10.1007/978-3-642-37374-9_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free