Self-Adaptive Dynamic Obstacle Avoidance and Path Planning for USV Under Complex Maritime Environment

被引:64
作者
Liu, Xinyu [1 ]
Li, Yun [2 ]
Zhang, Jing [1 ]
Zheng, Jian [3 ]
Yang, Chunxi [1 ]
机构
[1] Kunming Univ Sci & Technol, Fac Chem Engn, Kunming 650500, Yunnan, Peoples R China
[2] Shanghai Maritime Univ, Merchant Marine Coll, Shanghai 200135, Peoples R China
[3] Shanghai Maritime Univ, Coll Transport & Commun, Shanghai 200135, Peoples R China
基金
中国国家自然科学基金;
关键词
Ant colony-clustering algorithm; dynamic path planning; adaptive searching range; smoothing mechanism; UNMANNED SURFACE VEHICLE; ALGORITHM; NAVIGATION; GUIDANCE; SUPPORT; COLONY;
D O I
10.1109/ACCESS.2019.2935964
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The unmanned surface vehicle (USV) is usually required to perform some tasks with the help of static and dynamic environmental information obtained from different detective systems such as shipborne radar, electronic chart, and AIS system. The essential requirement for USV is safe when suffered an emergency during the task. However, it has been proved to be difficult as maritime traffic is becoming more and more complex. Consequently, path planning and collision avoidance of USV has become a hot research topic in recent year. This paper focuses on dynamic obstacle avoidance and path planning problem of USV based on the Ant Colony Algorithm (ACA) and the Clustering Algorithm (CA) to construct an auto-obstacle avoidance method which is suitable for the complicated maritime environment. In the improved ant colony-clustering algorithm proposed here, a suitable searching range is chosen automatically by using the clustering algorithm matched to different environmental complexities, which can make full use of the limited computing resources of the USV and improve the path planning performances firstly. Second, the dynamic searching path is regulated and smoothed by the maneuvering rules of USV and the smoothing mechanism respectively, which can effectively reduce the path length and the cumulative turning angle. Finally, a simulation example is provided to show that our proposed algorithm can find suitable searching range according to different obstacle distributions, as well as accomplish path planning with good self-adaptability. Therefore, a safe dynamic global path with better optimize performances is achieved with the help of multi-source information.
引用
收藏
页码:114945 / 114954
页数:10
相关论文
共 27 条
[1]   A switching formation strategy for obstacle avoidance of a multi-robot system based on robot priority model [J].
Dai, Yanyan ;
Kim, YoonGu ;
Wee, SungGil ;
Lee, DongHa ;
Lee, SukGyu .
ISA TRANSACTIONS, 2015, 56 :123-134
[2]   Ant system: Optimization by a colony of cooperating agents [J].
Dorigo, M ;
Maniezzo, V ;
Colorni, A .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 1996, 26 (01) :29-41
[3]   Neural networks based reinforcement learning for mobile robots obstacle avoidance [J].
Duguleana, Mihai ;
Mogan, Gheorghe .
EXPERT SYSTEMS WITH APPLICATIONS, 2016, 62 :104-115
[4]  
Fei X., 2017, THESIS
[5]  
Fujii Y, 1980, Navigation, V65, P17
[6]   A Review of Motion Planning Techniques for Automated Vehicles [J].
Gonzalez, David ;
Perez, Joshue ;
Milanes, Vicente ;
Nashashibi, Fawzi .
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2016, 17 (04) :1135-1145
[7]  
Hara K., 1991, J. Jpn. Inst. Navig., V85, P33, DOI [10.9749/jin.85.33, DOI 10.9749/JIN.85.33]
[8]   A new mobile robot navigation using a turning point searching algorithm with the consideration of obstacle avoidance [J].
Hong, Jinpyo ;
Park, Kyihwan .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2011, 52 (5-8) :763-775
[9]   Angular rate-constrained path planning algorithm for unmanned surface vehicles [J].
Kim, Hanguen ;
Kim, Donghoon ;
Shin, Jae-Uk ;
Kim, Hyongjin ;
Myung, Hyun .
OCEAN ENGINEERING, 2014, 84 :37-44
[10]   Applying the dynamic predictive guidance to ship collision avoidance: Crossing case study simulation [J].
Kozynchenko, Alexander I. ;
Kozynchenko, Sergey A. .
OCEAN ENGINEERING, 2018, 164 :640-649