复杂水域船舶避碰路径规划研究

doi:10.3969/j.issn.16740696.2019.12.01

重庆交通大学学报（自然科学版） ›› 2019, Vol. 38 ›› Issue (12): 1-7.DOI: 10.3969/j.issn.16740696.2019.12.01

• 交通+大数据人工智能 • 下一篇

复杂水域船舶避碰路径规划研究

谢新连，何平，何傲，辛剑英

(大连海事大学综合运输研究所, 辽宁大连 116026)

收稿日期:2018-08-21 修回日期:2018-09-14 出版日期:2019-12-21 发布日期:2019-12-24
作者简介:谢新连(1956—)，男，辽宁大连人，教授，博士，主要从事交通运输规划与管理方面的研究。Email：xxlian@139.com。通信作者：何平(1995—)，男，四川巴中人，硕士研究生，主要从事交通运输规划与管理方面的研究。Email：455832384@qq.com。
基金资助:
中央高校基本科研业务费专项资金资助项目(3132016358)；国家重点研发计划资助项目(2017YFC0805309)

Collision Avoidance Path Planning of Ships in Complicated Water Areas

XIE Xinlian, HE Ping, HE Ao, XIN Jianying

(Integrated Transport Institute, Dalian Maritime University, Dalian 116026, Liaoning, P. R. China)

Received:2018-08-21 Revised:2018-09-14 Online:2019-12-21 Published:2019-12-24

摘要/Abstract

摘要： 针对目标船和碍航障碍区同时存在的复杂水域船舶避碰问题，在考虑《国际海上避碰规则》的前提下，结合避让目标船舶的预测危险区(PAD)理论、借鉴船舶领域相关成果进行的缓冲区分析以及切线图法对复杂水域进行环境建模，再用Dijkstra算法求得一条避开所有碍航区的初始路径；并利用船舶回转直径，基于改进的2turn方法对初始路径进行平滑处理，给出了避碰转弯角度和复航角度，其不仅能够平滑路径还能检验原路径的有效性；最后进行了仿真实验，验证了该方法的正确性与适用性；再与Maklink图结合Dijkstra和蚁群算法的路径规划方法进行对比分析，结果表明该方法在时间性能、路径整体的平滑性、路径优化程度等方面更具优势。

关键词: 船舶工程, 避碰路径规划, 复杂水域, 切线图法, Dijkstra算法, 2turn平滑

Abstract: For the problem of collision avoidance of ships in complicated water areas where both target ships and navigationobstructing areas exist at the same time, on the premise of considering the international regulations for preventing collisions at sea(COLREGS), the environment of complex waters was modeled by combining the predicted danger zone (PAD) theory of collision avoidance for targets ships, the buffer zone analysis referred to related achievements in the field of ship domain and the tangent graph method. And Dijkstra algorithm was used to find an initial path to avoid all the obstacle areas. Then, based on the improved 2turn method, the initial path was smoothed by using the ships turning diameter, and the collision avoidance turning angle and return angle were given, which could not only smooth the path but also test the effectiveness of the original path. Finally, the simulation experiment was carried out, and the correctness and applicability of the proposed method was verified. The path planning methods of Maklink graph, Dijkstra and ant colony algorithm were compared and analyzed. The results show that the proposed method has more advantages in time performance, smoothness of the whole path and the degree of path optimization.

Key words: ship engineering, collision avoidance path planning, complicated water areas, tangent graph method, Dijkstra algorithm, 2turn smoothing

中图分类号:

U676.1

谢新连，何平，何傲，辛剑英. 复杂水域船舶避碰路径规划研究[J]. 重庆交通大学学报（自然科学版）, 2019, 38(12): 1-7.

XIE Xinlian, HE Ping, HE Ao, XIN Jianying. Collision Avoidance Path Planning of Ships in Complicated Water Areas[J]. Journal of Chongqing Jiaotong University(Natural Science), 2019, 38(12): 1-7.

参考文献

［1］ ANTONELLI G, CHIAVERINI S, FINOTELLO R, et al. Real-time path planning and obstacle avoidance for RAIS: an autonomous underwater vehicle［J］. IEEE Journal of
Ocean Engineering, 2001, 26(2): 216-227.
［2］ CHANG Kiyin, JAN Gene-eu, PARBERRY I. A method for searching optimal routes with collision avoidance on raster charts［J］. Journal of Navigation, 2003,
56(3): 371-384.
［3］ TAM C K, BUCKNALL R. Path-planning algorithm for ships in close-range encounters［J］. Journal of Marine Science and Technology, 2010, 15(4): 395-407.
［4］ TSOU M, KAO Shenglong, SU Chienmin. Decision support from genetic algorithms for ship collision avoidance route planning and alerts［J］. Journal of
Navigation, 2010, 63(1): 167-182.
［5］ NAEEM W, IRWIN G W, YANG Aolei. COLREGs-based collision avoi-dance strategies for unmanned surface vehicles［J］. Mechatronics, 2012, 22(6): 669-678.
［6］ XU Wen, YIN Jianchuan, HU Jiangqiang, et al. Ship automatic colli-sion avoidance by altering course based on ship dynamic domain［C］// 2016 IEEE
Trustcom/BigdataSE/ISPA. Tianjin: IEEE, 2016: 2024-2030.
［7］ TAM C, BUCKNALL R. Cooperative path planning algorithm for marine surface vessels［J］. Ocean Engineering, 2013, 57 (1): 25-33.
［8］林晓杰.基于改进势场法的受限水域中船舶自动避碰模型研究［D］.哈尔滨：哈尔滨工程大学，2015.
LIN Xiaojie. Model Research on Automatic Collision Avoidance of Ships in Confined Waterways Based on Improved Potential Field Method［D］. Harbin: Harbin
Engineering University, 2015.
［9］张树凯，杨家轩，蔡垚，等.基于AIS航迹和Douglas-Peucker算法的航线自动生成方法研究［J］.重庆交通大学学报(自然科学版)，2014，33(6)：79-82.
ZHANG Shukai, YANG Jiaxuan, CAI Yao, et al. Automatic routing method based on AIS tracks and Douglas-Peucker［J］. Journal of Chongqing Jiaotong University(Natural
Science), 2014, 33(6): 79-82.
［10］程细得，刘祖源.内河船舶避碰路径优化研究［J］.武汉理工大学学报(交通科学与工程版)，2006，30(4)：576-578.
CHENG Xide, LIU Zuyuan. Trajectory optimization for inland waterway ship［J］. Journal of Wuhan University of Technology(Transportation Science & Engineering),
2006, 30(4): 576-578.
［11］ LAZAROWSKA A. Ships trajectory planning for collision avoidance at sea based on ant colony optimization［J］. Journal of Navigation, 2015, 68(2): 291-307.
［12］ TSOU M. Multi-target collision avoidance route planning under an ECDIS framework［J］. Ocean Engineering, 2016, 121(1): 268-278.
［13］ WANG Ning. An intelligent spatial collision risk based on the quaternion ship domain［J］. Journal of Navigation, 2010, 63(4): 733-749.
［14］ DOYLE A B, JONES D I. A tangent based method for robot path planning［C］// 1994 IEEE International Conference on Robotics and Automation. IEEE: ［s. n.］,
1994: 1561-1566.
［15］王振华，章卫国，李广文，等.基于非均匀B-样条的G2路径平滑方法［J］.系统工程与电子技术，2011，33(7)：1539-1543.
WANG Zhenhua, ZHANG Weiguo, LI Guangwen, et al. G2 path smoothing using non-uniform B-spline［J］. Systems Engineering and Electronics, 2011,33 (7): 1539-1543.
［16］高博，徐德民，严卫生，等.一种航行器最优平滑路径的设计方法［J］.系统仿真学报，2009，21(23)：7536-7539.
GAO Bo, XU Demin, YAN Weisheng, et al. Method of designing optimal smooth way for vehicle［J］. Journal of System Simulation, 2009, 21(23): 7536-7539.
［17］盛振邦.船舶原理(下)［M］.上海：上海交通大学出版社，2011.
SHENG Zhenbang. Theory of Ship(Vol 2)［M］. Shanghai: Shanghai Jiaotong University Press, 2011.
［18］刘佳，柳成林，王艳杰.两船距离与转向避让难度关系量化研究［J］.重庆交通大学学报(自然科学版)，2015，34(4)：140-142.
LIU Jia, LIU Chenglin, WANG Yanjie. Quantitative relationship of the distance between ships and difficulty to avoid collision by altering course［J］. Journal of
Chongqing Jiaotong University(Natural Science), 2015, 34(4): 140-142.

[1]	李胜永1，张智华1，王胜男2，王孟2. 面向交通工具金属材料的缺损识别算法[J]. 重庆交通大学学报（自然科学版）, 2021, 40(07): 136-144.
[2]	张爱锋，刘少康，姚苗苗，甄春博. 船桥碰撞结构损伤及船撞力影响因素分析[J]. 重庆交通大学学报（自然科学版）, 2021, 40(03): 121-127.
[3]	谢新连，刘超，魏照坤. 海洋气象环境影响下的复杂水域船舶路径规划[J]. 重庆交通大学学报（自然科学版）, 2021, 40(02): 1-7.
[4]	赵月林，门茂峰，孙壮. 基于分段式双幂次趋近律的迭代滑模航向控制[J]. 重庆交通大学学报（自然科学版）, 2021, 40(02): 136-142.
[5]	赵月林，马征，孙壮. 考虑舵机时滞的船舶航向控制系统研究[J]. 重庆交通大学学报（自然科学版）, 2020, 39(12): 124-129.
[6]	杨敬东1，黎扬武1，刘美山2,黄兵3. 60 m3铰接式对开泥驳铰链系统受力分析及优化设计[J]. 重庆交通大学学报（自然科学版）, 2020, 39(12): 130-134.
[7]	张杰1，2，邓羽1,2，彭中波1，石利勇1. 基于声子晶体的船机减振特性研究[J]. 重庆交通大学学报（自然科学版）, 2020, 39(09): 140-145.
[8]	郝刚1，2，金涛1. 基于CAN总线的船用动力锂电池控制系统设计[J]. 重庆交通大学学报（自然科学版）, 2020, 39(04): 123-128.
[9]	王贵槐1，钟诚2，初秀民2，张代勇2. 基于BLSTM-RNN的船舶轨迹修复方法[J]. 重庆交通大学学报（自然科学版）, 2019, 38(10): 7-12.
[10]	谢新连，刘毅，何傲. 海上施工水域船舶航线规划数学建模及求解[J]. 重庆交通大学学报（自然科学版）, 2019, 38(09): 7-12.
[11]	杨敬东，何瑞峰，刘文彬. 海巡163轮锚链绞车下支撑船体结构加强和强度计算[J]. 重庆交通大学学报（自然科学版）, 2019, 38(08): 111-116.
[12]	蒋效彬1，谭家万2，任鸿翔1，邱绍杨1. 基于虚拟现实技术的船用锚机交互仿真系统[J]. 重庆交通大学学报（自然科学版）, 2019, 38(06): 12-16.
[13]	邱绍杨1，谭家万2，任鸿翔1，蒋效彬1. 尾抛式救生艇两种释放过程的建模与分析[J]. 重庆交通大学学报（自然科学版）, 2019, 38(06): 115-121.
[14]	廉静静1，杨晓1，尹勇2. 基于数值分析的船舶斜航运动水动力研究[J]. 重庆交通大学学报（自然科学版）, 2018, 37(07): 113-117.
[15]	杨敬东，刘永臻，雷林. 基于SHIPFLOW内河船阻力预报研究[J]. 重庆交通大学学报（自然科学版）, 2018, 37(07): 118-122.

复杂水域船舶避碰路径规划研究

Collision Avoidance Path Planning of Ships in Complicated Water Areas

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics