期刊文献+

复杂水域船舶避碰路径规划研究 被引量:6

Collision Avoidance Path Planning of Ships in Complicated Water Areas
下载PDF
导出
摘要 针对目标船和碍航障碍区同时存在的复杂水域船舶避碰问题,在考虑《国际海上避碰规则》的前提下,结合避让目标船舶的预测危险区(PAD)理论、借鉴船舶领域相关成果进行的缓冲区分析以及切线图法对复杂水域进行环境建模,再用Dijkstra算法求得一条避开所有碍航区的初始路径;并利用船舶回转直径,基于改进的2-turn方法对初始路径进行平滑处理,给出了避碰转弯角度和复航角度,其不仅能够平滑路径还能检验原路径的有效性;最后进行了仿真实验,验证了该方法的正确性与适用性;再与Maklink图结合Dijkstra和蚁群算法的路径规划方法进行对比分析,结果表明该方法在时间性能、路径整体的平滑性、路径优化程度等方面更具优势。 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.
作者 谢新连 何平 何傲 辛剑英 XIE Xinlian;HE Ping;HE Ao;XIN Jianying(Integrated Transport Institute,Dalian Maritime University,Dalian 116026,Liaoning,P.R.China)
出处 《重庆交通大学学报(自然科学版)》 CAS CSCD 北大核心 2019年第12期1-7,共7页 Journal of Chongqing Jiaotong University(Natural Science)
基金 中央高校基本科研业务费专项资金资助项目(3132016358) 国家重点研发计划资助项目(2017YFC0805309)
关键词 船舶工程 避碰路径规划 复杂水域 切线图法 DIJKSTRA算法 2-turn平滑 ship engineering collision avoidance path planning complicated water areas tangent graph method Dijkstra algorithm 2-turn smoothing
  • 相关文献

参考文献5

二级参考文献34

  • 1李源惠,潘明阳,吴娴.基于动态网格模型的航线自动生成算法[J].交通运输工程学报,2007,7(3):34-39. 被引量:24
  • 2Dijkstra E. A Note on Two Problems in Connexion with Graphs [J]. Numeriche Mathematics (S0029-599X), 1959, 1(1): 269-271.
  • 3Pearl J. Heuristics [M]. USA: Addison-Wesley, 1984: 33-73.
  • 4Stentz A. The Focussed D* Algorithm for Real-Time Replanning [C]// Proceedings International Joint Conference on Artificial Intelligence, Montreal, Canada: IJCAI, 1995: 1652-1659.
  • 5Ferguson D, Stentz A. Field D*: An Interpolation-based Path Planner and Replanner [C]// International symposium on Robotics Research, San Francisco, CA, USA: ISRR, 2005:1926-1931.
  • 6Ferguson D, Stentz A. The Field D* Algorithm for Improved Path Planning and Replanning in Uniform and Non-uniform Cost Environments [R]// Technical Report CMU-RI-TR-05-19. USA: Carnegie Mellon School of Computer Science, 2005.
  • 7McKeever, S. Path Planning for an Autonomous Vehicle. [D]. USA: Massachusetts Institute of Technology, 2000: 25-45.
  • 8Koenig S, Likhaehev M. Improved Fast Replanning for Robot Navigation in Unknown Terrain [C]// Proceeding of the 2002 IEEE international Conference on Robotics & Automation, Washington, DC, USA. USA: IEEE, 2002: 968-975.
  • 9Dubins L E. On curves of minimal length with a constraint on average curvature and with prescribed initial and terminal positions and tangents[J]. American Journal of Mathematics, 1957,79:497 - 516.
  • 10Anderson E P, Beard R W, McLain T W. Real time dynamic trajectory smoothing for unmanned air vehicles [J]. IEEE Trans. on Control Systems Technology, 2005,13 (3) : 471 - 477.

共引文献21

同被引文献44

引证文献6

二级引证文献15

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部