反舰导弹航路规划快速搜索算法  

Fast Search Algorithm for Anti-ship Missile Route Planning

作　　者：陈玉文[1] 

机构地区：[1]西北工业大学,西安710072

出　　处：《系统仿真学报》2009年第20期6424-6428,6435,共6页Journal of System Simulation

摘　　要：反舰导弹航路规划是众多航路规划问题中最复杂的一种。目前大多数航路规划算法得出的航路与反舰导弹航路差别很大,难以应用。为此,针对反舰导弹航路特点提出一种快速搜索算法。该算法在航路规划问题空间的基础上引入任务空间的概念,通过在任务空间中快速搜索通行障碍的方法来最大程度的缩小搜索区域,最后通过动态节点规划的方法搜索到最优航路。仿真结果表明由该算法得到的参考航路能够满足反舰导弹快速、实时航路规划的需要,便于应用。Anti-ship missile route planning is one of the most complex problems on route planning. At present, the difference of between routes calculated by lots of route planning arithmetic and anti-ship missile route is too much, and it is difficult to apply in route planning domain. Therefore, a sort of rapid search arithmetic was put forward based on characteristic of anti-ship missile route planning, which introduces task space where the arithmetic searches quickly traffic obstacles on the base of route planning matter space, namely reduces right of way region to a great extent, finally this arithmetic searches the most excellent route by method of programming dynamic nodes. The result of emulator indicates reference route calculated by this arithmetic is capable of satisfying the needs of missile real time program and convenient for application.

关 键 词：反舰导弹 航路规划 任务空间 动态节点规划 

分 类 号：TJ765.2[兵器科学与技术—武器系统与运用工程]