限制搜索区域的航线设计两级规划算法  

Two-Stage Algorithm for Ship Route Planning with Limited Searching Area

作　　者：汤青慧[1] 唐旭[2] 

机构地区：[1]青岛理工大学管理学院,山东青岛266520 [2]武汉大学资源与环境科学学院,武汉430079

出　　处：《中国航海》2015年第2期92-95,共4页Navigation of China

基　　金：青岛市科技计划基础研究项目(13-1-4-218-jch)

摘　　要：受天气和海况预报时效限制,在航船舶通常需根据最新的气象预报信息对计划航线进行动态修正,以保证安全经济航行。对此,基于海域环境模型构建矩形限制搜索区域,对潜在碍航物进行提取,以有效减小航线搜索规模。引入直线正负划分性函数对传统Z3-2算法加以改进,快速求解碍航区多边形凸壳,通过凸壳和公切线构造局部最短航线。试验结果表明:算法具有较高的搜索效率,能够满足在线规划的实时性要求;同时,该算法能够处理各种复杂海域,具有稳定性好、求解规模大的特点。Because of the limitation of weather and sea condition forecasts, the navigating ships usually make dynamic route correction to ensure the safety and economy according to the latest weather information. For this purpose, an algorithm is proposed based on the marine environmental model, which extracts potential obstacles within a limited rectangular area to reduce the searching scale effectively. A linear positive and negative partition function is applied to Z3_2 algorithm to solve the convex hull of obstacle polygon and determine the local shortest route according to the convex hull and the tangent line to it. Experiments show that the algorithm is efficient and stable, which can be applied to all kinds of complicated and large - scale planning area and meet the requirement of real - time online planning.

关 键 词：水路运输 动态规划 限制搜索区域 凸壳 切线图 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构] U692.31[自动化与计算机技术—计算机科学与技术]