A constrained locking sweeping method and velocity obstacle based path planning algorithm for unmanned surface vehicles in complex maritime traffic scenarios

被引:17
作者
Su, Yumin [1 ]
Luo, Jing [1 ]
Zhuang, Jiayuan [1 ]
Song, Shengqing [1 ]
Huang, Bing [1 ]
Zhang, Lei [1 ]
机构
[1] Harbin Engn Univ, Sci & Technol Underwater Vehicle Lab, Harbin 150001, Peoples R China
基金
中国国家自然科学基金;
关键词
Unmanned surface vehicles; Path planning; Locking sweeping method; Velocity obstacle; Yaw-velocity performance; OPTIMIZATION;
D O I
10.1016/j.oceaneng.2022.113538
中图分类号
U6 [水路运输]; P75 [海洋工程];
学科分类号
0814 ; 081505 ; 0824 ; 082401 ;
摘要
Unmanned surface vehicles (USVs) have wide applicability owing to their high velocities, intelligence, and unmanned operational characteristics, and therefore, they have garnered considerable research interest. To accommodate complex maritime environments comprising static/dynamic obstacles, a novel efficient pathplanning algorithm called the constrained locking sweeping method and velocity obstacle (CLSM-VO) is developed. This algorithm uses the locking sweeping method (LSM) to provide the initial yaw angle for the velocity obstacle (VO) algorithm. While retaining the performance of the VO algorithm, the initial yaw angle based on the LSM can help the VO algorithm optimise the global search performance. Compared with conventional path-planning algorithms, the proposed algorithm demonstrates higher computational efficiency and is applicable to complex dynamic environments with multiple moving obstacles. Additionally, a constraint layer is designed, by combining the proposed algorithm with the yaw-velocity performance of the Tianxing-1 USV, such that the generated path exhibits better smoothness. The adjustable avoidance distance calculated by the proposed algorithm can help prevent collision accidents compared to that by existing algorithms. To evaluate the algorithm performance, particularly the capacity to handle complex dynamic environments, multiple simulations are performed in environments built using electronic nautical charts. The results indicate that the proposed algorithm can effectively handle complex maritime traffic scenarios by generating smooth and safe trajectories.
引用
收藏
页数:14
相关论文
共 42 条
[1]  
[Anonymous], 2017, Mar. Technol.
[2]   SOME IMPROVEMENTS FOR THE FAST SWEEPING METHOD [J].
Bak, Stanley ;
McLaughlin, Joyce ;
Renzi, Daniel .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2010, 32 (05) :2853-2874
[3]   Research on fuzzy control of path tracking for underwater vehicle based on genetic algorithm optimization [J].
Chen, JiaWang ;
Zhu, Huangchao ;
Zhang, Lei ;
Sun, Yuxia .
OCEAN ENGINEERING, 2018, 156 :217-223
[4]  
[陈继清 Chen Jiqing], 2021, [计算机科学, Computer Science], V48, P327
[5]   Theta*: Any-Angle Path Planning on Grids [J].
Daniel, Kenny ;
Nash, Alex ;
Koenig, Sven ;
Felner, Ariel .
JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2010, 39 :533-579
[6]  
Dijkstra E., NUMER MATH, V1, P269, DOI [10.1007/BF01386390, DOI 10.1007/BF01386390]
[7]   Motion planning in dynamic environments using velocity obstacles [J].
Fiorini, P ;
Shiller, Z .
INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, 1998, 17 (07) :760-772
[8]   Multi-objective shape optimization of autonomous underwater glider based on fast elitist non-dominated sorting genetic algorithm [J].
Fu, Xiaoyun ;
Lei, Lei ;
Yang, Gang ;
Li, Baoren .
OCEAN ENGINEERING, 2018, 157 :339-349
[9]   Robot formation motion planning using Fast Marching [J].
Garrido, Santiago ;
Moreno, Luis ;
Lima, Pedro U. .
ROBOTICS AND AUTONOMOUS SYSTEMS, 2011, 59 (09) :675-683
[10]  
Goldber D. E., 1988, Machine Learning, V3, P95, DOI 10.1023/A:1022602019183