检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张立华[1,2] 苏奋振[2] 彭认灿[1] 暴景阳[1] 张莉[3]
机构地区:[1]海军大连舰艇学院海洋测绘科学与工程系,辽宁大连116018 [2]中国科学院地理科学与资源研究所资源与环境信息系统国家重点实验室,北京100101 [3]大连海事大学航海学院,辽宁大连116026
出 处:《测绘学报》2010年第5期516-521,共6页Acta Geodaetica et Cartographica Sinica
基 金:国家863计划(2009AA12Z202);国家自然科学基金(40801189;40801158);中国博士后科学基金(20080430547)
摘 要:提出一种基于瞬时水深模型的最短时间航线自动生成算法。基于海图静态水深和海域潮位模型,构建瞬时水深模型,动态提取碍航区,并进行航线可行性分析;利用动态规划思想,进行最短时间路径搜索;采用矩形包络分析、相近节点搜索和冗余点删除等策略,进行航线优化。实验表明:本算法能动态分析航线可行性,搜索最短时间航线。与传统算法相比,所提算法可提取航行时间更短的航线,所提取的最短时间航线,与舰船航行的起始时间和舰船航速相关。A method for the shortest time routing based on an instantaneous depth model is proposed.Firstly,an instantaneous model is constructed based on static depths in a chart and a tidal model in a sea area,then obstacles are acquired and the navigability of a route is analyzed.Secondly,the shortest time path is searched using a dynamic programming method.Finally,the path is optimized by the strategies including excluding obstacles outside the rectangle border of all nodes,searching close nodes in next stage and deleting redundant nodes for a more direct navigation.Experimental results demonstrate:① the proposed method can analyze the navigability of the routes dynamically and acquire the shortest time route;② the route acquired by the proposed method has the shortest time than that by the traditional methods;③ the shortest route depends on the start time of navigation and the ship speed.
分 类 号:P208[天文地球—地图制图学与地理信息工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.69