Nomenclature
-
$a$
-
acceleration
-
$R$
-
relative distance
-
${t_f}$
-
terminal time
-
${t_{go}}$
-
time-to-go
-
${u_{\rm{N}}}$
-
control input normal to initial line-of-sight
-
$V$
-
velocity
-
$y$
-
distance normal to initial line-of-sight
-
$z$
-
observer state
-
${Z_{{\rm{AT}}}}$
-
zero-effort miss
-
${Z_{\rm{L}}}$
-
zero-effort line-of-sight angle
-
$\lambda $
-
line-of-sight angle
-
$\gamma $
-
path angle
-
$\varphi $
-
state transition variable
-
$\tau $
-
time constant
-
$\varepsilon $
-
prescribed performance state
1.0 Introduction
As countries attach importance to aircraft penetration technology and establish anti-aircraft defense systems, single aircraft adopt traditional penetration strategies [Reference Xiong, Wang, Liu, Wang and Chen1, Reference Wang, Fu, Fang, Zhu, Wu and Wang2], such as flares and chaff, which aren’t able to guarantee the aircraft’s survival. Therefore, the cooperative penetration of multiple aircraft based on the framework of three-player conflict [Reference Asher and Matuszewski3], including an attacker, a defender and a target, has become one of the feasible countermeasures [Reference Faruqi4]. The cooperation of multiple aircraft increases the success rate of penetration, coping with the complex battlefield environment and accomplishing tasks that cannot be completed by a single aircraft.
Cooperative guidance strategies [Reference Isaacs5–Reference Cheng and Yuan15] were proposed to study the three-player conflict problem according to the differential game theory. The theory of differential games was developed by the American scholar Isaacs [Reference Isaacs5] to address the problem of dynamic games involving two or more players in conflict. Cooperative linear quadratic differential game (CLQDG) guidance strategies were presented and the solutions for the differential game were given by Perelman et al. [Reference Perelman, Shima and Rusnak6] for continuous and discrete systems under the arbitrary-order adversaries’ dynamics. A cooperative pursuit-evasion game guidance scheme with the time-constrained was proposed in Ref. (Reference Sinha, Kumar and Mukherjee7) for the three-player conflict scenario, where the attacker was intercepted by the defender at the desired impact time to safeguard the target. Based on the framework of a three-player conflict, a cooperative active defense guidance scheme with limited observations was designed by Singh and Puduru [Reference Singh and Puduru8] to complete the mission that the attacker was pursued by multi-defender, which were visibility constrained. Liang et al. [Reference Liang, Wang, Wang, Wang, Wang and Liu9, Reference Liang, Li, Wu, Zheng, Chu and Wang10] derived the CLQDG guidance scheme to handle the three-player conflict issue that the attacker avoided the defender and hit the target with lower fuel cost and no control saturation. The problem of multi-attacker against active defense aircraft was considered by Liu et al. [Reference Liu, Dong, Li and Ren11] to devise the CLQDG strategy, which guaranteed that the multi-attacker avoided the defender and hit the target at the desired angle. Novel evasion guidance strategies based on the CLQDG theory were developed by Yan et al. [Reference Yan, Cai and Xu12] to address the issue of the target avoiding two attackers from the same direction. Tang et al. [Reference Tang, Ye, Huang, Sun and Sun13] studied the problem of the spacecraft interception game with incomplete-information and presented the switching strategies according to the CLQDG theory. The issue of robust multi-agent CLQDG and its application to cooperative guidance were investigated by Liu et al. [Reference Liu, Dong, Li and Ren14]. Cheng and Yuan [Reference Cheng and Yuan15], based on the CLQDG method, studied a new adaptive pursuit-evasion game scheme for a multi-player confrontation scenario. A novel cooperative interception guidance strategy with fast multiple model adaptive estimation was presented by Wang et al. [Reference Wang, Guo, Wang, Liu and Zhang16] to solve the issue of two pursuers intercepting an evasive target.
For three-player conflict, another research approach is cooperative line-of-sight (LOS) guidance, which was proposed by Yamasaki et al. [Reference Yamasaki and Balakrishnan17, Reference Yamasaki and Balakrishnan18] of Japan Defense University. The philosophy of the LOS guidance is that the defender remains on the LOS between the target and the attacker for the sake of intercepting the attacker. In recent years, many scholars have focused on the cooperative LOS guidance problem. A novel cooperative LOS guidance strategy was proposed by Kumar and Dwaipayan [Reference Kumar and Dwaipayan19, Reference Kumar and Dwaipayan20] based on the sliding mode control (SMC) theory to complete the combat mission of the defender intercepting the attacker and protecting the target. The approach of the input-to-state stability was utilised in Ref. (Reference Luo, Tan, Yan, Wang and Ji21) to design a cooperative LOS guidance law for the three-player conflict scenario. A three-player conflict problem was considered by Luo et al. [Reference Luo, Ji and Wang22, Reference Tan, Luo, Ji, Liao and Wu23] in three dimensions based on high-gain observers, which guaranteed that the defender maintained on the LOS of the attacker-target and intercepted the attacker. Liu et al. [Reference Liu, Wang, Li, Yan and Zhang24] presented a cooperative guidance algorithm for active defense with LOS constraint under a low-speed ratio. Based on the optimal control method, a cooperative LOS guidance strategy was proposed in Ref. (Reference Chen, Wang and Huang25) for active defense aircraft and minimised the weighted energy consumption. A type of three-dimensional trajectory approach was presented by Han et al. [Reference Han, Hu, Wang, Xin and Shin26] based on the LOS angle acceleration for aerial vehicles without range measurement. Muti-target assignment issue was analysed by Liu et al. [Reference Liu, Lin, Wei and Yan27] to provide an overview, which classified the addressing method as state multi-target assignment and dynamic multi-target assignment. By analysing the characteristic of active defense combat, Liu et al. [Reference Liu, Lin, Wang, Huang, Yan and Li28] proposed a cooperative guidance law with respective of a small speed ratio to investigate the three-player problem.
Since a two-versus-two combat involving four players enhances the diversity of battles compared to a three-player conflict, it has become a focal point of research for many scholars. A new type of cooperative guidance strategy, in which the target pair lured the pursuers into collision, was designed in Ref. (Reference Tan, Fonod and Shima29) by virtue of the optimal control theory for the two-on-two engagement scenario. Based on the above research, a nonlinear model predictive control approach was used by Manoharan and Sujit [Reference Manoharan and Sujit30] to present a cooperative defense strategy for the scenario of luring two attackers into a collision. Liang et al. [Reference Liang, Wang, Liu and Liu31] proposed the cooperative guidance scheme in a two-on-two engagement scenario where the interceptor pursued an active defense spacecraft with the assistance of a protector capturing the defender.
The prescribed performance control (PPC) is a robust method for controlling systems with defined performance objectives. It limits overshoot and maintains stability of the state variable performance. In Ref. (Reference Zhuang, Tan, Li and Song32), a spacecraft formation scheme was investigated by Zhuang et al. by taking the input saturation and prescribed performance constraints into account. Truong et al. [Reference Truong, Vo and Kang33] employed the SMC approach to propose a fixed-time control strategy with prescribed performance for robots. A new type of prescribed performance function (PPF) was studied in Ref. (Reference Zhang, Wu, Yang and Song34) to design the PPC scheme under the constraint of input saturation, which solved the collision obstacle of the spacecraft formation. The guidance issue of the attacker intercepting a stationary target was considered by Li et al. [Reference Li, Liu, Li and Liang35] to devise a guidance law requiring field-of-view and impact-angle. However, the existing literature primarily examines spacecraft formation and robot control, with limited research on the PPC of multi-aircraft cooperative guidance.
In this paper, a cooperative LOS guidance scheme is designed with prescribed performance and input saturation in a two-on-two engagement by virtue of the SMC method, including an attacker, a protector, a defender, and a target, which guarantees that the attacker hits the target when the protector maintains on the LOS between the defender and the attacker to intercept the defender. As depicted in Fig. 1, the attacker and the protector collaborate to defeat the attacker-defender team and accomplish the combat mission. The main contributions of this paper are as follows:
-
1) Zero-effort miss (ZEM) and zero-effort LOS angle (ZEL) are utilised to design a novel cooperative LOS guidance strategy in the two-on-two engagement. The performance of the guidance strategy is improved since once on the sliding surface, guidance command isn’t needed to guarantee the interception in the nominal case with perfect modelling. In contrast to Refs (Reference Kumar and Dwaipayan19, Reference Kumar and Dwaipayan20), the guidance scheme that does not include the sign function is not affected by the chattering phenomenon.
-
2) Compared to the traditional PPC, a fixed-time PPF is designed to limit the overshoot of the guidance variable, using dual PPFs for upper and lower boundaries to improve stability and symmetry.
-
3) The proposed guidance scheme is able to satisfy the overload requirements of the attacker and the protector employing a first-order anti-saturation auxiliary variable during the engagement.
-
4) A novel fixed-time disturbance observer is proposed to estimate the unknown disturbance in the guidance system, weakening the influence of unknown disturbance.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_fig1.png?pub-status=live)
Figure 1. The relationship of two-on-two engagement.
The paper is organised as follows: Section 2 elaborates on the preliminaries, including nonlinear models, linear models and order reduction of the system in the two-on-two engagement scenario. The development process of the cooperative guidance strategy is given in Section 3, composed of the fixed-time PPF design, the fixed-time observer design, and the first-order anti-saturation auxiliary variable design. The cooperative guidance strategy is validated in Section 4 through nonlinear numerical simulations.
2.0 Preliminaries
The engagement relationship of each player in the two-on-two scenario is shown in Fig. 1. The problem involves four players: an attacker, a protector, a defender and a target. When the target detects the attacker, it deploys a defender to intercept the attacker in order to ensure its escape. In response, the attacker deploys a protector to attack the defender, increasing the chance of the attacking aircraft successfully intercepting the target. The purpose of the guidance strategy is for the attacker to intercept the target, while the protector remains on the line of sight between the defender and the attacker to intercept the defender.
2.1 Nonlinear kinematics
As shown in Fig. 2, the LOS angles and the flight path angles of each player are respectively represented as
$ {\lambda _j},{\rm{ }}j \in \left\{ {{\rm{AT}},{\rm{ AD}},{\rm{ PD}}} \right\} $
and
$ {\gamma _i},{\rm{ }}i \in \left\{ {{\rm{A}},{\rm{ P}},{\rm{ D, T}}} \right\} $
. The velocities and the accelerations of each player are defined as
$ {V_i} $
and
$ \left\{ {{\rm{A}},{\rm{ P}},{\rm{ D, T}}} \right\} $
, respectively. The relative distances between the players are described as
$ {R_j},{\rm{ }}j \in \left\{ {{\rm{AT}},{\rm{ AD}},{\rm{ PD}}} \right\} $
.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_fig2.png?pub-status=live)
Figure 2. Two-on-two engagement scenario.
The nonlinear kinematics of the players are respectively given as follows.
The closing velocities are represented as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn1.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn2.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn3.png?pub-status=live)
The rates of LOS angles are
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn4.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn5.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn6.png?pub-status=live)
It is assumed that the dynamics of each player are arbitrary-order linear equations.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn7.png?pub-status=live)
The dynamics of the flight path angles are given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn8.png?pub-status=live)
Define the LOS angle between
$ {\rm{LO}}{{\rm{S}}_{{\rm{AD}}}} $
and
$ {\rm{LO}}{{\rm{S}}_{{\rm{PD}}}} $
as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn9.png?pub-status=live)
2.2 Linear kinematics
Suppose that the scene is located near the collision triangle, the velocities
$ V_{i}, i \in \left\{ {{\rm{A}},{\rm{P}},{\rm{D,T}}} \right\} $
, and the initial LOS angles
$ \lambda_{i0}, i \in \left\{ {{\rm{AT}},{\rm{AD}},{\rm{PD}}} \right\}$
are small to linearise the models (1)–(6) near the initial LOS in Fig. 3. The initial
$ {\rm LOS}_{i0}, i \in \left\{ {{\rm{AT}},{\rm{AD}},{\rm{PD}}} \right\}$
are parallel with the axis
$ X $
. It is defined that
${y_{{\rm{AT}}}}, {y_{{\rm{AD}}}} $
and
$ {y_{{\rm{PD}}}} $
are respectively expressed as the displacement of the target normal to initial line-of-sight
$ {\rm{LO}}{{\rm{S}}_{{\rm{A}}{{\rm{T}}_0}}} $
; the displacements of the defender normal to initial line-of-sight
$ {\rm{LO}}{{\rm{S}}_{{\rm{A}}{{\rm{D}}_0}}} $
and
$ {\rm{LO}}{{\rm{S}}_{{\rm{P}}{{\rm{D}}_0}}} $
. The accelerations and control inputs of the players perpendicular to the initial LOS are respectively represented as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn10.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_fig3.png?pub-status=live)
Figure 3. Comparison between the proposed and the other PPFs.
where, the initial LOS angles of the players are expressed as
$ {\lambda _0} $
. The subscript 0 indicates the initial state of each player.
The terminal time of engagement among the players can be calculated by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn11.png?pub-status=live)
where,
${R_j}$
and
${V_{{R_j}}}$
,
$j \in \left\{ {{\rm{AT, AD, PD}}} \right\}$
are the relative distances and the closing velocities between the attacker-protector team and the defender-target team.
The time-to-go between the attacker and the target, between the attacker and defender, and between the protector and the defender is
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn12.png?pub-status=live)
Differentiate the linearised form of equation (9) to obtain Equation (13) [Reference Chen, Wang and Huang25].
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn13.png?pub-status=live)
Let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn14.png?pub-status=live)
According to the above definition, (13) is rewritten as follow.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn15.png?pub-status=live)
Select the following state of the linearised engagement:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn16.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn17.png?pub-status=live)
wherein, the dimensions of
$ \boldsymbol{{x}} $
and
$ {\boldsymbol{{x}}_{{\rm{AD}}}} $
are
$ {n_{\rm{A}}} + {n_{\rm{T}}} + {n_{\rm{D}}} + {n_{\rm{P}}} + 7 $
and
${n_{\rm{A}}} + {n_{\rm{D}}} + 2 $
, respectively.
Equation (18) is able to be obtained by differentiating the state variable
$ x $
with respect to time.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn18.png?pub-status=live)
Assume that the linear guidance strategy is adopted by the defender. The specific form of the linear guidance strategy is represented as follows:
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn19.png?pub-status=live)
According to the above definitions, the equation of the state space is written as follows.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn20.png?pub-status=live)
where,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqnU1.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqnU2.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqnU3.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqnU4.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqnU5.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqnU6.png?pub-status=live)
2.3 Order reduction
In order to lower the complexity of the combat issue, ZEM [Reference Shima, Idan and Golan36] and ZEL are introduced to reduce the system order, which means the miss distance and LOS angle if none of the adversaries in engagement apply any control from the current time onward. The ZEM between the attacker and the target is expressed as
${Z_{{\rm{AT}}}}$
. The ZEL between
$ {\rm{LO}}{{\rm{S}}_{{\rm{AD}}}} $
and
$ {\rm{LO}}{{\rm{S}}_{{\rm{PD}}}} $
is expressed as
${Z_{\rm{L}}}$
according to (9) and (15).
The zero-effort quantities
$Z_{i}, i \in \left\{ {{\rm{AT, L}}} \right\}$
are acquired by virtue of the terminal projection transformation [Reference Bryson and Ho37].
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn21.png?pub-status=live)
wherein,
${\boldsymbol{{D}}_i},i \in \left\{ {{\rm{AT, L}}} \right\}$
are given by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqnU7.png?pub-status=live)
$\boldsymbol{\phi} $
is the state transition matrix of the state space equation (20)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqnU8.png?pub-status=live)
and satisfies
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn22.png?pub-status=live)
The following equations are derived according to the above definitions.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn23.png?pub-status=live)
Equation (21) can be rewritten by virtue of
$ \boldsymbol{\phi} $
and
$\boldsymbol{{A}}$
.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn24.png?pub-status=live)
where,
$ \varphi_{1, j}, j \in \left\{ {1,2, \cdots, 11} \right\} $
are the matrix elements in the first line of the state transition matrix
$ \boldsymbol{\phi} ({t_{f{\rm{AT}}}},t) $
;
$ \varphi_{11, j}, j \in \left\{ {1,2, \cdots, 11} \right\} $
are the matrix elements in the eleventh line of the state transition matrix
$ \boldsymbol{\phi} ({t_{f{\rm{PD}}}},t) $
.
2.4 Nonlinear form of zero-effort quantities
From (21), the expressions of the ZEM and the ZEL are represented as follows.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn25.png?pub-status=live)
wherein,
$i \in \left\{ {{\rm{AT, L}}} \right\},$
$j \in \left\{ {1,{\rm{ }}11} \right\}$
.
The following assumption is imposed in order to give the nonlinear form of the zero-effort quantities.
Assumption 1. First-order strictly proper dynamics with time constants
$ \tau_{i}, i \in \left\{ {{\rm{A}},{\rm{P}},{\rm{D,T}}} \right\} $
for the attacker, the protector, the defender and the target are defined as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn26.png?pub-status=live)
Equation (27) is obtained according to Ref. (Reference Kumar and Shima38).
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn27.png?pub-status=live)
where,
${V_{{\lambda _i}}}$
predefined in (4)-(6) is the relative velocity normal to the initial LOS and
${t_{goi}}$
predefined in (12) represents the time-to-go between the attacker-protector team and the defender-target team.
(25) is written as Equation (28) and Equation (29) under Assumption 1.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn28.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn29.png?pub-status=live)
where,
$\hat{\varphi}_{l,j} = \hat{\varphi}_{l,j}/\chi_{i}, i \in \{ {\rm A, P, D, T}\}, l \in \{1, 11\}, j \in \left\{ {3,4,7,10} \right\}$
.
On differentiating (28) and (29), utilising the chain rule of differentiation and collecting similar terms, we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn30.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn31.png?pub-status=live)
wherein, the dynamics
$ {\dot \varphi }_{i,j}, i \in \{1, 11\}, j \in \left\{ {3, \cdots, 10} \right\} $
of the state transition matrices are given in (24).
$ {\dot a_{i{\rm{N}}}}, $
$ i \in \left\{ {{\rm{A}},{\rm{P}},{\rm{D,T}}} \right\} $
are the acceleration dynamics of each player and satisfy
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn32.png?pub-status=live)
$ {\tau _i} $
is a predefined time constant of each player,
$ {d_i} $
is a dynamic error of the system and external disturbance, and satisfies
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn33.png?pub-status=live)
where, the upper bound of the dynamics error
$ {d_i} $
is defined as
$ {d_{iM}} $
.
Take the time derivative of the nonlinear kinematics (1)–(6) and time-to-go (12) to yield the following equations (34)–(37).
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn34.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn35.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn36.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn37.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn38.png?pub-status=live)
Bringing equations (34)–(38) into (30) and (31), the following equations are obtained.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn39.png?pub-status=live)
wherein,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqnU9.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqnU10.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn40.png?pub-status=live)
wherein,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqnU11.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqnU12.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqnU13.png?pub-status=live)
3.0 Design process of cooperative guidance scheme
3.1 Fixed-time PPF design
The dynamics of ZEM and ZEL are introduced in the previous section. In this subsection, we design novel PPFs for the upper and lower boundaries, inspired by Ref. (Reference Truong, Vo and Kang33), to enhance the performance of the guidance scheme and compare it with other PPFs.
The upper boundary of the PPF is
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn41.png?pub-status=live)
The lower boundary of the PPF is
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn42.png?pub-status=live)
According to the proposed PPFs given in (41) and (42), the predefined range of the ZEM and ZEL is
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn43.png?pub-status=live)
where,
${\rho _{ui}}(t)$
and
${\rho _{li}}(t)$
are smooth and continuous functions, which satisfy
$\mathop {\lim }\limits_{t \to {T_{di}}} {\rho _{ui}}(t) = {\rho _{\infty i}}$
and
$\mathop {\lim }\limits_{t \to {T_{di}}} {\rho _{li}}(t) = {\rho _{\infty i}}$
.
${\rho _{\infty i}}$
is the desired convergence boundary within a fixed-time period
${T_{di}}$
,
${\rho _{0i}} \gt $
${\rho _{1i}} \gt {\rho _{\infty i}} \gt 0$
,
${b_i} = {y_1} - {y_2}\cos \!({t\pi }/ T_{di})$
, the positive constants
${y_1}$
and
${y_2}$
satisfy
$0.5 \le {y_1} - {y_2} \lt 1$
,
$0.5 \le {y_1} + {y_2} \lt 1$
. And
$0 \lt \left| {{Z_i}(0)} \right| \lt {\rho _{ui}}(0)$
is assumed.
Taking the derivative of the PPFs given in (41) and (42), we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn44.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn45.png?pub-status=live)
Remark 2. The traditional PPF in Ref. (Reference Ma, Zhou, Li and Lu39) is designed as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn46.png?pub-status=live)
where,
${\rho _1} = 3,$
${\rho _{0i}} = 5.17,$
${\rho _{\infty i}} = 0.1$
. The comparison between the novel PPFs given in (41), (42) and the traditional PPF given in (46) is performed in Fig. 3 to illustrate the advantages of the novel PPFs. It can be seen from Fig. 3 that, compared with the traditional PPF, novel PPFs have a better convergence effect since the traditional PPF includes one function to form a performance boundary. The performance region is not symmetric about zero for the upper boundary
${\rho _{ui}}$
and the lower boundary
$\delta {\rho _{li}}$
,
$0 \lt \delta \lt 1$
, which greatly affects the convergence accuracy.
Remark 3. The specific form of the fixed-time PPF, which the recently proposed in Ref. (Reference Zhuang, Tan, Li and Song32), is
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn47.png?pub-status=live)
where,
${\rho _2} = 5.17,$
${\rho _3} = 1.23,$
$\alpha = 0.21,$
$\beta = 1.3$
,
${\rho _{0i}} = 5.17,$
${\rho _{\infty i}} = 0.1$
. Similarly, Fig. 3 demonstrates the effectiveness of the novel PPFs by comparing them with fixed-time PPF (47). The convergences of the upper and lower boundaries are guaranteed based on the fixed-time PPF. However, the chattering phenomenon influences the performance of the fixed-time PPF due to the existence of the sign function. The fixed-time upper boundary isn’t determined flexibly since the desired convergence period isn’t included in fixed-time PPF (47).
A transformation function is employed to convert the ZEM and ZEL, which is defined as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn48.png?pub-status=live)
where,
${k_{{\varepsilon _i}}} \gt 0$
,
$0 \le {\delta _{{\varepsilon _i}}} \le 1$
are the positive constant,
${E_i}({\varepsilon _i})$
is the transformation function, and satisfies
$ - 1 \lt {E_i}({\varepsilon _i}) \lt 1$
,
${\varepsilon _i}$
,
$i \in \left\{ {{\rm{AT}},{\rm{ L}}} \right\}$
are the transformed variables.
Based on equation (48), we obtain
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn49.png?pub-status=live)
And the transformation function (50) is devised based on equations (48)–(49).
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn50.png?pub-status=live)
The equation (51) is yielded according to equations (48) and (50).
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn51.png?pub-status=live)
Taking the inverse of equation (51) and multiplying it by
$1/k_{\varepsilon_{i}}$
, we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn52.png?pub-status=live)
Differentiate equation (52) to yield the following equation (53).
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn53.png?pub-status=live)
Substituting equations (39) and (40) into (53), we acquire
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn54.png?pub-status=live)
where,
${N_i}(t) = \frac{\pi }{{{k_{{\varepsilon _i}}}(1 + {\delta _{{\varepsilon _i}}})\rho _i^2(t){{\cos }^2}\left( {\frac{{2\pi {Z_i}(t) + \pi ({\delta _{{\varepsilon _i}}} - 1){\rho _i}(t)}}{{2(1 + {\delta _{{\varepsilon _i}}}){\rho _i}(t)}}} \right)}}$
,
${d_{i1}} = {N_i}{\rm{(}}t){\rho _i}{\rm{(}}t){d_i}$
.
3.2 Fixed-time disturbance observer design
In the guidance system, the external disturbance given in (54) consists of the players’ dynamic errors and PPF variable. Thus, a new disturbance observer is proposed to reduce the impact of the external disturbance on the guidance system.
Assumption 2.
$ {d_{i1}} $
of (54) is differentiable and bounded. Therefore, we suppose that it satisfies
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqnU14.png?pub-status=live)
wherein,
$ {d_{i1M}} $
is the upper bound of
$ {d_{i1}},{\rm{ }}i \in \left\{ {{\rm{AT, L}}} \right\} $
.
Theorem 1. Considering the system described by (54), the fixed-time disturbance observer (55) is designed to estimate the unknown disturbance of the system within a fixed-time
${T_z}$
.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn55.png?pub-status=live)
wherein,
$ e_{i} = Z_{1i} - \varepsilon_{i}, p \gt 1, {v_1} \gt \sqrt {2{v_2}} $
and
${v_3} \gt 4{d_{i1M}}$
are constants,
$\left\| \bullet \right\|$
is the Euclidean norm of vector or the induced norm of matrix.
Proof. Differentiate
${e_i} = {z_{1i}} - {\varepsilon _i},{\rm{ }}i \in \left\{ {{\rm{AT, L}}} \right\}$
to obtain (56).
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn56.png?pub-status=live)
Let
${\tilde z_i} = {z_{2i}} - {d_{i1}}$
, and take the derivative with respect to time to yield (57).
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn57.png?pub-status=live)
And these completed the proof.
According to Assumption 2 and Ref. (Reference Michael, Chandrasekhara and Yuri40),
${e_i}$
and
${\tilde z_i}$
converge to zero within a fixed time, and the settling time
${T_z}$
is bounded by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn58.png?pub-status=live)
wherein,
$ v = (v_{1}/v_{2})^{1/(p+1/2)}$
. Based on the definition of
${\tilde z_i}$
,
${z_{2i}}$
converges to
${d_{i1}},$
${\rm{ }}i \in $
$\left\{ {{\rm{AT,}}} \right.$
$\left. {\rm{L}} \right\}$
.
3.3 Cooperative guidance strategy design
In this subsection, a cooperative guidance strategy with a protection role, considering the anti-saturation condition, is proposed based on the fixed-time SMC theory to reduce the
${Z_{{\rm{AT}}}}$
and
${Z_{\rm{L}}}$
. It is meaningful to study an anti-saturation cooperative guidance strategy since the accelerations of the attacker and the protector are bounded in practical combat.
Lemma 1. [Reference Zou and Tie41] Let
${x_1},{x_2}, \ldots, {x_n} \geqslant 0$
, and
$0 \lt \xi \le 1$
. Then
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn59.png?pub-status=live)
Based on the above analysis, (54) can be rewritten as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn60.png?pub-status=live)
where,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqnU15.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqnU16.png?pub-status=live)
$sat({u_i})$
is a saturated function to be devised as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn61.png?pub-status=live)
Let
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn62.png?pub-status=live)
Define the sliding mode surface as
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn63.png?pub-status=live)
where,
$\boldsymbol{\Xi} = {\left[ {\begin{array}{*{20}{c}}{\frac{{({\delta _{{\varepsilon _{{\rm{AT}}}}}} - 1)\pi }}{{2({\delta _{{\varepsilon _{{\rm{AT}}}}}} + 1)}}} {}{\frac{{({\delta _{{\varepsilon _{\rm{L}}}}} - 1)\pi }}{{2({\delta _{{\varepsilon _{\rm{L}}}}} + 1)}}}\end{array}} \right]^{\rm{T}}}$
.
Choose the following fixed-time reaching law in Ref. (Reference Zhang, Dong and Zhang42) to weaken the chattering phenomenon caused by the sign function.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn64.png?pub-status=live)
where,
$ {p_1} \gt 1 $
,
${\theta _1} \gt \sqrt {2{\theta _3}}, $
and
$ {\theta _2} \gt 0 $
are positive constants. The sliding mode manifold
$ \boldsymbol{{S}} $
converges to zero in a fixed-time, and the settling time is bounded by
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn65.png?pub-status=live)
where,
$\theta = (\theta_{1}/ \theta_{2})^{1/(P_{1} + 1/2)}$
.
Theorem 2. For the system (60) with the acceleration constraint of the target and the defender, and based on the disturbance observer designed in (55) and the first-order fixed-time anti-saturation auxiliary variable
$ \boldsymbol{\eta} $
, the cooperative guidance strategy (66) is proposed to ensure that the sliding surface
$ \boldsymbol{{S}}$
converges to zero within a fixed-time under Assumptions 1 and 2.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn66.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqnU17.png?pub-status=live)
where,
$z = {\left[ {\begin{array}{l@{\quad}l}{{Z_{{\rm{2AT}}}}} & {}{{Z_{2{\rm{L}}}}}\end{array}} \right]^{\rm{T}}}$
is the fixed-time observer state given in (55).
Proof. The following Lyapunov function is given to prove the Theorem 2.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn67.png?pub-status=live)
Differentiating the
$V$
with respect to time and substituting (60) and
$ \boldsymbol{\dot{\eta}}$
, we get
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn68.png?pub-status=live)
In light of Young’s inequality,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn69.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn70.png?pub-status=live)
(68) is able to be written as following inequations based on the above analysis and Lemma 1.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn71.png?pub-status=live)
where,
${k_{\eta 3}}$
are positive constants. According to the above analysis, the boundary of the total settling time
${T_r} = {T_{{r_1}}} + {T_{{r_2}}} + {T_z}$
is
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn72.png?pub-status=live)
where,
${k_{\eta 4}} = {({{{k_{\eta 1}}} \mathord{\left/{\vphantom {{{k_{\eta 1}}} {{k_{\eta 2}}}}} \right.} {{k_{\eta 2}}}})^{{1 \mathord{\left/{\vphantom {1 {({{{p_1} + 1} \mathord{\left/{\vphantom {{{p_1} + 1} 2}} \right.} 2})}}} \right.} {({{{p_1} + 1} \mathord{\left/{\vphantom {{{p_1} + 1} 2}} \right.} 2})}}}}$
.
Based on the above derivations and equation (63), the sliding surface converging to zero is proven to yield equation
$\boldsymbol{\varepsilon} = \frac{1}{{{k_\gamma }}}\tan (\Xi )$
. The prescribed performance function variable
$\boldsymbol{\varepsilon} \le \boldsymbol{0}$
is concluded by choosing the parameters
${k_\gamma } \gt 0$
and
$0 \le {\delta _{{\varepsilon _i}}} \le 1$
,
$i \in \left\{ {{\rm{AT, L}}} \right\}$
since
$\tan ({\bullet})$
is the increasing function. Therefore, the state variables
${Z_i}$
,
$i \in \left\{ {{\rm{AT, L}}} \right\}$
converge to zero and satisfy the prescribed performance constraint.
And these completed the proof.
It can be indicated that the ZEM between the attacker and the target, and the ZEL between
$ {\rm{LO}}{{\rm{S}}_{{\rm{AD}}}} $
and
$ {\rm{LO}}{{\rm{S}}_{{\rm{PD}}}} $
are reduced to zero according to the definition of sliding surface
$ \boldsymbol{{S}} $
. Therefore, the protector remains on the LOS between the defender and the attacker to intercept the defender.
Based on Ref. (Reference Sun, Qi and Hou43), the target adopts the following optimal avoidance guidance law to evade the interception of the attacker.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn73.png?pub-status=live)
where,
${\hat \varphi _{1,3}}$
,
${\tau _{\rm{T}}}$
and
${Z_{{\rm{AT}}}}(t)$
are predefined in (24) (26) and (28),
$u_{{\rm{TN}}}^{\max }$
is the maximum manoeuver of the target.
Remark 4. The LOS guidance strategy proposed in this paper is a cooperation between the attacker and the protector against the defender-target team to reduce ZEM and ZEL while maintaining a stable communication connection. The development of the LOS guidance strategy, which controls the convergence of the LOS angle from a specific side (the attacker or the protector), can be inspired according to the design process of the cooperative LOS guidance strategy. For example, when the protector controls the LOS angle, the ZEL and the derivative are rewritten as
$ {Z_{{\rm{PL}}}} = {Z_{\rm{L}}} + \int_t^{{t_{f{\rm{PD}}}}} {\frac{{{{\hat \varphi }_{11,4}}(\varepsilon )}}{{{\tau _{\rm{A}}}}}{u_{{\rm{AN}}}}(\varepsilon ){\rm{d}}\varepsilon } $
and
$ {\dot Z_{{\rm{PL}}}} = {F_{\rm{L}}} + \frac{{{{\hat \varphi }_{11,10}}}}{{{\tau _{\rm{P}}}}}{u_{{\rm{PN}}}} + {d_{\rm{L}}} $
. By virtue of the SMC theory, the guidance scheme of the protector controlling the LOS angle is able to be devised for the above ZEL system.
4.0 Simulations
The feasibility and superiority of the cooperative guidance strategy (66) are illustrated by nonlinear numerical simulation in this section. The information required for the participants’ guidance scheme is assumed to be obtained by sensors onboard. The defender adopts the proportional navigation guidance law to intercept the attacker in the nonlinear simulations.
4.1 Simulation of the cooperative guidance scheme
The cooperative LOS guidance scheme (66) is verified in this subsection, which describes that the protector remains on the LOS between the defender and the attacker and intercepts the defender. The simulation parameters are listed in Table 1.
The parameters of (66) are separately chosen as
$ {\theta _1} = 3.7,{\rm{ }}{\theta _2} = 3.7,{\rm{ }}{\theta _3} = 3.05,{\rm{ }}{k_\gamma } = 0.1, $
$ {k_\eta } = 0.001, $
${\rm{ }}{k_{\eta 1}} = 0.6,$
${k_{\eta 2}} = 2.05,$
${k_{\eta 3}} = 5.05,$
${k_{\eta 4}} = 0.11,$
${p_1} = 1.5,$
$u_{{\rm{AN}}}^{\max } = 150{\rm m}/{\rm s}^{2}, u_{{\rm{PN}}}^{\max } = 150{\rm m}/{\rm s}^{2}, u_{{\rm{TN}}}^{\max } = 170{\rm m}/{\rm s}^{2}$
; the prescribed performance parameters of (66) are respectively selected as
${\rho _{0{\rm{AT}}}} = 465.17,$
${\rho _{{\rm{1AT}}}} = 465.05,\ \rho _{\infty {\rm{1AT}}} = 0.5$
,
${\rho _{{\rm{1AT}}}} = 465.05,$
${y_1} = 0.8,$
${y_2} = 0.1,$
${\rho _{0{\rm{L}}}} = 3.71,$
${\rho _{{\rm{1L}}}} = 3.75,$
${\rho _{\infty {\rm{L}}}} = 0.01,$
${T_{d{\rm{AT}}}} = {T_{d{\rm{L}}}} = 3.26{\rm{s}},$
${k_\gamma } = 15,$
${\delta _{{\varepsilon _{{\rm{AT}}}}}} = {\delta _{{\varepsilon _{\rm{L}}}}} = 1.$
The parameters of the fixed-time disturbance observer designed in (55) are
$ {v_1} = 15,{v_2} = 22,{v_3} = 0.001,p = 1.2 $
. Without loss of generality, the initial values of the observer are given as zero.
The engagement trajectories of the players for the guidance strategy (66) are shown in Fig. 4. As can be seen from Fig. 4, the attacker is able to capture the target with the assistance of the protector intercepting the defender, which demonstrates that the engagement purpose is achieved.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_fig4.png?pub-status=live)
Figure 4. Trajectories of the guidance strategy (66).
Figures 5 and 6 indicate the time evolutions of the zero-effort quantities
${Z_i}$
,
$i \in \left\{ {{\rm{AT, L}}} \right\}$
. It can be seen from Fig. 5 that the ZEM
${Z_{{\rm{AT}}}}$
increases and converges to 0m in the upper boundary of the convergence time
${T_r} = {\rm{3}}{\rm{.6369s}}$
, which illustrates that the target is intercepted by the attacker;
${\rho _{u{\rm{AT}}}}$
and
${\rho _{l{\rm{AT}}}}$
converge to
${\rho _{\infty {\rm{AT}}}}$
in a fixed-time boundary
${T_{d{\rm{AT}}}} = 3.26{\rm{s}}$
. Based on Fig. 6, the phenomenon that the ZEL
${Z_{\rm{L}}}$
converges to 0
$\deg $
in the upper boundary of the convergence time
${T_r} = {\rm{3}}{\rm{.6369s}}$
is observed to demonstrate that the protector maintains on the LOS of the defender-attacker and captures the defender to guard the attacker.
${\rho _{u{\rm{L}}}}$
and
${\rho _{l{\rm{L}}}}$
converge to
${\rho _{\infty {\rm{L}}}}$
in a fixed-time boundary
${T_{d{\rm{L}}}} = 3.26{\rm{s}}$
, which ensures the prescribed performance of the cooperative guidance strategy.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_fig5.png?pub-status=live)
Figure 5. ZEM between the attacker and the target.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_fig6.png?pub-status=live)
Figure 6. ZEL between the protector and the attacker-defender.
The variation tendencies of fixed-time observer states
${z_{2i}},{\rm{ }}i \in \left\{ {{\rm{AT}},{\rm{L}}} \right\}$
with respect to time are illustrated in Fig. 7. Note that the states
${z_{{\rm{2AT}}}}$
and
${z_{{\rm{2L}}}}$
decrease and converge to 0 in the upper boundary of the convergence time
${T_z}{\rm{ = 1}}{\rm{.8535s}}$
. Based on Theorem 1, the fixed-time observer eliminates the external disturbance to improve the performance of the guidance system, according to Fig. 7.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_fig7.png?pub-status=live)
Figure 7. Fixed-time observer state
${z_{2i}},{\rm{ }}i = {\rm{AT}},{\rm{L}}$
.
The simulation results of the attacker-protect team’s accelerations
${a_{\rm{P}}}$
and
${a_{\rm{A}}}$
with time are shown in Fig. 8. It is worth noting from Fig. 8 that the acceleration
${a_{\rm{P}}}$
increases and converges to
$0{\rm{m/}}{{\rm{s}}^2}$
, and satisfies the constraint of the control input saturation. The attacker’s acceleration
${a_{\rm{A}}}$
reduces and converges to
$0{\rm{m/}}{{\rm{s}}^2}$
, and meets the requirement of control input. The combat mission is completed according to the variation of the accelerations.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_fig8.png?pub-status=live)
Figure 8. The accelerations of the attacker-protector team.
Figures 9 and 10 illustrate the time evolutions of
${a_{\rm{A}}}$
and
${a_{\rm{P}}}$
for different
$u_{\rm{A}}^{\max }$
and
$u_{\rm{P}}^{\max }$
, which demonstrate that the accelerations
${a_{\rm{A}}}$
and
${a_{\rm{P}}}$
satisfy the input saturation constraint and converge to
$0{\rm m}/{\rm s}^{2}$
for for different
$u_{\rm{A}}^{\max }$
and
$u_{\rm{P}}^{\max }$
.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_fig9.png?pub-status=live)
Figure 9. The acceleration
${a_{\rm{A}}}$
for different
$u_{\rm{A}}^{\max }$
.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_fig10.png?pub-status=live)
Figure 10. The acceleration
${a_{\rm{P}}}$
for different
$u_{\rm{P}}^{\max }$
.
4.2 Comparison studies
The following scenarios are established to compare with the other guidance schemes in order to validate the superiority of the guidance strategy.
Case 1.
To illustrate the LOS guidance approach, the guidance schemes in Refs (Reference Kumar and Dwaipayan19–Reference Luo, Tan, Yan, Wang and Ji21) are compared to the proposed guidance strategy. In Case 1, the engagement of the attacker intercepting the target is ignored for better comparison since the guidance schemes in Refs (Reference Kumar and Dwaipayan19–Reference Luo, Tan, Yan, Wang and Ji21) are presented based on the three-player conflict scenario. Define the LOS angle error between the attacker-protector and the defender as
$e = {\lambda _{{\rm{PD}}}} - {\lambda _{{\rm{AD}}}}$
.
The specific form of the guidance strategy in Refs (Reference Kumar and Dwaipayan19, Reference Kumar and Dwaipayan20) is
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn74.png?pub-status=live)
where,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqnU18.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqnU19.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqnU20.png?pub-status=live)
The cooperative LOS guidance scheme designed in Ref. (Reference Luo, Tan, Yan, Wang and Ji21) is
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn75.png?pub-status=live)
where,
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqnU21.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqnU22.png?pub-status=live)
The simulation parameters in Case 1 are listed in Table 2.
Table 1. Simulation parameters
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_tab1.png?pub-status=live)
Table 2. Simulation parameters in Case 1
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_tab2.png?pub-status=live)
Table 3. Simulation parameters in Case 2
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_tab3.png?pub-status=live)
The parameters of the guidance strategy (66) are selected as
${\theta _1} = 4.7$
,
${\theta _2} = 1.7$
,
${\theta _3} = 4.05$
,
$ {k_\gamma } = 0.3 $
,
${k_\eta } = 0.001$
,
${k_{\eta 1}} = 0.62$
,
${k_{\eta 2}} = 2.05$
,
${k_{\eta 3}} = 3.05$
,
${k_{\eta 4}} = 0.2$
,
${p_1} = 1.5$
,
$u_{{\rm{PN}}}^{\max } = 150{\rm m}/{\rm s}^{2}$
; the prescribed performance parameters of (66) are respectively selected as
${\rho _{0{\rm{L}}}} = 6.01,$
${\rho _{{\rm{1L}}}} = 6.05$
,
${\rho _{\infty {\rm{L}}}} = 0.01,$
${y_1} = 0.7$
,
${y_2} = 0.1$
,
${T_{d{\rm{L}}}} = 2.05{\rm{s}},$
${\delta _{{\varepsilon _{{\rm{AT}}}}}} = {\delta _{{\varepsilon _{\rm{L}}}}} = 1.$
The parameter selection for the fixed-time disturbance observer is the same as in Subsection 4.1.
The guidance parameters in (74) and (75) are respectively chosen as
$C = 12$
,
$M = 0.5$
,
${\omega _{\rm{A}}} = 2$
,
${\omega _{\rm{P}}} = 3$
,
$a_{\rm{A}}^{\max } = 150{\rm m}/{\rm s}^{2}$
,
$a_{\rm{P}}^{\max } = 150{\rm m}/{\rm s}^{2} $
;
${k_1} = 1$
,
$\delta = 10$
,
$\mu = 0.68$
,
$a_{\rm{A}}^{\max } = 150{\rm m}/{\rm s}^{2} $
,
$a_{\rm{P}}^{\max } = 150{\rm m}/{\rm s}^{2} $
.
The engagement trajectories between the attacker-protector and the defender are shown in Fig. 11. The different guidance strategies are able to guarantee that the protector maintains on the LOS of the attacker-defender and intercepts the defender to guard the attacker based on Fig. 11. Compared with guidance strategies (74) and (75), the guidance scheme proposed in this paper has a better collision triangle to complete the interception mission.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_fig11.png?pub-status=live)
Figure 11. Trajectories of the guidance strategies in Case 1.
The time evolutions of the ZEL between the protector and the attacker-defender are illustrated according to Fig. 12. It can be seen from Fig. 12 that
${Z_{\rm{L}}}$
converges to
$0\deg $
faster and satisfies the prescribed performance condition more stable in contrast to
$e$
in (74) and (75), which demonstrates the superiority of the proposed guidance strategy.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_fig12.png?pub-status=live)
Figure 12. LOS angles between the protector and the attacker-defender.
The simulations in Fig. 13 compare the attacker’s accelerations over time for different guidance strategies. Based on Fig. 13, the guidance strategies (65), (73) and (74) are able to guarantee that the acceleration
${a_{\rm{A}}}$
converges to
$0{\rm m}/{\rm s}^{2}$
with respect to time. The acceleration
${a_{\rm{A}}}$
in (73) satisfies the overload requirement with no control chattering according to the first-order fixed-time anti-saturation auxiliary variable. The acceleration
${a_{\rm{A}}}$
in (74) has the chattering phenomenon occurs due to the existence of the sign function. Compared the attacker’s accelerations in (66) and (74),
${a_{\rm{A}}}$
in (75) converges to
$0 {\rm m}/{\rm s}^{2}$
at a slower rate.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_fig13.png?pub-status=live)
Figure 13. The accelerations of the attacker.
Figure 14 shows the variation tendency of the protector’s accelerations with respect to time. According to Fig. 14, the accelerations of the protector
${a_{\rm{P}}}$
in (66) (74) and (75) increase and converge to
$0 {\rm m}/{\rm s}^{2}$
, satisfying the overload constraint. The acceleration of the protector
${a_{\rm{P}}}$
in (74) exceeds the limitation of the manoeuver due to the chattering phenomenon from the sign function. The acceleration
${a_{\rm{P}}}$
in (75) has a slower convergence speed for the protector.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_fig14.png?pub-status=live)
Figure 14. The accelerations of the protector.
Case 2.
The advantage of the cooperative guidance scheme (66) is verified by comparing it with the guidance strategies (74) and (75) in Case 1. However, the comparison simulation in Case 1 can’t demonstrate the superiority of the two-on-two engagement since the simulation scenario is established in the three-player conflict. To overcome this drawback, a simulation study in Case 2 is presented in contrast to the two-on-two engagement.
The specific form of the two-on-two guidance law in Ref. (Reference Liang, Wang, Liu and Liu31) is
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_eqn76.png?pub-status=live)
where,
$\begin{gathered}{\Theta _{i{\text{1}}}} = {\tau _i}\psi \left( {{t_{go{\text{AT}}}}/{\tau _i}} \right)\left\| {u_i^{\max }} \right\|,{\Theta _{j2}} = {\tau _j}\psi \left( {{t_{go{\text{AD}}}}/{\tau _j}} \right)\left\| {u_j^{\max }} \right\|,{\Theta _{l3}} = {\tau _l}\psi \left( {{t_{go{\text{AD}}}}/{\tau _l}} \right)\left\| {u_l^{\max }} \right\|,i \in \{ {\text{A}},{\text{T}}\} , \hfill \\
j \in \left\{ {{\text{A}},{\text{D}}} \right\},l \in \left\{ {{\text{P}},{\text{D}}} \right\},\psi ( \bullet ) = {e^{ - \chi }} + \chi - 1,{\mathbf{K}}(t) = {\left[ {diag\left( {1/{\alpha _1}\quad - 1/{\alpha _2}\quad 1/{\alpha _3}} \right) + \int_t^{{t_{f{\text{PD}}}}} {{\mathbf{\unicode{x1D6F1}}}dt} } \right]^{ - 1}} \hfill \\ \end{gathered}$
$\boldsymbol{\unicode{x1D6F1}} = \left[ {\begin{array}{l@{\quad}l@{\quad}l}{ - \frac{{\unicode{x1D6E9} _{{\rm{A1}}}^2}}{{{\beta _1}}} - \frac{{\unicode{x1D6E9} _{{\rm{T1}}}^2}}{{{\beta _4}}}} & {}{ - \frac{{{\unicode{x1D6E9} _{{\rm{A1}}}}{\unicode{x1D6E9} _{{\rm{A2}}}}}}{{{\beta _1}}}} {}& 0\\[3pt]{ - \frac{{{\unicode{x1D6E9} _{{\rm{A1}}}}{\unicode{x1D6E9} _{{\rm{A2}}}}}}{{{\beta _1}}}} & {}{ - \frac{{\unicode{x1D6E9} _{{\rm{A2}}}^2}}{{{\beta _1}}} + \frac{{\unicode{x1D6E9} _{{\rm{D2}}}^2}}{{{\beta _3}}}} & {}{\frac{{{\unicode{x1D6E9} _{{\rm{D2}}}}{\unicode{x1D6E9} _{{\rm{D3}}}}}}{{{\beta _3}}}}\\[3pt]0 & {}{\frac{{{\unicode{x1D6E9} _{{\rm{D2}}}}{\unicode{x1D6E9} _{{\rm{D3}}}}}}{{{\beta _3}}}} & {}{ - \frac{{\unicode{x1D6E9} _{{\rm{P3}}}^2}}{{{\beta _2}}} + \frac{{\unicode{x1D6E9} _{{\rm{D3}}}^2}}{{{\beta _3}}}}\end{array}} \right]$
,
${K_{pq}}$
,
$p \in \left\{ {1,2,3} \right\}$
,
$q \in \left\{ {1,2,3} \right\}$
are the elements of matrix
$ \boldsymbol{{K}}(t)$
.
The simulation parameters are listed in Table 3.
Choose the parameters of the guidance strategy (66) as
$ {\theta _1} = 2.7,{\rm{ }}{\theta _2} = 3.7,{\rm{ }}{\theta _3} = 4.05,{\rm{ }}{k_\gamma } = 0.5, $
$ {k_\eta } = 0.001 $
,
${\rm{ }}{k_{\eta 1}} = 0.72$
,
${k_{\eta 2}} = 3.05$
,
${k_{\eta 3}} = 4.05$
,
${k_{\eta 4}} = 0.31$
,
${p_1} = 1.5$
,
$u_{{\rm{AN}}}^{\max } = 60{\rm m}/{\rm s}^{2} $
,
$u_{{\rm{PN}}}^{\max } = 60{\rm m}/{\rm s}^{2} $
,
$u_{{\rm{TN}}}^{\max } = 100{\rm m}/{\rm s}^{2}$
; the prescribed performance parameters of (66) are respectively selected as
${\rho _{{\rm{0AT}}}} = 110.17,\ {\rho _{{\rm{1AT}}}} = 110.05$
,
${\rho _{\infty {\rm{AT}}}} = 0.1$
,
${\rho _{0{\rm{L}}}} = 8.35$
,
${\rho _{l{\rm{L}}}} = 8.305,\ {\rho _{\infty {\rm{AT}}}} = 0.01,$
${\rho _{\infty {\rm{L}}}} = 0.01,$
${y_1} = 0.7$
,
${y_2} = 0.1$
,
${T_{d{\rm{AT}}}} = {T_{d{\rm{L}}}} = 3.16{\rm{s}},$
${k_\gamma } = 14$
,
${\delta _{{\varepsilon _{{\rm{AT}}}}}} = {\delta _{{\varepsilon _{\rm{L}}}}} = 1.$
The parameters of the fixed-time disturbance observer are chosen as
${v_1} = 14,$
${v_2} = 21,$
${v_3} = 0.001,$
$p = 1.4$
.
The parameters in the guidance law (76) are selected as
${\alpha _3} = 14.8$
,
${\alpha _2} = 4.2$
,
${\alpha _3} = 14.8$
,
${\beta _1} = 3$
,
${\beta _2} = 1.78$
,
${\beta _3} = 8.8,$
${\beta _4} = 14$
. The maximum acceleration is
$u_{\rm{A}}^{\max } = 50{\rm{m/}}{{\rm{s}}^2}$
,
$u_{\rm{P}}^{\max } = 50{\rm{m/}}{{\rm{s}}^2}$
,
$u_{\rm{D}}^{\max } = 80{\rm{m/}}{{\rm{s}}^2}$
,
$u_{\rm{T}}^{\max } = 100{\rm{m/}}{{\rm{s}}^2}$
.
Figure 15 shows the engagement trajectories of the players for the guidance strategies (66) and (76). It is evident from Fig. 15 that the attacker is guided by the protector to intercept the defender in the proposed guidance scheme. Based on Fig. 15, the attacker is intercepted by the defender when the protector is unable to capture the defender, illustrating that the guidance strategy cannot fulfill the combat mission.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_fig15.png?pub-status=live)
Figure 15. Trajectories of guidance strategies in Case 2.
The time evolutions of the ZEM
${Z_{{\rm{AT}}}}$
and the ZEL
${Z_{\rm{L}}}$
are illustrated in Figs 16 and 17. According to Fig. 16,
${Z_{{\rm{AT}}}}$
increases and converges to 0m within the upper boundary of the convergence time
${T_r} = {\rm{3}}{\rm{.4446s}}$
and satisfies the prescribed performance constraint, demonstrating that the attacker intercepts the target at the terminal time. Based on Fig. 17,
${Z_{\rm{L}}}$
converges to
$0\deg $
in the upper boundary of the convergence time
${T_r} = {\rm{3}}{\rm{.4446s}}$
and satisfies the prescribed performance, which validates that the protector maintains on the LOS of the attacker-defender and intercepts the defender.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_fig16.png?pub-status=live)
Figure 16. ZEM between the attacker and the target.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_fig17.png?pub-status=live)
Figure 17. ZEL between the protector and the attacker-defender.
The graph in Fig. 18 illustrates the changes in the states
${z_{2i}},i \in \left\{ {{\rm{AT}},{\rm{L}}} \right\}$
of the fixed-time disturbance observer over time. It shows that the unknown disturbance (60) is estimated by the fixed-time disturbance observer by virtue of
${z_{2i}} = 0,i \in \left\{ {{\rm{AT}},{\rm{L}}} \right\}$
, and the upper bound of the convergent time is
${T_z}{\rm{ = 1}}{\rm{.5911s}}$
.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_fig18.png?pub-status=live)
Figure 18. Fixed-time observer state
$ {z_{2i}},{\rm{ }}i = {\rm{AT}},{\rm{L}} $
.
Figures 19 and 20 illustrate the time evolutions of the accelerations
${a_{\rm{A}}}$
and
${a_{\rm{P}}}$
in (66) and (76), which demonstrate that the accelerations of the attacker and the protector satisfy the input saturation constraint and
${a_{\rm{A}}}$
,
${a_{\rm{P}}}$
in (66) converge to
$0{\rm m}/{\rm s}^{2}$
in contrast to
${a_{\rm{A}}}$
,
${a_{\rm{P}}}$
in (76).
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_fig19.png?pub-status=live)
Figure 19. The accelerations of the attacker.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_fig20.png?pub-status=live)
Figure 20. The accelerations of the protector.
The ZEMs between the attacker-protector team and the defender-target team with time are shown in Fig. 21. It can be seen from Fig. 21 that the ZEM
${Z_{{\rm{AD}}}}$
converges to 0m, and the guidance strategy isn’t able to guarantee the convergence of the ZEMs
${Z_{{\rm{AT}}}}$
,
${Z_{{\rm{PD}}}}$
. Therefore, the defender evades the interception of the protector and captures the attacker, which causes the failure of the attacker-protector team’s combat mission.
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20250123201020366-0956:S0001924024001453:S0001924024001453_fig21.png?pub-status=live)
Figure 21. ZEMs in the guidance scheme.
5.0 Conclusion
In this paper, the cooperative guidance strategy with prescribed performance and input saturation has been designed by virtue of the sliding mode control and line-of-sight guidance methods in the two-on-two engagement. The guidance strategy guarantees that the attacker intercepts the target when the protector captures the defender. The conclusions are elaborated as follows:
-
(1) The cooperative guidance strategy addresses the combat issue that the attacker intercepts the target with the assistance of the protector maintaining on the line-of-sight of the defender-attacker to capture the defender. The chattering phenomenon doesn’t affect the guidance performance since the sign function isn’t included in the proposed guidance scheme.
-
(2) The guidance strategy has developed a new type of fixed-time prescribed performance function to ensure that the zero-effort miss and zero-effort line-of-sight angle meet the prescribed performance constraint using dual prescribed performance functions for the upper and lower boundaries.
-
(3) The proposed guidance scheme has met the constraint of the attacker-protector team’s input control by means of the first-order anti-saturation auxiliary variable.
-
(4) The unknown disturbance of the guidance system has been estimated by virtue of presenting a novel fixed-time disturbance observer in the cooperative guidance strategy, which weakens the influence of the external disturbance.
The two-on-two line-of-sight guidance strategy proposed in this paper can be used as a framework to expand the game combat between multiple aircraft in a cluster by virtue of the line-of-sight guidance method. Furthermore, by considering the constraints, such as the terminal interception angle and field-of-view, the line-of-sight guidance strategy is designed to ensure that the attacker-protector team satisfies the field-of-view conditions and intercepts the target-defender team at the desired angle.
Acknowledgements
This work is supported by National Natural Science Foundation (NNSF) of China under Grant 62273119.
Competing interest
The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.