摘要
随着人类海洋活动的频繁、气候环境的复杂多变,海上事故频发,而海上救援最关键的是要在最短时间到达搜救点。海上搜索最短路径还受到障碍物、地理环境、天气等条件影响,是一个多条件全局最优问题。本文研究了基于蚁群算法的Dijkstra求解方法,寻找多条件约束下的海上搜救最短路径的全局最优解,最后对算法进行了仿真并与其他路径规划算法做了比较。
With the frequent activities of human beings in the sea,the complex climate and environment,and the frequent occurrence of maritime accidents,the most important thing for maritime rescue is to reach the maximum time.At the same time,the shortest path finding is also affected by obstacles,geographical environment,weather and other conditions,which is a multi condition global optimal problem.In this paper,Dijkstra algorithm based on ant colony algorithm is studied to find the global optimal solution of the shortest path of maritime search and rescue under multiple constraints.Finally,the algorithm is simulated and compared with other path planning algorithms.
作者
衣麟卓
YI Lin-zhuo(Navigation College,Dalian Maritime University,Dalian 116033,China)
出处
《舰船科学技术》
北大核心
2020年第16期34-36,共3页
Ship Science and Technology
关键词
蚁群算法
路径规划
人工智能
ant colony algorithm
path planning
artificial intelligence
作者简介
衣麟卓(1994-),男,硕士,主要从事海事搜救方面研究。
