电子海图最短距离航线自动生成的改进方法  

An Improved Method for Automatically Building Shortest Route Based on Electronic Chart

作　　者：曹鸿博 张立华[1] 贾帅东[1] 张莉[2] 

机构地区：[1]大连舰艇学院海洋测绘科学与工程系,大连市解放路667号116018 [2]大连海事大学航海学院,大连市凌海路1号116026

出　　处：《武汉大学学报（信息科学版）》2011年第9期1107-1110,共4页Geomatics and Information Science of Wuhan University

基　　金：国家863计划资助项目(2009AA12Z202);国家自然科学基金资助项目(40801189)

摘　　要：针对航路二叉树方法绕行碍航区处理不完备、效率低等缺点,提出了最短距离航线自动生成的改进方法。通过复杂碍航区路径的递归搜索和碍航区绕行规则的优化,实现了复杂情形下的航线自动生成;利用方向一致性判断、边界检测和动态包络矩形排斥等策略优化航线生成,并采用递归处理和动态判断的方式求解最短距离航线。此方法与已有的航路二叉树方法相比,在自动生成航线的质量和效率上都有明显提高。Aiming at existing shortcomings including faultiness of rounding the obstacles and low-efficiency in the shortest routing based on binary tree,an improved method is proposed for building the shortest route automatically based on electronic navigation chart.Route is built automatically in complex cases with recursively search complex obstacle areas and optimizing collision avoidance rules,and is optimized by means of direction consistency check,boundary detection and dynamic envelope rectangle exclusion.The shortest route is obtained by strategy of recursive processing and dynamic estimation.Experimental results demonstrate that the proposed method has considerable advantages over the binary tree one in quality and efficiency of routing automatically.

关 键 词：碍航区 递归搜索 方向一致 边界检测 动态包络矩形 动态判断 

分 类 号：P208[天文地球—地图制图学与地理信息工程]