检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘朝 黄立文[1] 张可 郝国柱 LIU Zhao;HUANG Liwen;ZHANG Ke;HAO Guozhu(School of Navigation, Wuhan University of Technology, Wuhan 430063, China)
出 处:《武汉理工大学学报(交通科学与工程版)》2021年第5期1000-1004,共5页Journal of Wuhan University of Technology(Transportation Science & Engineering)
基 金:国家重点研发计划重点项目(20201g0047)。
摘 要:针对多船会遇局面船舶的避碰决策问题,综合考虑避碰规则和船舶避碰操作,提出了一种基于天牛须搜索的避碰决策算法.通过船舶间距离、船速比、他船与本船之间方位角、最近会遇距离,以及最近会遇时间,确定船舶碰撞危险度的计算方案.在综合考虑船舶碰撞危险度和避碰过程中的航程损失的条件下,建立了船舶避碰决策目标函数.利用天牛须搜索算法的全局搜索能力强、收敛速度快的特点,获得了多船会遇下最优避碰转向幅度及复航时间.仿真结果表明:天牛须搜索算法在求解多船避碰决策问题上是可行有效的,能够为船舶驾驶员提供决策参考,降低航行的风险.Aiming at the decision-making problem of collision avoidance of ships in the situation of multiple ships meeting,a collision avoidance decision-making algorithm based on the search of Beetle Antennae was proposed by considering collision avoidance rules and ship collision avoidance operations.According to the distance between ships,the speed ratio of ships,the azimuth angle between other ships and this ship,the nearest encounter distance and the nearest encounter time,the calculation scheme of ship collision risk was determined.The objective function of ship collision avoidance decision was established under the condition of comprehensive consideration of ship collision risk and voyage loss during collision avoidance.Using the characteristics of strong global search ability and fast convergence speed of the longicorn whisker search algorithm,the optimal collision avoidance steering range and return time were obtained when multiple ships met.The simulation results show that the search algorithm of Beetle Antennae is feasible and effective in solving the decision-making problem of multi-ship collision avoidance,which can provide decision-making reference for ship pilots and reduce the risk of navigation.
分 类 号:U675.96[交通运输工程—船舶及航道工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7