飞行试验航路规划方法研究与实现

光电系统挂飞试验对飞行航路有较高要求，一条能够满足试验各项约束的航路是试验按计划完成的前提。针对该问题，提出了一种基于可见性图的航路搜索空间构造方法；使用Dijkstra算法计算顺序两目标点间的折线路径；使用遗传算法计算代价最小的目标观测顺序；在得到的折线路径上计算得到满足最小转弯半径约束的航路。计算结果表明，这种航路算法能够有效规划出满足挂飞试验多约束条件的航路。

Research and implementation of route planning method for flying test

The flying test of an opto-electronic module has high demand to the aircraft route, and a route that satisfies the con- straints of the test is the precondition to fulfill the objective of the test. According to this question, a search space construction method based on visibility graph is used here; the shortest polylines path between two targets is got by the Dijkstra algorithm; the GA algorithm is used to get an optimized order of targets; then the final route is got from the polylines path and minimum turning radius is satisfied. The result shows that this route computing method can be well used to get an aircraft route which sat- isfies the constraints of the opto-electronic module test.