Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Electronics Optics & Control》 2008-11
Add to Favorite Get Latest Update

Research on initial trajectories of attack aircraft based on Dijkstra algorithm

CAI Kai1,GUAN Ming-lu2,ZHANG Tian-ming1,SUN Guo-zhi1(1.Engineering Institute,Air Force Engineering University,Xi'an 710038,China;2.Missile Institute,Air Force Engineering University,Sanyuan 713800,China)  
In order to ensure the safety of attack aircraft in low altitude penetration,the initial trajectories of the attack aircraft is studied to improve its integrated combat capacities under the modern warfare conditions.Dijkstra algorithm is used for finding the shortest-path in the graph theory,which has the advantages of rapid analysis speed and easly engineering implementation.In order to reduce the calculation of irrespective nodes and improve the effectiveness of shortest-path search and planning,we used the A* algorithm,an improved Dijkstra algorithm,to transform the issue of initial route planning of attack aircraft into the shortest-path finding problem in the directed graph.The threat modeling technology in complicated circumstance is studied,the system efficiency of each threat model is determined,the factor of dangerous level is set.The simulated program flow chart and program code of the initial trajectories is designed.Simulation of concrete situations proved the effectiveness and practicability of this algorithm,which meets the requirements of optimal initial trajectories needed in actual warfare.
【Fund】: 总装预研重点基金项目(6140529)
【CateGory Index】: V271.43
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved