Optimal Threshold Policy for Sequential Weapon Target Assignment

详细信息    查看全文

• 作者：Krishnamoorthy Kalyanam^* ; ^{krishnak@ucla.edu" class="auth_mail" title="E-mail the corresponding author} ; Sivakumar Rathinam^** ; ^{srathinam@tamu.edu" class="auth_mail" title="E-mail the corresponding author} ; David Casbeer^*** ; ^{david.casbeer@us.af.mil" class="auth_mail" title="E-mail the corresponding author} ; Meir Pachter^**** ; ^{meir.pachter@afit.edu" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Weapon-Target Assignment ; Dynamic Programming ; Threshold Policy
• 刊名：IFAC-PapersOnLine
• 出版年：2016
• 出版时间：2016
• 年：2016
• 卷：49
• 期：17
• 页码：7-10
• 全文大小：323 K

文摘

We investigate a variant of the classical Weapon Target Assignment (WTA) problem, wherein N targets are sequentially visited by a bomber carrying M homogenous weapons. We are interested in the optimal assignment of weapons to targets. A weapon launched by the bomber destroys the j^th target with probability p_j and upon successful elimination, the bomber earns a positive reward r_j. There is feedback in that the bomber, upon deploying a weapon, is notified whether or not it successfully destroyed the target. Whereupon, it decides whether to move on to the next target or allocate an additional weapon to the current target. We provide a tractable solution method for computing the optimal closed loop control policy that results in maximal expected total reward. Moreover, we show that a thresholding policy is optimal, wherein a weapon from an inventory of k weapons is dropped on the j^th target iff k exceeds a stage dependent threshold value, κ(j).