| 通过水雷障碍群的最短路径寻径问题研究 |
| |
| 引用本文： | 龙鹏,林平,张年春.通过水雷障碍群的最短路径寻径问题研究[J].舰船电子工程,2011,31(7):73-75,108. |
| |
| 作者姓名： | 龙鹏 林平 张年春 |
| |
| 作者单位： | 海军兵种指挥学院 广州 510430 |
| |
| 摘 要： | 由最短路径的Dijkstra算法、Floyd算法和A^＊自启发算法出发，结合水雷障碍群的现实情况，提出了两种适合采用现有最短路径寻径算法解算得到快速安全通过水雷障碍群的最短路径的量化建模方法。在此基础上，该文还对其中一种量化模型的快速通过水雷障碍群最短路径的改良寻径算法进行了探讨和结果演示。
|
| 关 键 词： | 水雷障碍群 量化建模 最短路径寻径改良算法 |
Research on Finding Shortest Path in Mine Handicap Group |
| |
| Long Peng,Lin Ping,Zhang Nianchun.Research on Finding Shortest Path in Mine Handicap Group[J].Ship Electronic Engineering,2011,31(7):73-75,108. |
| |
| Authors: | Long Peng Lin Ping Zhang Nianchun |
| |
| Institution: | Long Peng Lin Ping Zhang Nianchun(Naval Arms Command Academy,Guangzhou 510430) |
| |
| Abstract: | From the shortest path arithmetic of Diikstra,Floyd and A^＊, we bring forward two quantitative model method which combined with the real scene fit to calculate to pass through the mine handicap group quickly and safely by the shortest path. Above the base this article has not only discussed how to improve the existent shortest path arithmetic but also demoed the outcome. |
| |
| Keywords: | mine handicap group quantitative model improved shortest path arithmetic |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
