CAJ | 학술논문

光电系统挂飞试验对飞行航路有较高要求，一条能够满足试验各项约束的航路是试验按计划完成的前提。针对该问题，提出了一种基于可见性图的航路搜索空间构造方法；使用Dijkstra算法计算顺序两目标点间的折线路径；使用遗传算法计算代价最小的目标观测顺序；在得到的折线路径上计算得到满足最小转弯半径约束的航路。计算结果表明，这种航路算法能够有效规划出满足挂飞试验多约束条件的航路。
광전계통괘비시험대비행항로유교고요구，일조능구만족시험각항약속적항로시시험안계화완성적전제。침대해문제，제출료일충기우가견성도적항로수색공간구조방법；사용Dijkstra산법계산순서량목표점간적절선로경；사용유전산법계산대개최소적목표관측순서；재득도적절선로경상계산득도만족최소전만반경약속적항로。계산결과표명，저충항로산법능구유효규화출만족괘비시험다약속조건적항로。
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.