Abstract

This paper proposes an optimal control-based method named the rapid-Gauss pseudospectral method (RGPM) to obtain a smooth time-optimal path for unmanned surface vehicles (USVs). It is a general global path planning method, improving the Gauss pseudospectral method (GPM) which cannot be applied to complex ocean scenarios. In addition, we optimize the representation of obstacles and add a Maklink algorithm to reduce the computaitonal cost. More specifically, a unified obstacle modeling approach is first introduced, then a continuous-time-optimal-control path planning problem considering USV kinematics is formulated. The orthogonal collocation method is used to discretize the continuous-time-optimal control problem into a nonlinear programming (NLP) problem. Furthermore, we introduce a mesh refinement technique to achieve collision avoidance between adjacent discrete points. To enhance computational efficiency, an initialization and iteration approach is further proposed. Herein, a MAKLINK graph is established to obtain a suboptimal path as the initial guess for the NLP problem. Obstacle-avoidance constraints are iteratively updated according to whether or not there are collisions in the current path. The proposed method was compared with the traditional GPM under two different scenarios. The simulation results show that the proposed method is superior to the traditional GPM in terms of path quality and convergence speed and can obtain quasi-time-optimal paths under complex conditions simultaneously.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.