| 基于航路二叉树的航线自动生成方法 |
| |
| 引用本文： | 汪柱, 李树军, 张立华, 李宁. 基于航路二叉树的航线自动生成方法[J]. 武汉大学学报 ( 信息科学版), 2010, 35(4): 407-410. |
| |
| 作者姓名： | 汪柱 李树军 张立华 李宁 |
| |
| 作者单位： | 1大连舰艇学院海测工程系,大连市中山区解放路667号116018;2海军出版社数字化三室,天津市塘沽上海道102号,300450;3大连海事大学航海技术研究所,大连市凌海路1号,116026;4中国科学院地理科学与资源研究所资源与环境信息系统国家重点实验室,北京市安外大屯路甲11号,100101 |
| |
| 基金项目： | 国家自然科学基金资助项目(40801189); 国家863计划资助项目(2009AA12Z202); 中国博士后科学基金资助项目(20080430547) |
| |
| 摘 要： | 针对航线自动生成中存在贪婪性的弱点,提出了基于航路二叉树的航线自动生成算法。实验结果表明,所提方法能克服现有航线自动生成算法中的贪婪性,提高航线最优化结果的质量。
|
| 关 键 词： | 航路二叉树 航线自动生成 碍航区 |
| 收稿时间： | 2009-12-28 |
| 修稿时间： | 2013-07-09 |
A Method for Automatic Routing Based on Route Binary Tree |
| |
| WANG Zhu, LI Shujun, ZHANG Lihua, LI Ning. A Method for Automatic Routing Based on Route Binary Tree[J]. Geomatics and Information Science of Wuhan University, 2010, 35(4): 407-410. |
| |
| Authors: | WANG Zhu LI Shujun ZHANG Lihua LI Ning |
| |
| Affiliation: | 1Department of Hydrography and Cartography,Dalian Naval Academy,667 Jiefang Road,Dalian 116018,China;2Institute of Nautical Science and Technology,Navigation College,Dalian Maritime University,1 Linghai Road,Dalian 116026,China;3State Key Laboratory of Resource and Environmental Information System,Institute of Geography Science and Resource Research,CAS,A11 Datun Road,Beijing 100101,China;4No.3 Digital Cartography Office,Navy Press,102 Shanghai Road,Tianjing 300450,China |
| |
| Abstract: | The high-quality routing on an electronic navigational chart is significant to safe,economical navigation for ships.Aiming to greedy weakness existing in automatic routing methods,this paper proposes an automatic algorithm for routing of ships based on route binary tree.Based on the definition and construction of route binary tree,the algorithm utilizes Store in Section to store the information of route binary tree,decomposes the information through The Depth Priority combined with Sounding out Searching,an... |
| |
| Keywords: | route binary tree automatic routing obstacle area |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《武汉大学学报(信息科学版)》浏览原始摘要信息 |
|
点击此处可从《武汉大学学报(信息科学版)》下载全文 |
|
