Attrition modeling in the presence of decoys: An operations-other-than-war motivation

Under various operational conditions, in particular in operations other than war (OOTW) or peacekeeping, an intervening force, here Blue, must occasionally engage in attrition warfare with an opposing force, here Red, that is intermingled with noncombatants. Desirably, Red armed actives are targeted, and not the unarmed noncombatants. This article describes some simple Lanchesterian attrition models that reflect a certain capacity of Blue to discriminate noncombatants from armed and active Red opponents. An explicit extension of the Lanchester square law results: Blue's abstinence concerning the indiscriminate shooting of civilians mixed with Red's is essentially reflected in a lower Blue rate of fire and less advantageous exchange rate. The model applies to other situations involving decoys, and reflects the value of a discrimination capability. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44 : 507–514, 1997     

Optimal resource allocation and redistribution strategy in military conflicts with Lanchester square law attrition

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     

Theoretical analysis of the general linear model for lanchester - type combat between two homogeneous forces

This paper studies Lanchester-type combat between two homogeneous forces modeled by the so-called general linear model with continuous replacements/withdrawals. It demonstrates that this model can be transformed into a simpler canonical form, which is also shown to arise from fixed-force-level-breakpoint battles modeled by Lanchester-type equations for modern warfare. Analytical expressions for the force levels for the general variable coefficient linear model with continuous replacements/withdrawals are constructed out of so-called general Lanchester functions for the model without replacements/withdrawals, for which all solutions are shown to be nonoscillatory in the strict sense. These force-level results are unfortunately so complicated and opaque that the constant-coefficient version of the model must be studied before any insights into the dynamics of combat may be analytically obtained. Thus, fairly complete results are given for the general linear model with constant attrition-rate coefficients and constant rates of replacement/withdrawal. However, the expressions for the force levels are still so complicated that we have not been able to develop battle-outcome prediction conditions directly from them alone but have had to establish general results on the qualitative behavior of solutions. A significant result (and one that greatly complicates the prediction of battle outcome) is that all solutions to the model with replacements/withdrawals are no longer necessarily nonoscillatory in the strict sense, i.e., both sides force levels can take on negative values if the force-on-force attrition equations are not “turned off” at the right time. Thus, this paper shows that the addition of continuous replacements/withdrawals to a Lanchester-type model may significantly change the qualitative behavior of the force-level trajectories. Battle-outcome prediction conditions are nevertheless given, and important insights into the dynamics of combat are briefly indicated.     

Fitting Lanchester equations to the battles of Kursk and Ardennes

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.     

On the relationship between the force ratio and the instantaneous casualty-exchange ratio for some lanchester-type models of warfare

A “local” condition of winning (in the sense that the force ratio is changing to the advantage of one of the combatants) is shown to apply to all deterministic Lanchester-type models with two force-level variables. This condition involves the comparison of only the force ratio and the instantaneous force-change ratio. For no replacements and withdrawals, a combatant is winning “instantaneously” when the force ratio exceeds the differential casualty-exchange ratio. General outcome-prediction relations are developed from this “local” condition and applied to a nonlinear model for Helmbold-type combat between two homogeneous forces with superimposed effects of supporting fires not subject to attrition. Conditions under which the effects of the supporting fires “cancel out” are given.     

Target selection in lanchester combat: Heterogeneous forces and time-dependent attrition-rate coefficients

We develop solutions to two fire distribution problems for a homogeneous force in Lanchester combat against heterogeneous enemy forces. The combat continues over a period of time with a choice of tactics available to the homogeneous force and subject to change with time. In these idealized combat situations the lethality of each force's fire (as expressed by the Lanchester attrition-rate coefficient) depends upon time. Optimal fire distribution rules are developed through the combination of Lanchester-type equations for combat attrition and deterministic optimal control theory (Pontryagin maximum principle). Additionally, the theory of state variable inequality constraints is used to treat the nonnegativity of force levels. The synthesis of optimal fire distribution policies was facilitated by exploiting special mathematical structures in these problems.     

The salvo combat model with area fire

This article analyzes versions of the salvo model of missile combat where area fire is used by one or both sides in a battle. Although these models share some properties with the area fire Lanchester model and the aimed fire salvo model, they also display some interesting differences, especially over the course of several salvos. Although the relative size of each force is important with aimed fire, with area fire, it is the absolute size that matters. Similarly, although aimed fire exhibits square law behavior, area fire shows approximately linear behavior. When one side uses area fire and the other uses aimed fire, the model displays a mix of square and linear law behavior. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 652–660, 2013     

“simple-approximate” battle-outcome-prediction conditions for variable-coefficient lanchester-type equations of modern warfare

This article considers combat between two homogeneous forces modeled by variable- coefficient Lanchester-type equations of modern warfare and develops new “simple-approximate” battle-outcome-prediction conditions for military engagements terminated by two different types of prescribed conditions being met (fixed-force-level-breakpoint battles and fixed-force-ratio-breakpoint battles). These battle-outcome-prediction conditions are sufficient (but not necessary) to determine the outcome of battle without having to explicitly compute the force-level trajectories, and they are characterized by their simplicity, requiring no advanced mathematical knowledge or tabulations of “special functions” for their application. Integrability properties of the Lanchester attrition-rate coefficients figure prominently in their results, and involved in their development is a generalization of Lanchester's famous square law to variable-coefficient Lanchester-type combat and several other novel mathematical developments for the analysis of ordinary differential equations. Examples are given, with the attack of a mobile force against a static defensive position (both sides armed with weapons whose firepower is range dependent) being examined in detail.     

我国边境法制建设中需要重点完善的方面

在国家法制建设不断推进的背景下，我国边境法制建设的某些方面还不够完善，需要加快立法进程，尽快制定全国统一的陆地国界法，为陆地边境管理提供法律依据；完善海上边防管理法规，为维护国家海洋权益提供法律保障；加紧出台统一的出入境法典，整合出入境法律体系；完善打击“三股势力”和跨境犯罪的法律制度，维护边境安全稳定。     

有限声速的纯方位算法

针对纯方位条件下对等速直航目标观测的算法问题,将目标运动要素及平均声速作为待估计参数,给出了计算非线性最小二乘法目标函数梯度与Hessian矩阵的解析公式,基于这些公式,可以构造估计目标运动要素的一些算法及编程实现。部分数值实验表明,信赖域算法、Levenberg-Marquardt算法与Matlab用于解非线性最小二乘问题的函数lsqnonlin的计算精度基本一致。     

New results on rendezvous search on the interval

In a rendezvous search problem, two players are placed in a network and must try to meet each other in the least possible expected time. We look at rendezvous search on a discrete interval in which the players are initially placed using independent draws (usually assumed to be from the same distribution). Some optimal solutions are known if this distribution is uniform, and also for certain other special types of distribution. In this article, we present two new results. First, we characterize the complete set of solutions for the uniform case, showing that all optimal strategies must have two specific properties (namely, of being swept and strictly geodesic). Second, we relate search strategies on the interval to proper binary trees, and use this correspondence to derive a recurrence relation for solutions to the symmetric rendezvous problem for any initial distribution. This relation allows us to solve any such problem computationally by dynamic programming. Finally, some ideas for future research are discussed. © Wiley Periodicals, Inc. Naval Research Logistics 60: 454–467, 2013     

Target selection in Lanchester combat: Linear-law attrition process

We develop the solution to a simple problem of target selection in Lanchester combat against two enemy force types each of which undergoes a “linear-law” attrition process. In addition to the Pontryagin maximum principle, the theory of singular extremals is required to solve this problem. Our major contribution is to show how to synthesize the optimal target selection policies from the basic optimality conditions. This solution synthesis methodology is applicable to more general dynamic (tactical) allocation problems. For constant attrition-rate coefficients we show that whether or not changes can occur in target priorities depends solely on how survivors are valued and is independent of the type of attrition process.     

Static and dynamic scheduling of customer arrivals to a single-server system

In this article we consider a single-server system whose customers arrive by appointments only. Both static and dynamic scheduling problems are studied. In static scheduling problems, one considers scheduling a finite number of customer arrivals, assuming there is no scheduled customer arrival to the system. In dynamic scheduling problems, one considers scheduling one customer arrival only, assuming that there are a number of scheduled customers already. The expected delay time is recursively computed in terms of customer interarrival times for both cases. The objective is to minimize the weighted customer delay time and the server completion time. The problem is formulated as a set of nonlinear equations. Various numerical examples are illustrated. © 1993 John Wiley & Sons, Inc.     

A Lanchester-type aggregated-force model of conventional ground combat

This article develops a Lanchester-type model of large-scale conventional ground combat between two opposing forces in a “sector”. It is shown that nonlinear Helmbold-type equations of warfare with operational losses may be used to represent the loss-rate curves that have been used in many aggregated-force models. These nonlinear differential equations are used to model the attrition of combat capability (as quantified by a so-called firepower index) in conjunction with a rate-of-advance equation that relates motion of the contact zone (or FEBA) between the opposing forces to the force ratio and tactical decisions of the combatants. This simplified auxiliary model is then used to develop some important insights into the dynamics of FEBA movement used in large-scale aggregated-force models. Different types of behavior for FEBA movement over time are shown to correspond to different ranges of values for the initial force ratio, for example, an attack will “stall out” for a range of initial force ratios above a specific threshold value, but it will “break out” for force ratios above a second specific threshold value. Such FEBA-movement predictions are essentially based on being able to forecast changes over time in the force ratio.     

基于珠式模型的绳系卫星安全交会过程建模与仿真

安全交会是绳系卫星空间应用的一个重要拓展。为满足安全交会的高精度需求,考虑重力、拉力和阻尼力的作用建立了绳系卫星系统三维珠式模型。讨论并选择了一种匀速-匀减速展开策略,推导得到平衡位置零相对速度条件下的安全交会末端约束,在此基础上基于反馈线性化基本原理设计了一种子星喷气推力的安全交会控制律。数值仿真基于低轨道和地球同步轨道条件来进行,4个算例的仿真结果验证了珠式模型条件下,匀速-匀减速展开策略及反馈线性化交会控制律的理论可行性,且交会控制力需求表现为同步轨道低于低轨。该方法可为绳系卫星精确交会技术提供一定参考。     

The war after next is here – what does the elephant look like?

A comprehensive paradigm of future wars can be defined, and is called in this article “Extended conflicts.” These can be characterized by strategic attrition, to which all national resources and all possible international legitimacy are mobilized, in order to achieve a resolution by transformation of the opponent. The use of military force in this kind of conflict is limited. The understanding that we are facing an era of extended conflicts will improve the way it is utilized.     

Theoretical analysis of lanchester-type combat between two homogeneous forces with supporting fires

This paper studies combat between two homogeneous forces modelled with variable-coefficient Lanchester-type equations of modern warfare with supporting fires not subject to attrition. It shows that this linear differential-equation model for combat with supporting fires may be transformed into one without the supporting fires so that all the previous results for variable-coefficient Lanchester-type equations of modern warfare (without supporting fires) may be invoked. Consequently, new important results for representing the solution (i.e. force levels as functions of time) in terms of canonical Lanchester functions and also for predicting force annihilation are developed for this model with supporting fires. Important insights into the dynamics of combat between two homogeneous forces with such supporting fires are discussed.     

Right Intention and the Ends of War

The jus ad bellum criterion of right intention (CRI) is a central guiding principle of just war theory. It asserts that a country’s resort to war is just only if that country resorts to war for the right reasons. However, there is significant confusion, and little consensus, about how to specify the CRI. We seek to clear up this confusion by evaluating several distinct ways of understanding the criterion. On one understanding, a state’s resort to war is just only if it plans to adhere to the principles of just war while achieving its just cause. We argue that the first understanding makes the CRI superfluous, because it can be subsumed under the probability of success criterion. On a second understanding, a resort to war is just only if a state’s motives, which explain its resort to war, are of the right kind. We argue that this second understanding of the CRI makes it a significant further obstacle to justifying war. However, this second understanding faces a possible infinite regress problem, which, left unresolved, leaves us without a plausible interpretation of the CRI. This constitutes a significant and novel reason for leaving the CRI out of the international law of armed conflict (LOAC).     

Some two-on-two homogeneous stochastic combats

In this article we consider two versions of two-on-two homogeneous stochastic combat and develop expressions, in each case, for the state probabilities. The models are natural generalizations of the exponential Lanchester square law model. In the first version, a marksman whose target is killed resumes afresh the killing process on a surviving target; in the second version, the marksman whose target is killed merely uses up his remaining time to a kill on a surviving target. Using the state probabilities we then compute such important combat measures as (1) the mean and variance of the number of survivors as they vary with time for each of the sides, (2) the win probabilities for each of the sides, and (3) the mean and variance of the battle duration time. As an application, computations were made for the specific case of a gamma (2) interfiring time random variable for each side and the above combat measures were compared with the appropriate exponential and deterministic Lanchester square law approximations. The latter two are shown to be very poor approximations in this case.     

Some simple victory-prediction conditions for lanchester-type combat between two homogeneous forces with supporting fires

This paper develops new “simple” victory-prediction conditions for a linear Lanchester-type model of combat between two homogeneous forces with superimposed effects of supporting fires not subject to attrition. These simple victory-prediction conditions involve only the initial conditions of battle and certain assumptions about the nature of temporal variations in the attrition-rate coefficients. They are developed for a fixed-force-ratio-breakpoint battle by studying the force-ratio equation for the linear combat model. An important consideration is shown to be required for developing such simple victory-prediction conditions: victory is not guaranteed in a fixed-force-ratio-breakpoint battle even when the force ratio is always changing to the advantage of one of the combatants. One must specify additional conditions to hold for the cumulative fire effectivenesses of the primary weapon systems in order to develop correct victory-prediction conditions. The inadequacy of previous victory-prediction results is explained by examining (for the linear combat model without the supporting fires) new “exact” victory-prediction conditions, which show that even the range of possible battle outcomes may be significantly different for variable-coefficient and constant-coefficients models.