Automatic berthing trajectory planning for an underactuated ship based on A* and extended dynamic window algorithm
To optimize the trajectory planning problem of un-deractuated ship automatic berthing and avoid getting stuck in local optima,a real-time trajectory planning method consider-ing the overall constraints of the ship kinematic model and ob-stacle constraints was proposed. Based on the gridded map,the A* algorithm was used to plan the global optimal path,and the redundant point deletion strategy was applied to obtain the reference waypoints for trajectory planning. Considering that ship berthing was a dynamic process,the extended dy-namic window algorithm (EDWA) was used to predict the berthing trajectory of the ship during the constant force stage and deceleration stage,and the proportional integral derivative (PID) control method was introduced to adjust the ship's heading. After conducting feasibility tests on all predicted traj-ectories,the optimal trajectory was obtained by using an eval-uation function that considers constraints such as target points,reference waypoints,and obstacles,and the corre-sponding force was used as the control input for the ship. Re-peat the above steps for real-time planning based on the cur-rent control input and motion state of the ship at the next sam-pling time until the ship reached the target point. The feasibil-ity of the proposed method was verified by using the simulation scenario of Rizhao port. Results show that the proposed meth-od can guide ships to avoid obstacles and reach the designated berth in a relatively short time,the distance between the traj-ectory and the nearest obstacle is 144.1428 m,and the trajec-tory length is 47.26 m longer than the traditional A*+EDWA,however,the planning time is reduced by 55.12%,which show the superiority of the proposed method.