攔截飛彈的發射時間窗口決定

Abstract

本論文探討攔截飛彈的發射時間窗口(Launch Time Window)該如何適當選擇，如何描述飛彈及目標的位置與速度函數，以及分析攔截成功的必要條件並建立最佳化問題，透過發展處罰函數(PF)演算法及連續二次規劃(SQP)演算法，來求出發射前等待的延遲時間最大值及最小值，即發射時間窗口。最後提供三種不同來襲目標來驗證所求出的發射時間窗口是否符合實際攔截情形。透過模擬的數值結果顯示針對不同目標所求出的發射時間窗口均有不錯的準確度且亦相當符合實際攔截情形。

When an attacking missile is detected, the missile defense system must decide when to launch the missile interceptor. The choice of a proper launch time is important because given the physical constraints on the interceptor, a poor choice of launch time alone may cause the interception to fail. This thesis discusses the determination of launch time window for a missile interceptor, which is formulated as constrained optimization problems.

The earliest and the latest allowable launch times are determined by numerically solve the corresponding minimization and maximization problems. Three incoming threats are considered. Numerical results show good agreement with results obtained via six degree of freedom simulations employing midcourse guidance.