首页> 外文会议>Operations Research and its Applications >Study on Winning Probabilities of Two-versus-Two Stochastic Duel with Searching
【24h】

Study on Winning Probabilities of Two-versus-Two Stochastic Duel with Searching

机译:搜索法研究二对二随机决斗的获胜概率

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

摘要

The stochastic duel theory comes from applying stochastic process to Lancbester equation. The stochastic duel with searching is a kind of duel, not less than one of whose two contestants are stealthily. When on the assumption that the time intervals of two contestants is the same negative exponential distribution(NED), the stochastic duel is a Markov process which is continuous in time and discrete in states. The winning probability formulas of two-versus-two stochastic duel with searching are deduced using state transfer figure and the property of Laplace transformation.Finally the simulations and calculations are done in a true combat environment. The results of the winning probabilities formulas are exact probabilistic solutions, which can be used to quantificationally evaluate operation efficiency of more realistic small-to-moderate-size firefight models.
机译:随机对决理论源于将随机过程应用于Lancbester方程。带有搜索的随机决斗是一种决斗,不少于两个竞猜者之一。当假设两个参赛者的时间间隔是相同的负指数分布(NED)时,随机对决是时间连续且状态离散的马尔可夫过程。利用状态转移图和拉普拉斯变换的性质,推导了带有搜索的二对二随机对决的获胜概率公式。最后,在真实的战斗环境中进行了仿真和计算。获胜概率公式的结果是精确的概率解,可用于量化评估更现实的中小型消防模型的运行效率。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号