战术飞行路径规划算法  

Planning algorithm of tactics flight path

作　　者：张永芳[1] 张安[1] 张志禹[2] 张九龙[3] 

机构地区：[1]西北工业大学电子信息学院,陕西西安710072 [2]西安理工大学自动化与信息工程学院,陕西西安710048 [3]西安理工大学计算机科学与工程学院,陕西西安710048

出　　处：《交通运输工程学报》2006年第4期84-87,共4页Journal of Traffic and Transportation Engineering

基　　金：航空基础科学基金项目(05D53021)

摘　　要：为了找出在某些约束条件下的最优飞行路径,提出了一种基于Voronoi图的战术飞行路径规划算法,建立了威胁代价函数,采用分解策略,首先生成一条由若干直线段连接的参考航路,然后利用B样条函数对规划的参考航路进行动态修正,用Matlab进行了仿真验证。仿真结果表明了路径规则算法是有效的,修正后的路径避免了带有尖角的不可飞路径,满足最小飞行半径与动力约束。In order to find optimal flight path with certain constraints, a trajectory planning algorithm of tactics flight path based on Voronoi diagram was presented, the function of threat cost was.formulated, reference flight path consisting of a series of beeline segments was generated by decomposition strategy, and real-time planning flight path was optimized by B spline, its simulation test was done by Matlab. Simulation result shows that the algorithm is feasible, the optimal flight path satisfies flight dynamic constraints and minimal flight radius, avoids unfeasible flight routine with sharp angles. 5 figs, 10 refs.

关 键 词：交通规划 路径规划 航路修正 VORONOI图 

分 类 号：V249.1[航空宇航科学与技术—飞行器设计]