軍用飛行載具路線規劃：考慮路徑風險與轉折成本

Abstract

軍用載具的路線規劃相關的問題研究已經行之有年，言簡意賅地來說，此問題目的是要協助規劃一條路徑，使該軍用載具在一個三維的戰鬥空間中，能依照該路徑從起點飛行至終點，以完成相關任務或其他軍事目的。除了能讓該載具能在有油量限制的情況下，以最安全及最舒適的方式到達終點，本研究加以考慮了「轉彎」的成本，空中載具在進行轉彎動作時，除了會增加油量消耗，更重要的是，會對駕駛者產生巨大的不舒服感。本研究首先建構了此問題的整數規劃模型，並提出了一個新的兩階段啟發式演算法來最小化路徑風險與轉折成本的加權總和。接著，本研究提出了相關的數值實驗結果，結果顯示使用該演算法算產生之路徑的效益在多數情境下接近最佳解，同時保持良好的效率。最後，本研究提供了數個模擬的個案研究來實際使用該啟發式演算法，以便更具體地顯示本研究提出之啟發式演算法的效用。

Route planning for military aircrafts has been studied for years. Briefly, the purpose of this problem is to plan a route with certain velocity to avoid the risk caused by enemy’s defensive facilities in an unrestricted three-dimensional space, given a take-off place and a target destination. In this study, we also focus on another specific condition which is “the number of turns the route has”. When the air vehicle makes a turn, this turning action not only consumes more fuel, but brings lots of discomforts to the driver. We first formulate the problem with specific conditions so as to suit our case. To enable the vehicle to reach its destination in the safest and the most comfortable way with limited fuel. This study proposes a two-phase heuristic algorithm to minimize the weighted sum of risk and the number of turns of a route. Then, we conduct the numerical experiments to examine the effectiveness and efficiency of the algorithm. Routes generated by out heuristic algorithm from experiments are approximately optimal with excellent efficiency in most cases. Also, we present several case studies to demonstrate the result of route planning more specifically.