# Modeling and Optimal Control of a Class of Warfare Hybrid Dynamic Systems Based on Lanchester(

Authors: Xiangyong Chen; Ancai Zhang
Journal: Mathematical Problems in Engineering
 (2014)

---

## Abstract

For the particularity of warfare hybrid dynamic process, a class of warfare
hybrid dynamic systems is established based on Lanchester equation in a(
n
,
1
) battle, where a heterogeneous force of n different troop types faces a homogeneous force. This model can be characterized by the interaction of continuous-time models (governed by Lanchester equation), and discrete event systems (described by variable tactics). Furthermore, an expository discussion is presented on an optimal variable tactics control problem for warfare hybrid dynamic system. The optimal control strategies are designed based on dynamic programming and differential game theory. As an example of the consequences of this optimal control problem, we take the (2, 1) case and solve the optimal strategies in a (2, 1) case. Simulation results show the feasibility of warfare hybrid system model and the effectiveness of the optimal control strategies designed.


---

## Body

## 1. Introduction

In 1914, Lanchester [1] first proposed a mathematical model to describe and forecast quantitatively the development trend of battle. Since then, Lanchester equation has been used to analyze real wars [2–5] and determine tactics for deploying forces in war game simulations, as they produce reasonably good predictions. The popularity and wide acceptance of the Lanchester models are due to their amenability to simple analysis and the fact that they, by and large, reflect the actual conflict situation. Undoubtedly, even in the modern high-tech war, Lanchester equation can still make a comprehensive assessment and decision-making for a variety of battlefield factors.To establish the mathematical model describing warfare process is the basis for researching quantitatively decision-making problems in conflicts. So far, warfare system models based on Lanchester equation have penetrated into many fields of military problems; the research core mainly focuses on extending and modifying Lanchester equation. For example, in [6], Sha introduced morale parameter based on the conventional Lanchester equation of casualty rate to set up mathematic models. In [7, 8], by introducing battlefield sensing coefficient and information superiority coefficient to modify the casualty rates of Lanchester equation, the generalized model for information warfare was proposed. In [9], considering the relationship between electronic jamming and operational efficiency, an expanded Lanchester square law model with variable efficiency factors was established. In [10, 11], a spatial modeling of Lanchester equations was conceptualized on the basis of explicit movement dynamics and balance of forces, ensuring stability and theoretical consistency with the original model. In [12, 13], some extensions of the Lanchester square law to inhomogeneous forces with an application to force allocation methodology were studied. However, all the models above have some limitations in war game simulations and tactical decision-making application, especially without regard to the interaction between the discrete event-driven tactics and the continuous force changes and without revealing better the complex operation mechanism, which is more close to the actual warfare dynamic process.In fact, warfare dynamic process is a hybrid dynamic process, which is characterized by the interaction of continuous time dynamic process (described, e.g., fighting strength changes) and discrete event dynamic process (described, e.g., fighting strength scheduling, variable tactics). Thus, how to establish warfare hybrid dynamic system model, which integrates the discrete events with continuous time, has become a problem to be solved urgently. In [14, 15], Xu first proposed the modeling idea of warfare hybrid dynamic system; the basic frame and method to solve this kind of problems are investigated and a series of key technologies are emerged. Thus, in this paper, we first study the modeling of warfare hybrid dynamic system based on Lanchester equation. Introducing the discrete event variable, which can trigger the occurrence of variable tactics, the terms concerned with operational losses within Lanchester equation are modified, and a new warfare hybrid dynamic system is established.Optimal control problem of warfare dynamic system has been an area of considerable research interest and has been an absolutely necessary tache on using Lanchester equation to research the tactic decision-making problem. So far, a wide variety of research achievements on this problem have been obtained, such as. In [16], Taylor considered a class of optimal resource allocation problems as a time sequential resource allocation problem and presented a solution in the optimal control framework based on Lanchester equation. In [17, 18], Taylor and Issacc used differential game theory to study the tactic decision-making problem, respectively. In [19, 20], Sha and Zeng and Li et al. solved the firepower assignment problem based on Lanchester equation and differential game theory, and they also validated, from another aspect, the principle of concentrating superior firepower in attack. In [21–25], optimal strategies of force resource complementary were obtained based on optimal control and differential game. However, the recent study results are confined to determine the optimal control problem of warfare continuous dynamic process. And there are not the effective theories and methods to solve the optimal tactic control problem of discrete event dynamic process. Thus, in this paper, we study the problem of building the optimal variable tactics control of warfare hybrid dynamic system based on Lanchester (
n
,
1
) model [26, 27]. By using dynamic programming and differential game theory, we present the approach to obtain the optimal control strategies.The paper is organized as follows. In Section2, warfare hybrid dynamic process description and modeling are studied. In Section 3, the optimal control strategies of warfare hybrid dynamic system based on Lanchester (
n
,
1
) model are given, and the simulation results demonstrate the effectiveness of proposed optimal control schemes. And finally some concluding remarks are given in Section 4.


## 2. Warfare Hybrid Dynamic Process Description and Modeling

In order to directly understand the basic frame of warfare hybrid dynamic system, the evolution analysis of warfare process is given in Figure1.Figure 1
Evolution analysis of warfare hybrid dynamic process in a(
n
,
1
) battle.Firstly, letX denote the attacking force and let Y denote the defending force. It is assumed that the attacking force consists of one type of forces and the defending force consists of n type of forces. Then we can make out that, from Figure 1, the composition of warfare hybrid dynamic process can be considered as the following key elements of two; they are the event-driven tactics and the continuous force strength changes. The variable tactics evolution process can be described as follows:(1)
firstly,Y will concentrate all superior firepower to attack X throughout the period of battle. However, at the time t
0, X decides the initial encounter according to each original situation;
(2)
at the timet
1, after surveys, X detects the opponent’s targets and motives and responds with variable tactics, and a new belligerent encounter accordingly is established;
(3)
at the timet
2, after fresh surveys, X responds with variable tactics for good and consequently establishes a new belligerent encounter;
(4)
the above-mentioned process continues.There is no difficulty in deducing the conclusion that variable tactics of the decision-makerX happen at the discrete moment, which can lead to the changes of the belligerent encounter and structural changes of the system, shown in features of discrete event dynamic system.The warfare process evolution also involves the continuous control of force strengths on both combat units. Based on decision-maker’s instructions and detected situation, each combat unit adjusts the control variables with the purpose of changing the force strengths; however, the warfare task is certain herein. It falls into a category of continuous control process with the systematic structure unchanged. Therefore, warfare dynamic process can be considered as warfare hybrid dynamic system, which is that force strengths change on both sides from one continuous system to another via certain variable tactics (those that change combat encounter), and every variable tactic happens; the whole system operates following the later’s rules.Inspired by [21], we can give some reasonable assumptions as follows.Assumption 1.
Xand Y have, respectively, one and n combat units, x
1
(
t
) and y
j
(
t
)
(
j
=
1
,
…
,
n
) are the strengths of one and jth combat unit on both sides surviving at time t, and the original states are x
1
(
0
)
=
x
10 and y
j
(
0
)
=
y
j
0.Assumption 2.
Suppose that variable tactics happen at timet
k
(
1
≤
k
≤
∞
), where t
k
∈
[
t
0
,
t
f
], t
0
≤
⋯
≤
⋯
≤
t
f, and t
0 is the initial time. e
s
(
s
=
1
,
…
,
k
,
…
) is the discrete event variable happening at time t
s; then the route of variable tactics can be described as
(1)
r
=
(
(
t
1
,
e
1
)
,
…
,
(
t
s
,
e
s
)
)
,
where (
t
s
,
e
s
) means the occurrence of variable tactics at time t
s.Motivated by the above discussions, a class of warfare hybrid dynamic systems based on Lanchester equation can be established as follows:(2)
x
˙
1
(
t
)
=
-
∑
j
=
1
n
‍
α
j
1
ψ
j
1
e
s
y
j
(
t
)
+
u
1
(
t
)
,
y
˙
j
(
t
)
=
-
β
1
j
ϕ
1
j
e
s
x
1
(
t
)
+
v
j
(
t
)
,
where β
1
j is the nonnegative attrition coefficient of x
1 to y
j and α
j
1 is the nonnegative attrition coefficient of y
j to x
1; u
1
(
t
) and v
j
(
t
) are corresponding control input; ψ
j
1
e
s
∈
{
0,1
} and ϕ
1
j
e
s
∈
{
0,1
} are corresponding encounter tactics; then Ψ
e
s and Φ
e
s are variable tactic matrices driven by discrete events:
(3)
Ψ
e
s
=
[
ψ
1
1
e
s
ψ
2
1
e
s
⋯
ψ
n
1
e
s
]
;
Φ
e
s
=
[
ϕ
1
1
e
s
ϕ
1
2
e
s
⋮
ϕ
1
n
e
s
]
.From Assumption2, it is known that the variable tactics driven by discrete events will satisfy
(4)
Ψ
e
s
-
1
×
e
s
⟶
Ψ
e
s
Φ
e
s
-
1
×
e
s
⟶
Φ
e
s
.Remark 3.
The values of switch variableψ
j
1
e
s
∈
{
0,1
} and ϕ
1
j
e
s
∈
{
0,1
} are given according to the encounter relation between two combat units on both sides:
(5)
ψ
j
1
e
s
=
{
0
,
No
encounter
between
y
j
and
x
1
,
1
,
y
j
encounters
x
1
with
all
forces
,
ϕ
i
j
e
s
=
{
0
,
No
encounter
between
y
j
and
x
1
,
1
,
x
1
encounters
y
j
with
all
forces
.Remark 4.
Ψ
e
s and Φ
e
s are driven to change by discrete event e
s, which therefore affects and changes system (2). If (4) is tenable, then continuous subsystems of Ψ
e
s
-
1 and Φ
e
s
-
1 are changed to that of Ψ
e
s and Φ
e
s, which tell that variable tactics decide the number of continuous subsystems.From Remarks3 and 4, this model has a better description of the interaction of continuous-time models (governed by Lanchester equations) and of logic rules and discrete event systems (described, e.g., by variable tactics). And it is known that the discrete part makes the decision for the whole system to switch to another set of control rules if conditions are favorable, and the continuous part as a result works according to the new rules.


## 3. Optimal Control of Warfare Hybrid System via Lanchester(
n
,
1
) Model

### 3.1. Problem Statement

In this section, the optimal variable tactics control problem of warfare hybrid dynamic system in a(
n
,
1
) battle, in which a heterogeneous force of n different troop types faces a homogeneous force, is investigated. With what is mentioned above, we present some assumptions which will be used.Assumption 5.
The values of switch variablesψ
j
1
e
s and ϕ
1
j
e
s satisfy the following conditions:
(6)
ψ
j
1
e
s
=
1
;
∑
j
=
1
n
‍
ϕ
i
j
e
s
=
1
.
Meanwhile, we suppose that the most effective battle stage is [
0
,
T
], where T is the end time of battle, x
1
(
T
) and y
j
(
T
) are the residual of strengths on both sides in the terminal time T, x
1
(
T
)
≠
0, and y
j
(
T
)
≠
0.From Assumption5, the system model is rewritten to be
(7)
x
˙
1
(
t
)
=
-
∑
j
=
1
n
‍
α
j
1
y
j
(
t
)
+
u
1
(
t
)
,
y
˙
j
(
t
)
=
-
β
1
j
ϕ
1
j
e
s
x
1
(
t
)
+
v
j
(
t
)
.The objective function associated with system (6) is of the following form:
(8)
J
=
η
1
x
1
(
T
)
-
∑
j
=
1
n
‍
θ
j
y
j
(
T
)
,
where η
1 and θ
j are the relative operation indices, which is the weight of the importance of the corresponding units on both sides. Then, η
1
x
1
(
T
) and ∑
j
=
1
n
θ
j
y
j
(
T
) are the residual of actual strengths on both sides in the terminal time T.Now, the optimal variable tactics control problem can be described as follows. The attacking sideX selects the number of tactics changes, the time of every variable tactics, and the sequences of corresponding variable tactics Φ
e
s
*
(
s
=
1
,
…
,
k
) to maximize the objective function J.


### 3.2.  Solving Method for the Optimal Control Strategies

In this subsection, we analyze the conditions of the optimal variable tactics and give a quantitative analysis of the variable tactics process. Finally, a solving method for the optimal control strategies is designed.For the above optimal control problem, we introduce the adjoint function as follows:(9)
[
λ
μ
]
=
(
λ
1
,
μ
1
,
…
,
μ
n
)
T
and construct the Hamilton function to be
(10)
H
(
x
,
y
,
λ
,
μ
,
Φ
,
t
)
=
-
∑
j
=
1
n
‍
(
λ
1
α
j
1
)
y
j
-
∑
j
=
1
n
‍
μ
j
β
1
j
ϕ
1
j
e
s
x
1
+
λ
1
u
1
(
t
)
+
∑
j
=
1
n
‍
μ
j
v
j
(
t
)
.
Then, by using the Minimax principle of differential game, the necessary conditions about the optimal tactics are that there exist the corresponding adjoint functions λ
*
(
t
) and u
*
(
t
), which satisfy
(11)
λ
˙
1
(
t
)
=
-
∂
H
∂
x
1
=
∑
j
=
1
n
‍
μ
j
β
i
j
ϕ
i
j
e
s
,
λ
1
(
T
)
=
∂
J
∂
x
1
=
η
1
,
μ
˙
j
(
t
)
=
-
∂
H
∂
y
j
=
λ
1
α
j
1
,
μ
j
(
T
)
=
∂
J
∂
y
j
=
-
θ
j
.From (11), we have
(12)
λ
˙
1
(
t
)
<
0
,
μ
˙
j
(
t
)
>
0
,
λ
1
(
T
)
>
0
,
μ
j
(
T
)
<
0
.
Therefore, for any time t
∈
[
0
,
T
], it is easy to get
(13)
λ
1
(
t
)
>
0
,
μ
j
(
t
)
<
0
.
Then, we can obtain that
(14)
H
(
x
*
,
y
*
,
λ
*
,
μ
*
,
Φ
e
s
*
,
t
)
=
max
⁡
Φ
e
s
H
(
x
*
,
y
*
,
λ
*
,
μ
*
,
Φ
e
s
,
t
)
=
max
⁡
Φ
e
s
(
∑
j
=
1
n
‍
-
μ
j
*
β
1
j
ϕ
1
j
e
s
x
1
*
)
.From (14) and x
1
*
>
0, we know that ∑
j
=
1
n
(
-
μ
j
*
)
β
i
j
ϕ
i
j
e
s is the weighted average of -
μ
j
*
β
i
j; then the optimal tactics satisfy
(15)
ϕ
i
j
e
s
*
=
{
1
,
max
⁡
j
(
-
μ
j
*
β
1
j
)
=
-
μ
j
*
*
β
1
j
*
,
0
,
max
⁡
j
(
-
μ
j
*
β
1
j
)
≠
-
μ
j
*
*
β
1
j
*
.Remark 6.
Sinceμ
j
(
T
) is a continuous function, μ
j
*
(
T
)
β
1
j is also continuous; thus, the optimal tactic strategy ϕ
i
j
e
s
* remains stable on a period of time; that is, ϕ
i
j
e
s
* remains stable at the time interval [
T
-
δ
,
T
].Based on the above analysis, we discuss the variable tactics process about the attacking sideX. And the existence conditions of variable tactics are investigated in the following theorem.Theorem 7.
If there exist at least two functionsμ
j
l
(
t
)
β
1
j
l and μ
j
g
(
t
)
β
1
j
g
(
l
,
g
∈
{
1
,
…
,
n
}
a
n
d
j
l
≠
j
g
) at the time interval [
Δ
k
,
T
], such that
(16)
-
μ
j
l
(
t
)
β
1
j
l
<
-
μ
j
g
(
t
)
β
1
j
g
,
(17)
-
μ
j
l
(
Δ
k
)
β
1
j
l
=
-
μ
j
g
(
Δ
k
)
β
1
j
g
,
(18)
-
μ
˙
j
l
(
Δ
k
)
β
1
j
l
<
-
μ
˙
j
g
(
Δ
k
)
β
1
j
g
,
hold, then one obtains that
(19)
-
μ
j
l
(
t
)
β
1
j
l
>
-
μ
j
g
(
t
)
β
1
j
g
at the left neighborhood of t
=
Δ
k. That is, there exists a variable tactic for X at [
t
,
T
]
(
t
<
Δ
k
), and Δ
k is the minimum time of tactic change.Proof.
From (15), it is not difficult to show that
(20)
ϕ
i
j
e
s
*
*
=
{
1
,
max
⁡
j
(
-
μ
j
*
(
T
)
β
1
j
)
=
-
μ
j
*
*
(
T
)
β
1
j
*
,
0
,
max
⁡
j
(
-
μ
j
*
(
T
)
β
1
j
)
≠
-
μ
j
*
*
(
T
)
β
1
j
*
.
So, there exist at least two functions μ
j
l
(
t
)
β
1
j
l and μ
j
g
(
t
)
β
1
j
g
(
j
l
≠
j
g
) at the time interval [
Δ
k
,
T
], which satisfy
(21)
-
μ
j
l
(
t
)
β
1
j
l
<
-
μ
j
g
(
t
)
β
1
j
g
.
From (18), we have that
(22)
lim
⁡
ɛ
-
→
0
-
μ
j
l
(
Δ
k
)
β
1
j
l
-
(
-
μ
j
l
(
Δ
k
-
ɛ
)
β
1
j
l
)
ɛ
<
lim
⁡
ɛ
-
→
0
-
μ
j
g
(
Δ
k
)
β
1
j
g
-
(
-
μ
j
g
(
Δ
k
-
ɛ
)
β
1
j
g
)
ɛ
.
Combining the aforementioned inequality with (17) yields
(23)
-
μ
j
l
(
Δ
k
-
ɛ
)
β
1
j
l
>
-
μ
j
g
(
Δ
k
-
ɛ
)
β
1
j
g
.
Since the following inequality
(24)
-
μ
j
l
(
Δ
k
+
ɛ
)
β
i
j
l
<
-
μ
j
g
(
Δ
k
+
ɛ
)
β
i
j
g
holds at the right neighborhood of t
=
Δ
k, therefore, there exists a variable tactic for X at the time Δ
k
(
0
<
Δ
k
<
T
).
Now, we will investigate thatΔ
k is the minimum time of tactic change. Firstly, we suppose that Δ
k
1
(
Δ
k
1
<
Δ
k
) is the minimum time of tactic change; then we have
(25)
-
μ
j
l
(
Δ
k
1
+
ɛ
)
β
1
j
l
<
-
μ
j
g
(
Δ
k
1
+
ɛ
)
β
1
j
g
,
-
μ
j
l
(
Δ
k
1
-
ɛ
)
β
1
j
l
>
-
μ
j
g
(
Δ
k
1
-
ɛ
)
β
1
j
g
.
From (17), (18), and (19), we easily get
(26)
-
μ
j
l
(
t
)
β
1
j
l
<
-
μ
j
g
(
t
)
β
1
j
g
,
t
∈
(
Δ
k
1
,
T
]
;
then there exists the contradiction between (23) and (26). Thus, Δ
k is the minimum time of tactic change when it draws near the termination time T. The proof is completed.According to Theorem7, we give a solving method of the optimal control strategies.Step 1.
Usingμ
j
(
T
)
β
1
j, we solve the optimal tactics Φ
e
k at the time interval near the termination time T. Furthermore, we seek the minimum time of tactic change Δ
k, which satisfies Theorem 7.Step 2.
Usingμ
j
(
Δ
k
)
β
1
j, the optimal tactics Φ
e
k
-
1 are obtained at the time interval near Δ
k, and we seek the minimum time of tactic change Δ
k
-
1.Step 3.
The aforementioned process continues. When the conditions of tactic change cannot hold in the time interval[
0
,
Δ
1
] near the initial time, the solving process stops.Step 4.
SortingΔ
1
,
…
,
Δ
k, we obtain that the discrete event variable e
=
{
e
1
,
…
,
e
f
}
(
0
≤
f
<
∞
) and the route of variable tactic r
=
(
(
t
1
,
e
1
)
,
…
,
(
t
f
,
e
f
)
), where, t
f
∈
{
Δ
1
,
…
,
Δ
k
) is the time of tactic change and e
f is a discrete event.


### 3.3. Application Example Analysis

As an example of the consequences of the optimal control problem, we take the(
2,1
) case and solve the optimal strategies in a (
2,1
) case. In this subsection, we consider the warfare dynamic system model that is described by
(27)
x
˙
1
=
-
∑
j
=
1
2
‍
α
j
1
y
j
+
u
1
,
y
˙
1
=
-
β
11
ϕ
1
1
e
k
x
1
+
v
1
,
y
˙
2
=
-
β
12
ϕ
1
2
e
k
x
1
+
v
2
,
where x
1
(
t
),  y
1
(
t
), and y
2
(
t
) are the strengths of two opposing forces surviving at time t.The objective function associated with the system (27) is of the following form:
(28)
J
=
η
1
x
1
-
θ
1
y
1
-
θ
2
y
2
.
The relevant parameters of system are as follows. The initial force strengths are x
10
=
100, y
10
=
30,  y
20
=
30; α
11
=
9, α
21
=
1,  β
11
=
β
12
=
1 are the nonnegative attrition coefficients; the battle terminal time is T
=
0.489; the relative operation indices are η
1
=
9, θ
1
=
1, θ
2
=
9, and we choose that u
1
=
0, v
1
=
v
2
=
0. In the proposed solving algorithm, we set the initial values t
0
=
T, λ
1
(
T
)
=
9, μ
1
(
T
)
=
-
1, and μ
2
(
t
)
=
-
9 and the step length κ
=
0.001; then we can know that t
=
t
0
-
χ
κ, where χ is the cycle number.Solving the optimal control problem by Matlab Toolbox yields that whenχ
=
105, the variable tactics occur, and the corresponding time is Δ
1
=
0.384; then it is easy to get that the optimal tactics of X are
(29)
ϕ
1
1
e
k
(
t
)
=
1
,
ϕ
1
2
e
k
(
t
)
=
0
,
0
<
t
≤
Δ
1
,
ϕ
1
1
e
k
(
t
)
=
0
,
ϕ
1
2
e
k
(
t
)
=
1
,
Δ
1
<
t
≤
T
.
So the discrete event variable is e
1
=
{
Φ
e
0
,
Φ
e
1
}, where Φ
e
0
=
[
1
0
]; Φ
e
1
=
[
0
1
]. Therefore, the solution of optimal control problem in a (
2,1
) battle can be gotten as follows. X has a variable tactic in Δ
1
=
0.384, and the optimal tactics Φ
e
s
* for X satisfy
(30)
ϕ
1
1
e
0
*
(
t
)
=
1
;
ϕ
1
2
e
0
*
(
t
)
=
0
,
0
<
t
≤
Δ
1
,
ϕ
1
1
e
0
*
(
t
)
=
0
;
ϕ
1
2
e
1
*
(
t
)
=
1
,
Δ
1
≤
t
≤
T
.
And the route of variable tactic r
=
(
(
0
,
e
0
)
,
…
,
(
Δ
1
,
e
1
)
), and the optimal value of J is J
*
=
44.152.Figure2 shows the change of state trajectories of the units on both warring sides. It is easy to see that the state values change in t
=
Δ
1; meanwhile, the state changes are nonnegative, and the change of variable tactics always holds in the time interval [
0
,
T
].Figure 2
Strength change curves of each combat unit on both sides.


## 3.1. Problem Statement

In this section, the optimal variable tactics control problem of warfare hybrid dynamic system in a(
n
,
1
) battle, in which a heterogeneous force of n different troop types faces a homogeneous force, is investigated. With what is mentioned above, we present some assumptions which will be used.Assumption 5.
The values of switch variablesψ
j
1
e
s and ϕ
1
j
e
s satisfy the following conditions:
(6)
ψ
j
1
e
s
=
1
;
∑
j
=
1
n
‍
ϕ
i
j
e
s
=
1
.
Meanwhile, we suppose that the most effective battle stage is [
0
,
T
], where T is the end time of battle, x
1
(
T
) and y
j
(
T
) are the residual of strengths on both sides in the terminal time T, x
1
(
T
)
≠
0, and y
j
(
T
)
≠
0.From Assumption5, the system model is rewritten to be
(7)
x
˙
1
(
t
)
=
-
∑
j
=
1
n
‍
α
j
1
y
j
(
t
)
+
u
1
(
t
)
,
y
˙
j
(
t
)
=
-
β
1
j
ϕ
1
j
e
s
x
1
(
t
)
+
v
j
(
t
)
.The objective function associated with system (6) is of the following form:
(8)
J
=
η
1
x
1
(
T
)
-
∑
j
=
1
n
‍
θ
j
y
j
(
T
)
,
where η
1 and θ
j are the relative operation indices, which is the weight of the importance of the corresponding units on both sides. Then, η
1
x
1
(
T
) and ∑
j
=
1
n
θ
j
y
j
(
T
) are the residual of actual strengths on both sides in the terminal time T.Now, the optimal variable tactics control problem can be described as follows. The attacking sideX selects the number of tactics changes, the time of every variable tactics, and the sequences of corresponding variable tactics Φ
e
s
*
(
s
=
1
,
…
,
k
) to maximize the objective function J.


## 3.2.  Solving Method for the Optimal Control Strategies

In this subsection, we analyze the conditions of the optimal variable tactics and give a quantitative analysis of the variable tactics process. Finally, a solving method for the optimal control strategies is designed.For the above optimal control problem, we introduce the adjoint function as follows:(9)
[
λ
μ
]
=
(
λ
1
,
μ
1
,
…
,
μ
n
)
T
and construct the Hamilton function to be
(10)
H
(
x
,
y
,
λ
,
μ
,
Φ
,
t
)
=
-
∑
j
=
1
n
‍
(
λ
1
α
j
1
)
y
j
-
∑
j
=
1
n
‍
μ
j
β
1
j
ϕ
1
j
e
s
x
1
+
λ
1
u
1
(
t
)
+
∑
j
=
1
n
‍
μ
j
v
j
(
t
)
.
Then, by using the Minimax principle of differential game, the necessary conditions about the optimal tactics are that there exist the corresponding adjoint functions λ
*
(
t
) and u
*
(
t
), which satisfy
(11)
λ
˙
1
(
t
)
=
-
∂
H
∂
x
1
=
∑
j
=
1
n
‍
μ
j
β
i
j
ϕ
i
j
e
s
,
λ
1
(
T
)
=
∂
J
∂
x
1
=
η
1
,
μ
˙
j
(
t
)
=
-
∂
H
∂
y
j
=
λ
1
α
j
1
,
μ
j
(
T
)
=
∂
J
∂
y
j
=
-
θ
j
.From (11), we have
(12)
λ
˙
1
(
t
)
<
0
,
μ
˙
j
(
t
)
>
0
,
λ
1
(
T
)
>
0
,
μ
j
(
T
)
<
0
.
Therefore, for any time t
∈
[
0
,
T
], it is easy to get
(13)
λ
1
(
t
)
>
0
,
μ
j
(
t
)
<
0
.
Then, we can obtain that
(14)
H
(
x
*
,
y
*
,
λ
*
,
μ
*
,
Φ
e
s
*
,
t
)
=
max
⁡
Φ
e
s
H
(
x
*
,
y
*
,
λ
*
,
μ
*
,
Φ
e
s
,
t
)
=
max
⁡
Φ
e
s
(
∑
j
=
1
n
‍
-
μ
j
*
β
1
j
ϕ
1
j
e
s
x
1
*
)
.From (14) and x
1
*
>
0, we know that ∑
j
=
1
n
(
-
μ
j
*
)
β
i
j
ϕ
i
j
e
s is the weighted average of -
μ
j
*
β
i
j; then the optimal tactics satisfy
(15)
ϕ
i
j
e
s
*
=
{
1
,
max
⁡
j
(
-
μ
j
*
β
1
j
)
=
-
μ
j
*
*
β
1
j
*
,
0
,
max
⁡
j
(
-
μ
j
*
β
1
j
)
≠
-
μ
j
*
*
β
1
j
*
.Remark 6.
Sinceμ
j
(
T
) is a continuous function, μ
j
*
(
T
)
β
1
j is also continuous; thus, the optimal tactic strategy ϕ
i
j
e
s
* remains stable on a period of time; that is, ϕ
i
j
e
s
* remains stable at the time interval [
T
-
δ
,
T
].Based on the above analysis, we discuss the variable tactics process about the attacking sideX. And the existence conditions of variable tactics are investigated in the following theorem.Theorem 7.
If there exist at least two functionsμ
j
l
(
t
)
β
1
j
l and μ
j
g
(
t
)
β
1
j
g
(
l
,
g
∈
{
1
,
…
,
n
}
a
n
d
j
l
≠
j
g
) at the time interval [
Δ
k
,
T
], such that
(16)
-
μ
j
l
(
t
)
β
1
j
l
<
-
μ
j
g
(
t
)
β
1
j
g
,
(17)
-
μ
j
l
(
Δ
k
)
β
1
j
l
=
-
μ
j
g
(
Δ
k
)
β
1
j
g
,
(18)
-
μ
˙
j
l
(
Δ
k
)
β
1
j
l
<
-
μ
˙
j
g
(
Δ
k
)
β
1
j
g
,
hold, then one obtains that
(19)
-
μ
j
l
(
t
)
β
1
j
l
>
-
μ
j
g
(
t
)
β
1
j
g
at the left neighborhood of t
=
Δ
k. That is, there exists a variable tactic for X at [
t
,
T
]
(
t
<
Δ
k
), and Δ
k is the minimum time of tactic change.Proof.
From (15), it is not difficult to show that
(20)
ϕ
i
j
e
s
*
*
=
{
1
,
max
⁡
j
(
-
μ
j
*
(
T
)
β
1
j
)
=
-
μ
j
*
*
(
T
)
β
1
j
*
,
0
,
max
⁡
j
(
-
μ
j
*
(
T
)
β
1
j
)
≠
-
μ
j
*
*
(
T
)
β
1
j
*
.
So, there exist at least two functions μ
j
l
(
t
)
β
1
j
l and μ
j
g
(
t
)
β
1
j
g
(
j
l
≠
j
g
) at the time interval [
Δ
k
,
T
], which satisfy
(21)
-
μ
j
l
(
t
)
β
1
j
l
<
-
μ
j
g
(
t
)
β
1
j
g
.
From (18), we have that
(22)
lim
⁡
ɛ
-
→
0
-
μ
j
l
(
Δ
k
)
β
1
j
l
-
(
-
μ
j
l
(
Δ
k
-
ɛ
)
β
1
j
l
)
ɛ
<
lim
⁡
ɛ
-
→
0
-
μ
j
g
(
Δ
k
)
β
1
j
g
-
(
-
μ
j
g
(
Δ
k
-
ɛ
)
β
1
j
g
)
ɛ
.
Combining the aforementioned inequality with (17) yields
(23)
-
μ
j
l
(
Δ
k
-
ɛ
)
β
1
j
l
>
-
μ
j
g
(
Δ
k
-
ɛ
)
β
1
j
g
.
Since the following inequality
(24)
-
μ
j
l
(
Δ
k
+
ɛ
)
β
i
j
l
<
-
μ
j
g
(
Δ
k
+
ɛ
)
β
i
j
g
holds at the right neighborhood of t
=
Δ
k, therefore, there exists a variable tactic for X at the time Δ
k
(
0
<
Δ
k
<
T
).
Now, we will investigate thatΔ
k is the minimum time of tactic change. Firstly, we suppose that Δ
k
1
(
Δ
k
1
<
Δ
k
) is the minimum time of tactic change; then we have
(25)
-
μ
j
l
(
Δ
k
1
+
ɛ
)
β
1
j
l
<
-
μ
j
g
(
Δ
k
1
+
ɛ
)
β
1
j
g
,
-
μ
j
l
(
Δ
k
1
-
ɛ
)
β
1
j
l
>
-
μ
j
g
(
Δ
k
1
-
ɛ
)
β
1
j
g
.
From (17), (18), and (19), we easily get
(26)
-
μ
j
l
(
t
)
β
1
j
l
<
-
μ
j
g
(
t
)
β
1
j
g
,
t
∈
(
Δ
k
1
,
T
]
;
then there exists the contradiction between (23) and (26). Thus, Δ
k is the minimum time of tactic change when it draws near the termination time T. The proof is completed.According to Theorem7, we give a solving method of the optimal control strategies.Step 1.
Usingμ
j
(
T
)
β
1
j, we solve the optimal tactics Φ
e
k at the time interval near the termination time T. Furthermore, we seek the minimum time of tactic change Δ
k, which satisfies Theorem 7.Step 2.
Usingμ
j
(
Δ
k
)
β
1
j, the optimal tactics Φ
e
k
-
1 are obtained at the time interval near Δ
k, and we seek the minimum time of tactic change Δ
k
-
1.Step 3.
The aforementioned process continues. When the conditions of tactic change cannot hold in the time interval[
0
,
Δ
1
] near the initial time, the solving process stops.Step 4.
SortingΔ
1
,
…
,
Δ
k, we obtain that the discrete event variable e
=
{
e
1
,
…
,
e
f
}
(
0
≤
f
<
∞
) and the route of variable tactic r
=
(
(
t
1
,
e
1
)
,
…
,
(
t
f
,
e
f
)
), where, t
f
∈
{
Δ
1
,
…
,
Δ
k
) is the time of tactic change and e
f is a discrete event.


## 3.3. Application Example Analysis

As an example of the consequences of the optimal control problem, we take the(
2,1
) case and solve the optimal strategies in a (
2,1
) case. In this subsection, we consider the warfare dynamic system model that is described by
(27)
x
˙
1
=
-
∑
j
=
1
2
‍
α
j
1
y
j
+
u
1
,
y
˙
1
=
-
β
11
ϕ
1
1
e
k
x
1
+
v
1
,
y
˙
2
=
-
β
12
ϕ
1
2
e
k
x
1
+
v
2
,
where x
1
(
t
),  y
1
(
t
), and y
2
(
t
) are the strengths of two opposing forces surviving at time t.The objective function associated with the system (27) is of the following form:
(28)
J
=
η
1
x
1
-
θ
1
y
1
-
θ
2
y
2
.
The relevant parameters of system are as follows. The initial force strengths are x
10
=
100, y
10
=
30,  y
20
=
30; α
11
=
9, α
21
=
1,  β
11
=
β
12
=
1 are the nonnegative attrition coefficients; the battle terminal time is T
=
0.489; the relative operation indices are η
1
=
9, θ
1
=
1, θ
2
=
9, and we choose that u
1
=
0, v
1
=
v
2
=
0. In the proposed solving algorithm, we set the initial values t
0
=
T, λ
1
(
T
)
=
9, μ
1
(
T
)
=
-
1, and μ
2
(
t
)
=
-
9 and the step length κ
=
0.001; then we can know that t
=
t
0
-
χ
κ, where χ is the cycle number.Solving the optimal control problem by Matlab Toolbox yields that whenχ
=
105, the variable tactics occur, and the corresponding time is Δ
1
=
0.384; then it is easy to get that the optimal tactics of X are
(29)
ϕ
1
1
e
k
(
t
)
=
1
,
ϕ
1
2
e
k
(
t
)
=
0
,
0
<
t
≤
Δ
1
,
ϕ
1
1
e
k
(
t
)
=
0
,
ϕ
1
2
e
k
(
t
)
=
1
,
Δ
1
<
t
≤
T
.
So the discrete event variable is e
1
=
{
Φ
e
0
,
Φ
e
1
}, where Φ
e
0
=
[
1
0
]; Φ
e
1
=
[
0
1
]. Therefore, the solution of optimal control problem in a (
2,1
) battle can be gotten as follows. X has a variable tactic in Δ
1
=
0.384, and the optimal tactics Φ
e
s
* for X satisfy
(30)
ϕ
1
1
e
0
*
(
t
)
=
1
;
ϕ
1
2
e
0
*
(
t
)
=
0
,
0
<
t
≤
Δ
1
,
ϕ
1
1
e
0
*
(
t
)
=
0
;
ϕ
1
2
e
1
*
(
t
)
=
1
,
Δ
1
≤
t
≤
T
.
And the route of variable tactic r
=
(
(
0
,
e
0
)
,
…
,
(
Δ
1
,
e
1
)
), and the optimal value of J is J
*
=
44.152.Figure2 shows the change of state trajectories of the units on both warring sides. It is easy to see that the state values change in t
=
Δ
1; meanwhile, the state changes are nonnegative, and the change of variable tactics always holds in the time interval [
0
,
T
].Figure 2
Strength change curves of each combat unit on both sides.


## 4. Conclusions

In this paper, we established a class of warfare hybrid dynamic systems based on Lanchester equation in a battle between an attacker with one type of force and a defender withn types of forces. For the attacking side, an optimal control problem of warfare hybrid dynamic system in a (
n
,
1
) battle was investigated. Then the optimum condition and the solving method about the game problem are given. Simulation results illustrate the effectiveness of proposed optimal strategies. This is of great significance in analyzing quantitatively military actions. However, the proposed warfare hybrid dynamic model in this paper fails to consider the warfare dynamic process in a (
n
,
m
) battle, in which an attacker has m type of forces and a defender has n types of forces. Thus, constructing a more reasonable model and employing advanced control techniques to investigate the warfare dynamic game problem in a (
n
,
m
) battle are our future research directions.



---

*Source: 481347-2014-04-03.xml*