导弹与制导技术

基于多路径算法的选飞航迹规划方法研究

  • 张大巧 ,
  • 鲜勇 ,
  • 王明海 ,
  • 郑晓龙
展开
  • 第二炮兵工程学院,西安 710025

张大巧(1983-),男,福建泉州人,博士研究生,研究方向:导弹火力运用与航迹规划等。

收稿日期: 2010-10-15

  网络出版日期: 2025-05-30

The Research on Path Planning Method for Flexible Target Based on Multi-path Label Correcting Algorithm

  • ZHANG Daqiao ,
  • XIAN Yong ,
  • WANG Minghai ,
  • ZHENG Xiaolong
Expand
  • The Second Artillery Engineering College, Xi'an 710025, China

Received date: 2010-10-15

  Online published: 2025-05-30

摘要

针对支持数据链通信的巡航导弹因协同作战而预规划多条飞行航迹的特点,提出了基于多路径标号更正算法的选飞航迹规划方法。该算法在传统算法标号更正算法的基础上引入节点禁忌扩展策略,从而实现航迹的转弯控制和航迹间隔控制,保证了求取的路径满足导弹的飞行约束;通过在赋权图中引入数字地形高程信息和威胁信息,实现了该规划方法三维规划能力和威胁规避能力。给出了选飞航迹的规划步骤,通过仿真计算证明了该算法的有效性。

本文引用格式

张大巧 , 鲜勇 , 王明海 , 郑晓龙 . 基于多路径算法的选飞航迹规划方法研究[J]. 弹箭与制导学报, 2011 , 31(4) : 69 -72 . DOI: 10.15892/j.cnki.djzdxb.2011.04.020

Abstract

Based on the characteristic that remote control missile with supporting communication by satellite data chain has multi-selective path for cooperative combat, the path planning method for selective path based on k path label correcting algorithm (KPLCA) was put forward. The node expanding strategy was adopted in the KPLCA in order to control the turning angle and path space, so that the planning paths satisfied the restriction of missile. The KPLCA can obtain the 3D path by using the arc cost function with the information of terrain height and thread. The path planning step was presented, and the validity of KPLCA was proved by simulating calculation.

参考文献

[1]
钱进, 徐兴柱, 刘赵云. 巡航导弹航迹规划技术初探[J]. 飞航导弹, 2008(1): 16-18.
[2]
谌国森, 陈晓丽. 美军巡航导弹的现状及发展趋势[J]. 飞航导弹, 2006(2): 37-40.
[3]
张欧亚. 面向Agent的巡航导弹武器控制系统分析与设计[D]. 西安: 西北工业大学, 2007.
[4]
Robert N Athay. Loiter and optimal route planning for long rang subsonic cruise missile[D]. USA: University of Virginia, 2004.
[5]
任波, 周焘, 于雷. 基于改进A*算法的飞行器三维航迹规划算法[J]. 系统工程与电子技术, 2008, 30(2): 324-326.
[6]
Shibo Li, Xiuxia Sun. A real-time UAV route planning algorithm based on fuzzy logic techniques[C]// Proceedings of the 6th World Congress on Intelligent Control and Automation, June 21-23, 2006, China: 2006. 8750-8753.
[7]
Edward Minieka. 网络和图的最优化算法[M]. 李家滢, 赵关旗,译. 北京: 中国铁道出版社, 1984.
[8]
Lars Relund Nielsena, Kim Allan Andersenb, Daniele Pretolani. Finding the K shortest hyperpaths[J]. Computers & Operations Research, 2005, 32(6): 1477-1497.
[9]
张嵩, 王军, 马金平. 求解K最短路径的改进Dijkstra算法[J]. 中国经济与管理科学, 2009(4): 29-31.
[10]
林娜, 杨涛. MPLS流量工程K路径标号算法[J]. 小型微型计算机系统, 2009, 30(12): 2335-2338.
文章导航

/