期刊文献+

新混合智能计算法在UCAV航路规划中的应用 被引量:1

Application of a New Hybrid Intelligent Computation Method in Path Planning of UCAV
下载PDF
导出
摘要 无人作战飞机(UCAV)出航执行对地攻击(或侦察)任务,若事先针对敌方防御区内的威胁部署和目标的分布情况,就飞行航路进行整体规划设计,则可以综合减小被敌方发现和反击的可能性,最大限度地降低耗油量,从而显著提高其执行任务的成功率。在对进化算法研究的基础上,将用于解决旅行商问题(TSP)的进化算法加以改进,引入优秀个体保护法和模拟退火的策略思想,借以克服进化算法固有的易陷于局部最优的早熟现象,然后运用于UCAV的航路规划。实验结果表明,改进的混合智能计算方法简易而有效,寻优效果明显优于常规进化算法,规划出的航路能够满足UCAV飞行任务规划的综合需要。 While Unmanned Combating Air Vehicle (UCAV) carries out attack or reconnaissance tasks against ground targets, the off-line global path planning, based on threat deployment and target distribution in the defense areas of enemies, can minimize the possibility of being detected by enemies and also reduce the fuel consumption entirely. As a result, the success probability of mission can be expected to be greatly increased. On the basis of analysis on Evolutionary Algorithm (EA), a new EA for solving this problem is presented in this paper, in which both the strategies of elitism and simulated annealing are introduced in order to keep balance between speed-up of convergence and avoiding of premature of EA. The modified method is applied to UCAV path planning. The experimental results demonstrate that this hybrid computational intelligence method, which is simple and effective, and superior to that of traditional EAs. The planned path can meet the demands of UCAV flight mission planning.
出处 《火力与指挥控制》 CSCD 北大核心 2008年第9期6-10,共5页 Fire Control & Command Control
基金 航空科学基金资助项目(051001002)
关键词 无人作战飞机(UCAV) 航路规划 进化算法(EA) 模拟退火(SA) 混合智能计算 Unmanned Combating Air Vehicle (UCAV) path planning Evolutionary Algorithm (EA) Simulated Annealing (SA), hybrid intelligent computationP
  • 相关文献

参考文献11

  • 1左益宏,柳长安,李挺.基于目标分配的无人机航路规划[J].飞行力学,2005,23(1):93-96. 被引量:9
  • 2白俊强,柳长安.基于蚁群算法的无人机航路规划[J].飞行力学,2005,23(2):35-38. 被引量:27
  • 3潘亮,朱华勇,沈林成,常文森.引入优化算子的无人机遗传航路规划算法研究[J].国防科技大学学报,2003,25(6):95-100. 被引量:6
  • 4Tsai H K, Yang J M, Tsai Y F, et al. An Evolutionary Algorithm for Large Traveling Salesman Problems[J]. IEEE Transactions on Systems, Man and Cybernetics-Part B : Cybernetics, 2004,34(4) : 1718-1729.
  • 5Cai Z H, Peng J G, Gao W, et al. A Novel Evolutionary Algorithm and Its Application for the Traveling Salesman Problem[A].// IEEE Service Center, Proceedings of the 5th World Congress on Intelligent Control and Automation[C]. Hangzhou IEEE Press, 2004,3 : 2253-2257.
  • 6Kirkpatrick S, Gelatt Jr C D, Vecchi M P. Optimization by Simulated Annealing[J]. Science,1983,220(4596):671-680.
  • 7Timothy W M,Randal W B. Trajectory Planning for Coordinated Rendezvous of Unmanned Air Vehicles [R]. AIAA 2000-4339-CP ,2000.
  • 8Yang J J,Zhou J Z,Yu J,et al. A Hybrid Intelligent Messy Genetic Algorithm for Daily Generation Scheduling in Power System [A].// IEEE Service Center, Proceedings of 2004 International Conference on Machine Learning and Cybernetics[C]. Shanghai :IEEE Press, 2004,4 : 2217-2222.
  • 9Liu Z M,Zhou J L, Lai S. New Adaptive Genetic Algorithm Based on Ranking [A].// IEEE Service Center, Proceedings of 2003 International Conference on Machine Learning and Cybernetics [C]. Xian : IEEE Press, 2003,3 : 1841-1844.
  • 10Eckart Z, Lothar T. Multiobjective Evolutionary Algorithms: A Comparative Case Study and the Strength Pareto Approach [J]. IEEE Transactions on Evolutionary Computation, 1999,3 (4) : 257-271.

二级参考文献26

  • 1左益宏,柳长安,罗昌行,何红丽.多无人机监控航路规划[J].飞行力学,2004,22(3):31-34. 被引量:7
  • 2邱晓红,张林昌,高金源.战术飞行任务的水平航迹快速生成算法[J].北京航空航天大学学报,1996,22(6):775-779. 被引量:10
  • 3刘勇 康立山 等.非数值并行算法(第二册)--遗传算法[M].北京:科学出版社,1997..
  • 4VARELA G N, SINCLAIR M C. Ant colony optimization for virtual--wavelength --path routing and wavelength allocation[A]. Proceedings of the 1999 Congress on Evolutionary Computation [C]. Washington DC: IEEE, 1999. 1809--1816.
  • 5BAUER A, BULLNHEIMER B, HARTL R F, STRAUSSC. An ant colony optimization approach for the single machine total tardiness problem[A]. Proceedings of the 1999 Congresson Evolutionary Computation [C]. Washington DC: IEEE,1999. 1445-- 1450.
  • 6KRIEGER MICHAEL J B, et al. Ant--like task allocation and recruitment in cooperative robots[J]. Nature, 2000,406:39--42.
  • 7HOOGEVEEN J A, LENSTRA J K, VELTMAN B. Preemptive scheduling in a two--stage multiprocessor flow shop is NP--hard[J]. European Journal of Operational Research, 1996,89(1): 172--175.
  • 8DUDEK R A, et al. The lessons of flowshop scheduling research[J]. Operations Research, 1992, 40(1):7--13.
  • 9LINN R, ZHANG Wei, Hybrid flowshop seheduling:a survey[J]. Computers & Industrial Engineering, 1999,37(1-- 2) : 57--61.
  • 10CAMAZINE S, et al. Self--organization in biological systems[M]. Princeton USA: Princeton University Press, 2001.

共引文献86

同被引文献8

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部