Category
page 1Combat modeling
operations research
discipline that deals with the application of advanced analytical methods to help make better decisions
circular error probable
an intuitive measure of a weapon system's precision
Lanchester's laws
mathematical formulas for calculating the relative strengths of military forces
German tank problem
estimating the maximum of a discrete uniform distribution from sampling without replacement, historically from predicting German tank production based on ascending serial numbers in tanks lost in combat
differential game
Concept in game theory
Pursuit-evasion
Pursuit–evasion (variants of which are referred to as cops and robbers and graph searching) is a family of problems in mathematics and computer science in which one group attempts to track down members of another group in an environment. Early work on problems of this type modeled the environment geometrically. In 1976, Torrence Parsons introduced a formulation whereby movement is constrained by a graph. The geometric formulation is sometimes called continuous pursuit–evasion, and the graph formulation discrete pursuit–evasion (also called graph searching). Current research is typically limite