自由飞行中冲突解脱的线性规划法

Conflict resolution in free flight with linear programming

为了避免可能的冲突 ,任何两架飞行器之间的距离不能小于给定的安全距离 ,采用线性规划的方法研究了同一空间中自由飞行的几架飞机之间的冲突解脱问题。提出了两种不同的解脱方案 :第一 ,只允许速度变化 ;第二 ,只允许航向角变化。考虑到旅客在旅途中的舒适程度 ,选取的目标函数要使上述改变量最小。针对两种方案分别列出了线性限制公式 ,从而找出最优的解脱办法 ,实例验证了该方法的可行性。

Aircrafts can not get closer to each other than a given safety distance in order to avoid their conflicts. Two different schemes were designed: the one only change flying velocity; the other only change flying angle. For passengers' comfort, the changes should be minimized. The linear formula respectly for the two kinds of schemes were deduced to find out the optimum resolution methods,an example shows that this method is feasible.7 figs, 8 refs.