攻守空戰遊戲中防空站的部署優化模擬

Abstract

本論文建立一個攻守空戰遊戲，目標為最大化防守方保護目標區域的能力。攻擊方由多個攻擊站組成，攻擊站呈斜直線或鉗型隊形，每一個攻擊站可以發射多個攻擊機襲擊防守方。防守方由一個主要指揮所、兩個次要指揮所和多個防空站所組成，每一個防空站配備多個攔截機以對抗接近的攻擊機。本論文設定四種防守策略供選擇以指導防空站的部署，據以使用粒子群演算法獲得所有防空站的最佳部署，再將此最佳部署用於執行多次遊戲模擬，最後得到的結果以統計法進行分析。此外並檢視一些有趣的特別案例，以增加對此遊戲特性的了解。

An attack–defense aerial war game is developed to maximize the capability of defense forces in protecting a target area from an attack force. The attack force is composed of multiple attack stations in slant or pincer formation, and each attack station can launch multiple attackers against the defense force. The defense force is composed of one major post, two minor posts, and multiple defense stations, and each defense station is equipped with multiple interceptors against the approaching attackers. Four optional defense goals are proposed to guide the deployment of defense stations. A particle swarm optimization (PSO) algorithm is applied to acquire an optimal deployment plan of all the defense stations, under a specific defense goal. Multiple games are played with the optimal deployment plan, and the results are analyzed statistically. Interesting outlier cases are also inspected to gain more insights on the nature of the games.