基于拓扑图的多船会遇场景辨识与分类方法  

Recognition and classification method in multi-ship encounter scenarios based on topological graph

作　　者：刘克中[1,2,3] 孔伟 俞月蓉 王伟强 袁志涛[1,2] 吴晓烈 LIU Ke-zhong;KONG Wei;YU Yue-rong;WANG Wei-qiang;YUAN Zhi-tao;WU Xiao-lie(School of Navigation,Wuhan University of Technology,Wuhan 430063,Hubei,China;Hubei Key Laboratory of Inland Shipping Technology,Wuhan University of Technology,Wuhan 430063,Hubei,China;State Key Laboratory of Maritime Technology and Safety,Wuhan University of Technology,Wuhan 430063,Hubei,China)

机构地区：[1]武汉理工大学航运学院,湖北武汉430063 [2]武汉理工大学内河航运技术湖北省重点实验室,湖北武汉430063 [3]武汉理工大学水路交通控制全国重点实验室,湖北武汉430063

出　　处：《交通运输工程学报》2024年第5期348-361,共14页Journal of Traffic and Transportation Engineering

基　　金：国家自然科学基金项目(52031009)。

摘　　要：针对复杂通航水域多船会遇场景表征模型缺乏、船间干扰关系难以辨析等问题,提出了一种基于拓扑图的多船会遇场景辨识和分类方法;考虑船舶随时空动态变化特性,对船舶自动识别系统数据进行时间切片划分,获得了可供研究的距离数据;基于船间哈文森距离引入“查找-验证-调整”聚类算法组成拓扑图时间序列,并自动生成多船会遇场景代表拓扑图;通过SimGNN模型计算了不同会遇场景代表拓扑图相似性,实现了多船会遇场景相似性度量,使用K近邻分类器完成多船会遇场景分类,分析了不同拓扑图数量和不同船舶类型的会遇过程;使用宁波—舟山水域某一天(24 h)真实数据进行试验分析。研究结果表明:通过提出的多船会遇场景辨识算法,精准识别出水域内794个有效多船会遇场景,其中2船会遇场景占比最高,3船会遇场景次之,4船及其以上会遇场景相对较少,该结果和船舶交通管理人员认知一致;多数场景持续时长维持在1000 s内,生成拓扑图数量保持在100内,数据分布趋势较为近似;同一会遇场景内船舶数量波动较小,验证了所提出辨识算法的稳定性;使用了分类算法后,处于同分类的不同持续时长的场景间船舶类型和代表拓扑图具有明显相似性,不同分类间的场景在变化过程、持续时长、船舶类型和代表拓扑图上具有显著差别。Aiming at the problems such as the lack of characterization models,and the challenge of distinguishing between ship interactions for multi-ship encounter scenarios in complex navigable waters,a recognition and classification method was proposed based on topological graph for multi-ship encounter scenarios.Considering the dynamic characteristics of ships in time and space,automatic identification system data was divided by time slices to obtain distance data suitable for research.Based on inter-ship Haversine distances,the find-verify-and-fix clustering algorithm was applied to construct time series of topological graphs,and the representative topological graphs were automatically generated in multi-ship encounter scenarios.The similarity between different representative topological graphs for different encounter scenarios was calculated by SimGNN model,and the similarity measurement of multi-ship encounter scenarios was realized.A K-nearest neighbors classifier was employed for multi-ship encounter scenario classification,and the encounter processes of different topological graph number and various ship types were analyzed.Experimental analysis was conducted using real data from a specific day(24 hours)in Ningbo-Zhoushan water area.Research results indicate that the proposed recognition algorithm for multi-ship encounter scenarios accurately identifies 794 valid multi-ship encounter scenarios in the water area,with two-ship encounter scenarios being the most common,followed by three-ship encounter scenarios,and relatively few occurrences of four-or-more-ship encounter scenarios.This result aligns with the perception of vessel traffic service personnel.Most scenarios have a duration of less than 1000 s,with the numbers of generated topological graphs remaining below 100,indicating a relatively similar trend in data distribution.In the same encounter scenario,there is little fluctuation in ship number,demonstrating the stability of the proposed recognition algorithm.After using the classification algorithm,there is

关 键 词：水路运输 多船会遇场景 FVF模型 SimGNN模型 AIS数据 拓扑图 

分 类 号：U698[交通运输工程—港口、海岸及近海工程]