共查询到20条相似文献，搜索用时 15 毫秒
1.
Michael J. Armstrong 《海军后勤学研究》2004,51(1):28-43
In the context of both discrete time salvo models and continuous time Lanchester models we examine the effect on naval combat of lethality: that is, the relative balance between the offensive and defensive attributes of the units involved. We define three distinct levels of lethality and describe the distinguishing features of combat for each level. We discuss the implications of these characteristics for naval decision‐makers; in particular, we show that the usefulness of the intuitive concept “more is better” varies greatly depending on the lethality level. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
2.
对导弹作战体系作战能力评估问题进行了建模与仿真研究。分析了导弹作战体系的基本构成,建立了基于指数法和兰彻斯特战斗方程的导弹作战体系作战能力评估模型;仿真分析了发现和预警概率、指挥控制系统作战能力对导弹作战体系作战能力的影响,得到了一些有价值的数值仿真结论。 相似文献
3.
Michael J. Armstrong 《海军后勤学研究》2007,54(1):66-77
This article considers two related questions of tactics in the context of the salvo model for naval missile combat. For a given set of targets, how many missiles should be fired to produce an effective attack? For a given available salvo size, how many enemy targets should be fired at? In the deterministic version of the model I derive a simple optimality relationship between the number of missiles to fire and the number of targets to engage. In the stochastic model I employ the expected loss inflicted and the probability of enemy elimination as the main performance measures and use these to derive salvo sizes that are in some sense “optimal.” I find that the offensive firepower needed for an effective attack depends not only on a target's total strength but also on the relative balance between its active defensive power and passive staying power. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
4.
5.
Firing multiple artillery rounds from the same location has two main benefits: a high rate of fire at the enemy and improved accuracy as the shooter's aim adjusts to previous rounds. However, firing repeatedly from the same location carries significant risk that the enemy will detect the artillery's location. Therefore, the shooter may periodically move locations to avoid counter‐battery fire. This maneuver is known as the shoot‐and‐scoot tactic. This article analyzes the shoot‐and‐scoot tactic for a time‐critical mission using Markov models. We compute optimal move policies and develop heuristics for more complex and realistic settings. Spending a reasonable amount of time firing multiple shots from the same location is often preferable to moving immediately after firing an initial salvo. Moving frequently reduces risk to the artillery, but also limits the artillery's ability to inflict damage on the enemy. 相似文献
6.
Lanchester equations and their extensions are widely used to calculate attrition in models of warfare. This paper examines how Lanchester models fit detailed daily data on the battles of Kursk and Ardennes. The data on Kursk, often called the greatest tank battle in history, was only recently made available. A new approach is used to find the optimal parameter values and gain an understanding of how well various parameter combinations explain the battles. It turns out that a variety of Lanchester models fit the data about as well. This explains why previous studies on Ardennes, using different minimization techniques and data formulations, have found disparate optimal fits. We also find that none of the basic Lanchester laws (i.e., square, linear, and logarithmic) fit the data particularly well or consistently perform better than the others. This means that it does not matter which of these laws you use, for with the right coefficients you will get about the same result. Furthermore, no constant attrition coefficient Lanchester law fits very well. The failure to find a good‐fitting Lanchester model suggests that it may be beneficial to look for new ways to model highly aggregated attrition. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
7.
The simulations that many defense analysts rely upon in their studies continue to grow in size and complexity. This paper contrasts the guidance that the authors have received—from some of the giants of military operations research—with the current practice. In particular, the analytic utility of Hughes' simple salvo equations is compared with that of the complex Joint Warfighting System (JWARS), with respect to JWARS' key performance parameters. The comparison suggests that a family of analytic tools supports the best analyses. It follows that smaller, more agile, and transparent models, such as Hughes' salvo equations, are underutilized in defense analyses. We believe that these models should receive more attention, use, and funding. To illustrate this point, this paper uses two very simple models (by modern standards) to rapidly generate insights on the value of information relative to force strength. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
8.
9.
10.
本文以描述常规战最基本的模型——Lanchester方程为基础,就影响作战效率的一些因素进行了分析并定量化地表现在作战模型中,然后运用有关系统学理论讨论了作战效率变化对战斗进程的影响程度。 相似文献
11.
We undertake inference for a stochastic form of the Lanchester combat model. In particular, given battle data, we assess the type of battle that occurred and whether or not it makes any difference to the number of casualties if an army is attacking or defending. Our approach is Bayesian and we use modern computational techniques to fit the model. We illustrate our method using data from the Ardennes campaign. We compare our results with previous analyses of these data by Bracken and Fricker. Our conclusions are somewhat different to those of Bracken. Where he suggests that a linear law is appropriate, we show that the logarithmic or linear‐logarithmic laws fit better. We note however that the basic Lanchester modeling assumptions do not hold for the Ardennes data. Using Fricker's modified data, we show that although his “super‐logarithmic” law fits best, the linear, linear‐logarithmic, and logarithmic laws cannot be ruled out. We suggest that Bayesian methods can be used to make inference for battles in progress. We point out a number of advantages: Prior information from experts or previous battles can be incorporated; predictions of future casualties are easily made; more complex models can be analysed using stochastic simulation techniques. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 541–558, 2000 相似文献
12.
围绕战斗建模中的作战Agent模型的实现问题,通过对坦克战斗过程的分析,提出了以属性建模、能力建模和行为机制建模为要点的作战Agent建模方法,并在此基础上建立了面向实际应用的作战Agent模型;通过推演实验和与兰切斯特方程的比较实验,验证了作战Agent模型在模拟和解释战斗活动时的可行性、有效性和可操作性。 相似文献
13.
Future conflict between armed forces will occur both in the physical domain as well as the information domain. The linkage of these domains is not yet fully understood. We study the dynamics of a force subject to kinetic effects as well as a specific network effect–spreading malware. In the course of our study, we unify two well‐studied models: the Lanchester model of armed conflict and deterministic models of epidemiology. We develop basic results, including a rule for determining when explicit modeling of network propagation is required. We then generalize the model to a force subdivided by both physical and network topology, and demonstrate the specific case where the force is divided between front‐ and rear‐echelons. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献
14.
15.
Martijn van Ee 《海军后勤学研究》2020,67(2):147-158
We consider the salvo policy problem, in which there are k moments, called salvos, at which we can fire multiple missiles simultaneously at an incoming object. Each salvo is characterized by a probability pi: the hit probability of a single missile. After each salvo, we can assess whether the incoming object is still active. If it is, we fire the missiles assigned to the next salvo. In the salvo policy problem, the goal is to assign at most n missiles to salvos in order to minimize the expected number of missiles used. We consider three problem versions. In Gould's version, we have to assign all n missiles to salvos. In the Big Bomb version, a cost of B is incurred when all salvo's are unsuccessful. Finally, we consider the Quota version in which the kill probability should exceed some quota Q. We discuss the computational complexity and the approximability of these problem versions. In particular, we show that Gould's version and the Big Bomb version admit pseudopolynomial time exact algorithms and fully polynomial time approximation schemes. We also present an iterative approximation algorithm for the Quota version, and show that a related problem is NP-complete. 相似文献
16.
We address the problem of optimal decision‐making in conflicts based on Lanchester square law attrition model where a defending force needs to be partitioned optimally, and allocated to two different attacking forces of differing strengths and capabilities. We consider a resource allocation scheme called the Time Zero Allocation with Redistribution (TZAR) strategy, where allocation is followed by redistribution of defending forces, on the occurrence of certain decisive events. Unlike previous work on Lanchester attrition model based tactical decision‐making, which propose time sequential tactics through an optimal control approach, the present article focuses on obtaining simpler resource allocation tactics based on a static optimization framework, and demonstrates that the results obtained are similar to those obtained by the more complex dynamic optimal control solution. Complete solution for this strategy is obtained for optimal partitioning of resources of the defending forces. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
17.
18.
近年来,部队在实战化基础训练上下功夫,取得了一定成效,但还有相当一部分单位存在训得不全面、训得不规范、训得不精准、训得不娴熟的问题。解决这些问题,迫切需要从深化理论研究、聚焦实战要求、提升质量效益、加强监督问责等入手,加强实战化基础训练。 相似文献
19.