Optimal fire allocation in a combat model of mixed NCW type

04/07/2021
by   My A. Vu, et al.
0

In this work, we introduce a nonlinear Lanchester model of NCW-type and study a problem of finding the optimal fire allocation for this model. A Blue party B will fight against a Red party consisting of A and R, where A is an independent force and R fights with supports from a supply unit N. A battle may consist of several stages but we consider the problem of finding optimal fire allocation for B in the first stage only. Optimal fire allocation is a set of three non-negative numbers whose sum equals to one, such that the remaining force of B is maximal at any instants. In order to tackle this problem, we introduce the notion of threatening rates which are computed for A, R, N at the beginning of the battle. Numerical illustrations are presented to justify the theoretical findings.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset