...
首页> 外文期刊>Military operations research >Optimally Randomized Patrolling of Chokepoints for Theatre Antisubmarine Warfare
【24h】

Optimally Randomized Patrolling of Chokepoints for Theatre Antisubmarine Warfare

机译:战区反潜战各支点的最优随机巡逻

获取原文
获取原文并翻译 | 示例
           

摘要

Patrols at chokepoints can intercept a submarine or deter it onto a more time-consuming route to its objective. We find the optimally randomized allocation of resources to chokepoints when the patrols are imperfect, antisubmarine operations can be observed, but randomization of antisubmarine deployments will succeed. The problem is modeled as a nonzero-sum two-player network interdiction game and the allocation is obtained from the Strong Stackelberg equilibrium.
机译:在关键点巡逻可以拦截潜艇,或者将其阻止到花费更多时间到达目标的路线上。我们发现,当巡逻不完善,可以观察到反潜作战时,可以将资源最佳地随机分配到关键点,但是反潜部署的随机化将会成功。该问题被建模为一个非零和两人网络拦截游戏,并从Strong Stackelberg平衡中获得分配。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号