# Cooperative Guidance Law against Highly Maneuvering Target with Dynamic Surrounding Attack

Authors: Zhikai Wang; Wenxing Fu; Yangwang Fang; Zihao Wu; Mingang Wang
Journal: International Journal of Aerospace Engineering
 (2021)

---

## Abstract

In this paper, a new dynamic surrounding attack cooperative guidance law against highly maneuvering target based on decoupled model is proposed. First, a new dynamic surrounding guidance strategy is proposed, and virtual targets are introduced to establish the cooperative guidance model for dynamic surrounding attack. Second, a dynamic inverse method is used to decouple the cooperative guidance model, and extended state observers (ESOs) are introduced to estimate the disturbances caused by target maneuver. Then, the impact time and dynamic surrounding guidance (ITDSG) law against highly maneuvering target is designed based on a prescribed-time stable method and the decoupled model. Finally, numerical simulations are performed to illustrate the superiority and effectiveness of the proposed ITDSG.


---

## Body

## 1. Introduction

Cooperative guidance laws for multimissiles have captured the interest of many researchers since the seminal work by I.S. Jeon first appeared [1]. Cooperative guidance law against a static or low-speed target has been extensively studied over the past decades [2, 3]. The early cooperative guidance laws mainly focused on the cooperative proportional navigation (CPN) proposed by Tahk et.al. [4, 5], which were used to solve the problems of antiship missiles attacking the ship simultaneously. In fact, the CPN is not a true sense of cooperative guidance law, because it does not consider the information interaction between the missiles. Soon afterwards, the true sense of cooperative guidance laws including centralized [6] or distributed [7–9] cooperative guidance laws were studied.Considering the communications between missiles, some researches have proposed cooperative guidance laws against static or constant velocity target. Zhou and Yang [10] used the range-to-go as a covariable to avoid the estimation of times-to-go and designed a cooperative guidance law against a static target with an undirected communication topology. Zhao et.al. [7, 11] designed a multimissile cooperative guidance law against single stationary target based on model-predictive-control (MPC) and CPN.Unlike the above scenarios, some researchers have focused on the research of cooperatively intercepting maneuvering target with multimissiles in recent years [2, 3]. As is known to all, a missile can intercept a low maneuvering target (such as early warning aircraft) easily [12–15], but it is difficult for a missile to intercept a target with highly maneuverability (such as unmanned aerial vehicle). Thus, it is necessary to develop cooperative guidance law for multiple missiles against the highly maneuvering target. Some scholars have studied this problem in recent years. In [16], an ESO was introduced to estimate the unknown disturbance caused by the acceleration of target; furthermore, the cooperative guidance law was designed with the estimated disturbances and finite time consensus theory [17, 18]. Based on the optimal control method, Nikusokhan and Nobahari [19] proposed a novel approach to derive a cooperative guidance law for two pursuers against one zero-lag evader with a random step maneuver. However, the shortage of the approach is that the maneuverability of the missile is supposed to be unlimited, which is impracticable in engineer application. Because of the limitation of the missiles’ overload, by setting the virtual target to make each missile’s joint reachable range cover different subintervals of target maneuvering range, the cooperative guidance law was designed in [20] based on BPN to ensure that at least one missile hits the target. For the three-dimensional (3D) terminal cooperative guidance law against the maneuvering target, Song et.al. [21, 22] proposed two-direction cooperative guidance laws including acceleration commands in the LOS and normal LOS directions. The acceleration command in the LOS direction was developed to ensure all the missiles to hit the target simultaneously in a finite time; the normal acceleration command was designed to guarantee that LOS angular rate and LOS angle converge to the desired values. Unfortunately, the aforementioned methods did not consider the couplings between the LOS and normal LOS direction. Furthermore, the existing guidance strategies for surrounding attack require to set the desired LOS angles in advance, in fact this is a static strategy. However, in the actual combat environment, it is difficult to set the suitable LOS angles in advance.In order to improve the effort of attacking a target, surrounding attack strategy must be considered. In the existing literatures, in order to achieve the surrounding attack, the term LOS angle constraint is added to the basic guidance law, so that the designed guidance law can ensure the missile to approach the target with a desired LOS angle. The guidance laws for single missile attacking single target with a LOS angle constraint have been extensively studied [23–25]. For the guidance problem of multimissile attack a target with time and LOS angle constraints, some researchers have studied them [26–29]. However, in the actual application, the relative relationship between the missile and the maneuvering target like the above assumptions cannot be predicted, so it is difficult to set a suitable desired LOS angle in advance.Motivated by the aforementioned papers, in order to achieve the dynamic surrounding attack of multiple missiles against a highly maneuvering target and further consider the couplings between the LOS and normal LOS directions in the cooperative guidance model, we proposed the ITDSG in this paper. The main contributions of this paper can be summarized as follows:(1)
We proposed the strategy of dynamic surrounding attack and established the cooperative guidance model between multiple missiles and virtual targets. Due to the traditional cooperative guidance laws with angle constrain need a preset LOS angle [26–29], it is difficult to set the appropriate angle in advance due to the unknown maneuver of the target. But the dynamic surrounding attack strategy proposed in this paper can avoid this(2)
By using the dynamic inverse method, the coupled cooperative guidance model is decoupled, and the ITDSG is designed based a prescribed-time stable method subject to the decoupled model. This is opposed to Ref [21, 22, 30], where the guidance laws are designed without considered the coupling(3)
The proposed cooperative guidance in this paper requires less maximum overload and energy consumption compared with Ref [21], which is more conducive to engineering realizationThe remainder of this paper is organized as follows. Section2 presents some necessary preliminaries and model description. Section 3 presents the dynamic surrounding attack strategy and the detailed design processes of proposed cooperative guidance law. Finally, the effectiveness of dynamic surrounding attack strategy and cooperative guidance law are verified through simulations in Section 4; conclusions are drawn in Section 5.


## 2. Problem Formulation

### 2.1. Model Description

In this section, the model description and the basic knowledge of consensus protocol are introduced.The relative motion geometry of single missile and single target can be formulated as follows:(1)ṙ=Vtcosq−θt−Vmcosq−θm,(2)rq̇=−Vtsinq−θt+Vmsinq−θm.Differentiating Eqs. (1) and (2) with respect to time t, the equations are obtained as follows:
(3)r¨=wr−ur+rq̇2,(4)q¨=wq−2uq−2ṙq̇r.In Eqs. (3) and (4), ur and wr denote the components of the acceleration of the missile and target in the LOS direction, respectively; uq and wq denote components of the acceleration of the missile and target in the normal LOS direction, respectively.In order to ensure that missiles hit the target simultaneously, a variabletgo called time-to-go is introduced in this paper, which can be estimated as
(5)tgo=−rṙ.Compute the derivation oftgo with respect time t as follows:
(6)ṫgo=−1+r2q̇2ṙ2−rṙ2ur+rṙ2wr.Combining Eqs. (1) and (2) with Eqs. (4) and (6), the state equations of the ith missile can be described as follows:
(7)ẋ1i=ri2ṙi2x2i2−Ṫfi∗−riṙi2uri+dri,ẋ2i=−2ṙirix2i−1riuqi+dqi,where x1i=tgoi+t−Tfi∗ and x2i=q̇i are the state variables and dri=r/ṙ2wr and dqi=wq/r are the disturbances caused by target maneuver.Considering the problem ofn missiles intercept a maneuvering target simultaneously, a dynamic surrounding attack strategy is proposed in this paper. By this new strategy, the problem is transformed to that multiple missiles attack multiple virtual, where the virtual targets approach the real target with missiles approaching the real target. Figure 1 shows the guidance geometry of Missiles-Target-Virtual Targets in two-dimensional plane, where Mi and Tivi=1,2,⋯,n represent the ith missile and the ith virtual target; T denotes the real target; Vmi and θmii=1,2,⋯,n denote the velocity and the flight path angle of ith missile respectively; aT is the normal acceleration of target; Vt and θt denote the velocity and the flight path angle of target, respectively; aT is the normal acceleration of target; and qi and rii=1,2,⋯,n denote the LOS angle and distance between ith missile and ith virtual target, respectively. The subscripts m, t, and v denote the state variables of missiles, target, and virtual targets, respectively. For multimissiles against single target system, the subscript i denotes the ith missile’s or virtual target’s state variable.Assumption 1.
The disturbancedri and dqi are bounded, that is ∣dri∣<εri and ∣dqi∣<εqi, where εri and εqi are the given positive constants.Figure 1
Guidance geometry on Missiles-Target (virtual targets) engagement.


### 2.2. Graph

Suppose that communication network graph between agents can be expressed asG=V,E,C, where V=1,2,⋯,n denotes the set of vertices, E⊆V×V denotes the edge set of graph, the subscripts i denotes the ith agent, eij is the edge of graph G, and eij⊆E indicates that the agent i and j can receive message from each other in an undirected graph. If there is a connection between any two agents in the graph, then the graph G is connected. In the directed graph, eij⊆E means that the agent i can receive message from agent j. In addition, C=cij∈Rn×n is the adjacency matrix of graph G. If eij⊆E, then cij>0; otherwise, cij=0. It is worth noting that cij=cji when the communication topology is an undirected graph. The Laplace matrix of the graph G is defined as L=Lij∈Rn×n, which can be expressed as:
(8)Lij=−ciji≠j,∑j=1,j≠inciji=j.In this paper, the communication network graph of multiple missiles is assumed to be undirected and connected.


### 2.3. Multiagent Consensus

The first-order multiagent system withn agents is described as
(9)ẋi=ui,where xi denotes the state of ith agent and ui is the consensus protocol to be designed with the information of the ith agent and its neighbors.Lemma 2 [31].
For a first-order multiagent system as Eq. (9), if the graph of communication topology is undirected and connected, the state variables xii=1,⋯,N of n agents can be convergent in a prescribed-time T by the following consensus protocol.
(10)ui=−k+cμ̇tμt∑j∈Niaijxi−xj,where i=1,⋯,N; k>0 and c>1 are design parameters; and μt is a time-varying scaling function as
(11)μt=ThT+t0−th,t∈t0,T1,t∈T,∞,where h>2 is a real number and T>Ts>0 with the minimum communication interval Ts.Lemma 3 [32].
Consider a nonlinear system defined as(12)ẋt=ft,xt+dt+u,t∈R+.
Select a continue and differentiable Lyapunov candidate functionVt,xt>0 and Vt,0=0. The state vector x is prescribed-time stable with a given time T in Eq. (11), if the differentiation of Lyapunov function satisfies V̇≤−bV−kμ̇/μ, on t∈t0,∞. In addition, the Lyapunov candidate function holds
(13)Vt≤μ−kexp−bt−t0Vt0,t∈t0,TVt≡0,t∈T,∞.Lemma 4 [16, 33].
For a nonlinear system with an unknown and bounded disturbancedt as Eq. (12). Suppose that the state vector x and the control input u can be measured. By a second order ESO Eq. (14), there exist observer gain γ11, γ12, μ1, and δ1 such that the estimated states Z11 and Z12 converge into a neighborhood actual states x and dt, respectively.
(14)E11=Z11−x,Ż11=Z12+ft,xt+u−γ11E11,Ż12=−γ12falE11,μ1,δ1,where E11 is the observed error of the state x; γ11, γ12, μ1, and δ1 are the parameters of ESO; and fal is defined as
(15)falE11,μ1,δ1=E11iμ1sgnE11,E11>δ1E11/δ11−μ1,E11≤δ1.


## 2.1. Model Description

In this section, the model description and the basic knowledge of consensus protocol are introduced.The relative motion geometry of single missile and single target can be formulated as follows:(1)ṙ=Vtcosq−θt−Vmcosq−θm,(2)rq̇=−Vtsinq−θt+Vmsinq−θm.Differentiating Eqs. (1) and (2) with respect to time t, the equations are obtained as follows:
(3)r¨=wr−ur+rq̇2,(4)q¨=wq−2uq−2ṙq̇r.In Eqs. (3) and (4), ur and wr denote the components of the acceleration of the missile and target in the LOS direction, respectively; uq and wq denote components of the acceleration of the missile and target in the normal LOS direction, respectively.In order to ensure that missiles hit the target simultaneously, a variabletgo called time-to-go is introduced in this paper, which can be estimated as
(5)tgo=−rṙ.Compute the derivation oftgo with respect time t as follows:
(6)ṫgo=−1+r2q̇2ṙ2−rṙ2ur+rṙ2wr.Combining Eqs. (1) and (2) with Eqs. (4) and (6), the state equations of the ith missile can be described as follows:
(7)ẋ1i=ri2ṙi2x2i2−Ṫfi∗−riṙi2uri+dri,ẋ2i=−2ṙirix2i−1riuqi+dqi,where x1i=tgoi+t−Tfi∗ and x2i=q̇i are the state variables and dri=r/ṙ2wr and dqi=wq/r are the disturbances caused by target maneuver.Considering the problem ofn missiles intercept a maneuvering target simultaneously, a dynamic surrounding attack strategy is proposed in this paper. By this new strategy, the problem is transformed to that multiple missiles attack multiple virtual, where the virtual targets approach the real target with missiles approaching the real target. Figure 1 shows the guidance geometry of Missiles-Target-Virtual Targets in two-dimensional plane, where Mi and Tivi=1,2,⋯,n represent the ith missile and the ith virtual target; T denotes the real target; Vmi and θmii=1,2,⋯,n denote the velocity and the flight path angle of ith missile respectively; aT is the normal acceleration of target; Vt and θt denote the velocity and the flight path angle of target, respectively; aT is the normal acceleration of target; and qi and rii=1,2,⋯,n denote the LOS angle and distance between ith missile and ith virtual target, respectively. The subscripts m, t, and v denote the state variables of missiles, target, and virtual targets, respectively. For multimissiles against single target system, the subscript i denotes the ith missile’s or virtual target’s state variable.Assumption 1.
The disturbancedri and dqi are bounded, that is ∣dri∣<εri and ∣dqi∣<εqi, where εri and εqi are the given positive constants.Figure 1
Guidance geometry on Missiles-Target (virtual targets) engagement.


## 2.2. Graph

Suppose that communication network graph between agents can be expressed asG=V,E,C, where V=1,2,⋯,n denotes the set of vertices, E⊆V×V denotes the edge set of graph, the subscripts i denotes the ith agent, eij is the edge of graph G, and eij⊆E indicates that the agent i and j can receive message from each other in an undirected graph. If there is a connection between any two agents in the graph, then the graph G is connected. In the directed graph, eij⊆E means that the agent i can receive message from agent j. In addition, C=cij∈Rn×n is the adjacency matrix of graph G. If eij⊆E, then cij>0; otherwise, cij=0. It is worth noting that cij=cji when the communication topology is an undirected graph. The Laplace matrix of the graph G is defined as L=Lij∈Rn×n, which can be expressed as:
(8)Lij=−ciji≠j,∑j=1,j≠inciji=j.In this paper, the communication network graph of multiple missiles is assumed to be undirected and connected.


## 2.3. Multiagent Consensus

The first-order multiagent system withn agents is described as
(9)ẋi=ui,where xi denotes the state of ith agent and ui is the consensus protocol to be designed with the information of the ith agent and its neighbors.Lemma 2 [31].
For a first-order multiagent system as Eq. (9), if the graph of communication topology is undirected and connected, the state variables xii=1,⋯,N of n agents can be convergent in a prescribed-time T by the following consensus protocol.
(10)ui=−k+cμ̇tμt∑j∈Niaijxi−xj,where i=1,⋯,N; k>0 and c>1 are design parameters; and μt is a time-varying scaling function as
(11)μt=ThT+t0−th,t∈t0,T1,t∈T,∞,where h>2 is a real number and T>Ts>0 with the minimum communication interval Ts.Lemma 3 [32].
Consider a nonlinear system defined as(12)ẋt=ft,xt+dt+u,t∈R+.
Select a continue and differentiable Lyapunov candidate functionVt,xt>0 and Vt,0=0. The state vector x is prescribed-time stable with a given time T in Eq. (11), if the differentiation of Lyapunov function satisfies V̇≤−bV−kμ̇/μ, on t∈t0,∞. In addition, the Lyapunov candidate function holds
(13)Vt≤μ−kexp−bt−t0Vt0,t∈t0,TVt≡0,t∈T,∞.Lemma 4 [16, 33].
For a nonlinear system with an unknown and bounded disturbancedt as Eq. (12). Suppose that the state vector x and the control input u can be measured. By a second order ESO Eq. (14), there exist observer gain γ11, γ12, μ1, and δ1 such that the estimated states Z11 and Z12 converge into a neighborhood actual states x and dt, respectively.
(14)E11=Z11−x,Ż11=Z12+ft,xt+u−γ11E11,Ż12=−γ12falE11,μ1,δ1,where E11 is the observed error of the state x; γ11, γ12, μ1, and δ1 are the parameters of ESO; and fal is defined as
(15)falE11,μ1,δ1=E11iμ1sgnE11,E11>δ1E11/δ11−μ1,E11≤δ1.


## 3. Main Result

Firstly, a novel dynamic surrounding attack strategy is proposed in this section by introducing the virtual targets. Then, we propose the calculation formulas of the position of virtual targets using measurable real target information. Finally, considering the couplings between the LOS and normal LOS directions of the guidance model in Eq. (7), an adaptive dynamic inverse method is proposed to decouple them. And an impact time and dynamic surrounding cooperative guidance law (ITDSG) is designed subject to the decoupled models. Besides, the accelerations of target in LOS and normal LOS directions are regarded as disturbances and estimated by ESOs.Remark 5.
The difference between dynamic and static surrounding attack is whether a preset LOS angle constraint is required. The static surrounding attack is achieved by presetting different LOS angle constraint for each missile to achieve multiple missiles attacking the target from different directions. This attack strategy is determined at the beginning of the missile terminal guidance, which will not change with the maneuvering of the target. By introducing multiple virtual targets, the dynamic surrounding attack strategy without preset LOS angle constraint is achieved. The virtual targets are calculated according to the movement of real target, and multiple virtual targets gradually approach the real target from different directions.


### 3.1. The Strategy of Dynamic Surrounding Attacking

In the scenario of single missile intercepting a target, at the terminal phase of intercepting, the target usually maneuvers to avoid being hit by a missile. Figure2(a) shows the target escape area, where target moves with a fixed overload from −nTmax to nTmax in a finite time. R denotes the minimum turning radius of the target. In a real combat environment, the purpose of the target turning left or right is to obtain a maximum lateral distance perpendicular to the line of sight. When the target is maneuvering with the abovementioned strategy, escape area of the target is shown in Figure 2(b). R denotes the minimum turning radius of the target; L denotes the distance of the target flying along a straight line after a 90° turning.Figure 2
Target escape area.
(a)
Target escape area in Case(b)
Target escape area in Case 2Figure3 shows the novel guidance strategy ITDSG. In the scenario that n missiles intercept a maneuvering target, where T0 and Mii=1,2,⋯,n represent the initial positions of target and missiles, respectively. T1 represents the upper boundary point of the target perpendicular to the initial velocity direction in the forward maximum positive overload maneuver. Similarly, Ti represents the lower boundary point when the target maneuvers with negative maximum overload. Tp is the middle boundary point of the target with a zero overload. The escape area is determined by the velocity and the maximum overload of the target. In this paper, the escape area of the target is divided into n subescape areas, where n is the number of missiles; the center point of the subescape area is set as the virtual target which denotes as Tivi=1,2,⋯,n. The goal of cooperative guidance is to make the reachable sets of the n missiles cover these n subescape areas, respectively. When the distances between missiles and the virtual targets become smaller, their times-to-go gradually approach zero, and multiple virtual targets gradually approach the real target from different directions as well as the escape areas of multiple virtual targets coincide gradually. Since each missile aiming at a virtual target, thus the dynamic surrounding attack is achieved.Figure 3
Guidance geometry on Missiles-Targets engagement.


### 3.2. Dynamic Models of Missiles and Virtual Targets

The dynamic models of the missiles and virtual targets can be established by the three steps. Firstly, calculate the coordinate of boundary points subject to the real target position and velocity information. Then, the coordinates ofn virtual targets are calculated based on the information of the boundary points. Finally, by using the information of virtual targets and the existing dynamic model of single missile and target, the dynamic models of multiple missiles and multiple virtual targets are established.Step 1.
Calculate the boundary point.Figure4 shows the geometry between the target boundary point with the target initial position and velocity. The time of the target flying a quarter of a circle with maximum overload is defined as Tqc. T0 denotes the initial point of the target; Tu1 and Tu2 represent the lateral boundary point when the target is maneuvering with a positive overload and the flight time is less and greater than Tqc, respectively; Td1 and Td2 represent the lateral boundary point when the target is maneuvering with a negative overload and the flight time is less and greater than Tqc, respectively; Tg represents the boundary point when the target is moving in a straight line without any maneuvering.Figure 4
Relative geometrical between target boundary point and initial position of target.However, the seeker can only obtain the relative information of the missile and the target, such asr, q, ṙ, and q̇; the information of the missile such as the position (xmi, ymi) and velocity (Vmi, θmi) can be obtained through its own inertial navigation device; the velocity of the target (Vt, θT) can be calculated with Eqs. (1) and (2); the target’s coordinates can be calculated as xT=xmi+rcosqi and yT=ymi+rsinqi. Suppose that at least one missile can obtain the position and velocity of the target which are transmitted to other missiles through the communication network. Then, each missile can calculate boundary points and virtual target points based on the real target information.The boundary points can be calculated as follows. WhenTp≤Tqc, then
(16)xu1=−RT1−cosαsinθt+RTsinαcosθt+xT0,yu1=RT1−cosαcosθt+RTsinαsinθt+yT0,xd1=RT1−cosαsinθt+RTsinαcosθt+xT0,yd1=−RT1−cosαcosθt+RTsinαsinθt+yT0,when Tp>Tqc, then
(17)xu2=−RT+L0sinθt+RTcosθt+xT0,yu2=RT+L0cosθt+RTsinθt+yT0,xd2=RT+L0sinθt+RTcosθt+xT0,yd2=−RT+L0cosθt+RTsinθt+yT0.What is more, the coordinates (xg, yg) of the bounded point can be calculated as:
(18)xg=VtTpcosθt+xT0,yg=VtTpsinθt+yT0,where RT=Vt2/atmax denotes the minimum turning radius of the target, θt is the flight path angle of the target, T0 is the initial position of the target denoted as (xT0, yT0), and the other variables can be calculated asTqc=πRT/2VT, α=πTp/2Tqc, and L0=VTTp−Tqc.Step 2.
Calculate the coordinates of virtual targets.Considering the scenario thatn missiles cooperatively intercept a highly maneuvering target, based on the ITDSG interception strategy, the missile’s attack range covers the escape area of the target by introducing n virtual targets. The coordinates (xiv, yiv) of the virtual targets Tivi=1,2,⋯,n can be calculated as follows. When Tp>Tqc, then
(19)xiv=−n−2i+1nRT+L0sinθt+RTcosθt+xT0,yiv=n−2i+1nRT+L0cosθt+RTsinθt+yT0.WhenTp≤Tqc, then
(20)xiv=−n−2i+1nRT1−cosαsinθt+RTsinαcosθt+xT0,yiv=n−2i+1nRT1−cosαcosθt+RTsinαsinθt+yT0,where n−2i+1/ni=1,2,⋯,n is designed to adjust the position of ith virtual target in the normal direction of target velocity. By setting the virtual targets, the reachable sets of all missiles can cover the escape area of the target. In Eqs. (19) and (20), Tp determines the values RT and L0, which is defined as follows:
(21)Tpt=Tpmax,t<TsTgop−t−δt,Ts≤t≤Te0,t>Te,where Ts=Tgop–δt−Tpmax, Te=Tgop−δt, Tgop=Tgo0, Tpmax, and δt are the given positive constants and t represents the flight time.As a result, by applying Eqs. (19)–(21), the position of virtual targets (xiv, yiv) (i=1,2,⋯,n) can be obtained.Step 3.
Establish the dynamic model.Similar to Eq. (7), the dynamic models of multiple missiles attacking multiple virtual targets based on the information of the virtual targets can be written as follow
(22)ẋ1iv=riv2ṙiv2x2iv2−Ṫfiv∗−rivṙiv2uri+driv,ẋ2iv=−2ṙivrivx2iv−1rivuqi+dqiv,where x1iv=tgoiv+t−Tfiv=−riv/ṙiv+t−Tfiv; x2iv=q̇iv; riv=xiv−xmi2+yiv−ymi2; q̇iv=dq/dt; ṙiv=dr/dt;qiv=arctanyiv−ymi/xiv−xmi; xmi and ymi are the coordinates of missile i, which are obtained from the missile’s inertial navigation system, xiv and yiv cannot be measured, which can be calculated by Step 1 and Step 2. Besides, driv=riv/ṙi2wr+driϵ and dqiv=1/rivwq+dqiϵare the disturbances, where wr and wq are the components of the real target’s acceleration in LOS and norm LOS directions and driϵ and dqiϵ are the virtual acceleration caused by the virtual target approaching the real target.In the initial stage of intercepting, theith missile is aiming at the ith virtual target. Then, with the time t tending to Te, the virtual targets are approaching the real target. In the final stage, the virtual targets and real target are coincident, that is, all missiles aim at the real target.


### 3.3. The Guidance Law Design of ITDSG

In this section, an adaptive dynamic inverse method is used to decouple and linearize Eq. (22); then, the ITDSG is designed with a prescribed-time stable control method. Equation (22) can be rewritten as
(23)ẋi=fixi+gixiui+dit,where
(24)fixi=riv2ṙiv2x3iv2−2ṙivrivx3iv,ui=uriuqi,gixi=−rivṙiv200−1riv,dit=drivdqiv.Applying Lemma4, the disturbances driv and dqiv can be estimated by d^riv and d^qiv with two ESOs, and there exist bounded real numbers η1i>0 and η2i>0 satisfying ∣driv−d^riv∣≤η1i,∣dqiv−d^qiv∣≤η2i. The inverse matrix of gixi can be calculated as follows:
(25)gixi−1=−ṙi2ri00−ri.According to the dynamic inverse method, the controller can be computed as follows:(26)uit=gixi−1Vit−fixi−dit.Substituting the above controlleruit into Eq. (23), we obtain
(27)ẋit=Vit.The above equation is the expected linearization one;Vit is the desired dynamic equation of xi, considering the estimation errors of the disturbances and applying prescribed-time control method; the desired dynamic equation of xi can be designed as:
(28)Vit=−Kitxi,where
(29)Kit=diagk11i+k12iμt.μt+η1isignx1iv,k21i+k22iμt.μt+η2isignx1iv,is a diagonal matrix to be designed, where k11i>0, k12i>0, k21i>0, k22i>0, η1i, and η2i are the parameters of controller.Finally, combining with the Eqs. (26)–(28), the controller is designed as Eq. (30).Based on the above design method of the decoupled guidance model, a nonlinear and strong coupled guidance problem can be transformed into linear control stabilization problem. By designing the controller, all state variables can converge to 0.x1iv=0 means tgofii=1,2,⋯,n of all n missiles tend to a same value. When x2iv=0 is satisfied, each missile can be guaranteed to hit the target.
(30)uriuqi=ṙiv2riv−k11i+k12iμt.μt+η1isignx1ivx1iv−rivṙiv2x2iv2+uinom−d^riv−rivk21i+k22iμt.μt+η2isignx2iv−2ri.x2iv−d^qi.Remark 6.
It is easy to obtain that, ast tends to T, μt and μ̇t/μt both approach to infinity, which may cause the control input to be infinity. However, the state values x1i and x2i will approach zero at the prescribed-time T, such that the control input uri and uqi are both bounded, which has been proved in Ref. [31]. In addition, due to the use of a prescribed-time control method, the convergence rate of the state variables is slower in the initial phase, when the time t approaches T, the convergence rate gradually increases. This will avoid large control inputs in the initial stage, which is more conducive to engineering realization.Theorem 7.
For the multiple-missile and multiple-virtual target system Eq. (23), suppose that the disturbances dri and dqi can be estimated by ESOs designed as Eq. (14). The proposed guidance Eq. (30) can guarantee that all the tgofi converge to a same value (all the missiles hit the target simultaneously), and q˙i converges to 0 (each missile can hit the target) in a prescribed-time T, respectively.Proof.
Define the following Lyapunov candidate function:(31)V1=12xiTxi.The derivative of Eq. (31) is given as
(32)V̇1=xiTẋi.By applying Eqs. (30) and (23) to Eq. (32) and rearranging, the following inequality can be obtained:
(33)V̇1=x1ivẋ1iv+x2ivẋ2iv=x1ivriv2ṙiv2x3iv2+d^riv−rivṙiv2uri+x2iv−2rivṙivx3iv+d^qiv−1rivuqi=x1ivψ1t+η1isignx1iv−d^riv+drivx1iv+x2ivψ2t+η2isignx2iv−d^qiv+dqivx2iv,where ψ1t=−k11i+k12iμt/μt$ and $ψ2t=−k21i+k22iμt/μt.Since∣−d^riv+driv∣≤η1i,∣−d^qiv+dqiv∣≤η2i; then, we have
(34)V̇1≤ψ1tx1iv2−ψ2tx2iv2≤−λmin1+λmin2μ̇tμtV1,where λmin1=mink11i,k21i and λmin2=mink12i,k22i. Then, according to Lemma 3, we can obtain that the state variables x1iv and x2iv gradually converge to zero in a prescribed-time T. According to the definition of x1iv and x2iv, it is clear to see that all the tgofi can converge to Tgof∗, and all the q̇i converge to zero in a prescribed-time T, respectively. Besides, the Tgof∗ can converge to a same value in a prescribed-time T by applying consensus protocol Eq. (10), which has been proved in Lemma 2.Remark 8.
The convergence speed of the system states is controllable with the proposed guidance law in this paper. From Eq. (21), it can be seen that the time for the virtual target to approach the real target is determined by Te. By applying the prescribed-time convergence protocol, the desired flight time Tgofi of the missiles converge to a same value at time T. In addition, by introducing a time-varying scaling function, the convergence time of the LOS angular rates q̇i and the times-to-go Tgoi of the missiles are also determined by the prescribed-time T. In other words, by setting different values of Te and T, the convergence speed of multimissile cooperative attack a highly maneuvering target can be set arbitrarily.


## 3.1. The Strategy of Dynamic Surrounding Attacking

In the scenario of single missile intercepting a target, at the terminal phase of intercepting, the target usually maneuvers to avoid being hit by a missile. Figure2(a) shows the target escape area, where target moves with a fixed overload from −nTmax to nTmax in a finite time. R denotes the minimum turning radius of the target. In a real combat environment, the purpose of the target turning left or right is to obtain a maximum lateral distance perpendicular to the line of sight. When the target is maneuvering with the abovementioned strategy, escape area of the target is shown in Figure 2(b). R denotes the minimum turning radius of the target; L denotes the distance of the target flying along a straight line after a 90° turning.Figure 2
Target escape area.
(a)
Target escape area in Case(b)
Target escape area in Case 2Figure3 shows the novel guidance strategy ITDSG. In the scenario that n missiles intercept a maneuvering target, where T0 and Mii=1,2,⋯,n represent the initial positions of target and missiles, respectively. T1 represents the upper boundary point of the target perpendicular to the initial velocity direction in the forward maximum positive overload maneuver. Similarly, Ti represents the lower boundary point when the target maneuvers with negative maximum overload. Tp is the middle boundary point of the target with a zero overload. The escape area is determined by the velocity and the maximum overload of the target. In this paper, the escape area of the target is divided into n subescape areas, where n is the number of missiles; the center point of the subescape area is set as the virtual target which denotes as Tivi=1,2,⋯,n. The goal of cooperative guidance is to make the reachable sets of the n missiles cover these n subescape areas, respectively. When the distances between missiles and the virtual targets become smaller, their times-to-go gradually approach zero, and multiple virtual targets gradually approach the real target from different directions as well as the escape areas of multiple virtual targets coincide gradually. Since each missile aiming at a virtual target, thus the dynamic surrounding attack is achieved.Figure 3
Guidance geometry on Missiles-Targets engagement.


## 3.2. Dynamic Models of Missiles and Virtual Targets

The dynamic models of the missiles and virtual targets can be established by the three steps. Firstly, calculate the coordinate of boundary points subject to the real target position and velocity information. Then, the coordinates ofn virtual targets are calculated based on the information of the boundary points. Finally, by using the information of virtual targets and the existing dynamic model of single missile and target, the dynamic models of multiple missiles and multiple virtual targets are established.Step 1.
Calculate the boundary point.Figure4 shows the geometry between the target boundary point with the target initial position and velocity. The time of the target flying a quarter of a circle with maximum overload is defined as Tqc. T0 denotes the initial point of the target; Tu1 and Tu2 represent the lateral boundary point when the target is maneuvering with a positive overload and the flight time is less and greater than Tqc, respectively; Td1 and Td2 represent the lateral boundary point when the target is maneuvering with a negative overload and the flight time is less and greater than Tqc, respectively; Tg represents the boundary point when the target is moving in a straight line without any maneuvering.Figure 4
Relative geometrical between target boundary point and initial position of target.However, the seeker can only obtain the relative information of the missile and the target, such asr, q, ṙ, and q̇; the information of the missile such as the position (xmi, ymi) and velocity (Vmi, θmi) can be obtained through its own inertial navigation device; the velocity of the target (Vt, θT) can be calculated with Eqs. (1) and (2); the target’s coordinates can be calculated as xT=xmi+rcosqi and yT=ymi+rsinqi. Suppose that at least one missile can obtain the position and velocity of the target which are transmitted to other missiles through the communication network. Then, each missile can calculate boundary points and virtual target points based on the real target information.The boundary points can be calculated as follows. WhenTp≤Tqc, then
(16)xu1=−RT1−cosαsinθt+RTsinαcosθt+xT0,yu1=RT1−cosαcosθt+RTsinαsinθt+yT0,xd1=RT1−cosαsinθt+RTsinαcosθt+xT0,yd1=−RT1−cosαcosθt+RTsinαsinθt+yT0,when Tp>Tqc, then
(17)xu2=−RT+L0sinθt+RTcosθt+xT0,yu2=RT+L0cosθt+RTsinθt+yT0,xd2=RT+L0sinθt+RTcosθt+xT0,yd2=−RT+L0cosθt+RTsinθt+yT0.What is more, the coordinates (xg, yg) of the bounded point can be calculated as:
(18)xg=VtTpcosθt+xT0,yg=VtTpsinθt+yT0,where RT=Vt2/atmax denotes the minimum turning radius of the target, θt is the flight path angle of the target, T0 is the initial position of the target denoted as (xT0, yT0), and the other variables can be calculated asTqc=πRT/2VT, α=πTp/2Tqc, and L0=VTTp−Tqc.Step 2.
Calculate the coordinates of virtual targets.Considering the scenario thatn missiles cooperatively intercept a highly maneuvering target, based on the ITDSG interception strategy, the missile’s attack range covers the escape area of the target by introducing n virtual targets. The coordinates (xiv, yiv) of the virtual targets Tivi=1,2,⋯,n can be calculated as follows. When Tp>Tqc, then
(19)xiv=−n−2i+1nRT+L0sinθt+RTcosθt+xT0,yiv=n−2i+1nRT+L0cosθt+RTsinθt+yT0.WhenTp≤Tqc, then
(20)xiv=−n−2i+1nRT1−cosαsinθt+RTsinαcosθt+xT0,yiv=n−2i+1nRT1−cosαcosθt+RTsinαsinθt+yT0,where n−2i+1/ni=1,2,⋯,n is designed to adjust the position of ith virtual target in the normal direction of target velocity. By setting the virtual targets, the reachable sets of all missiles can cover the escape area of the target. In Eqs. (19) and (20), Tp determines the values RT and L0, which is defined as follows:
(21)Tpt=Tpmax,t<TsTgop−t−δt,Ts≤t≤Te0,t>Te,where Ts=Tgop–δt−Tpmax, Te=Tgop−δt, Tgop=Tgo0, Tpmax, and δt are the given positive constants and t represents the flight time.As a result, by applying Eqs. (19)–(21), the position of virtual targets (xiv, yiv) (i=1,2,⋯,n) can be obtained.Step 3.
Establish the dynamic model.Similar to Eq. (7), the dynamic models of multiple missiles attacking multiple virtual targets based on the information of the virtual targets can be written as follow
(22)ẋ1iv=riv2ṙiv2x2iv2−Ṫfiv∗−rivṙiv2uri+driv,ẋ2iv=−2ṙivrivx2iv−1rivuqi+dqiv,where x1iv=tgoiv+t−Tfiv=−riv/ṙiv+t−Tfiv; x2iv=q̇iv; riv=xiv−xmi2+yiv−ymi2; q̇iv=dq/dt; ṙiv=dr/dt;qiv=arctanyiv−ymi/xiv−xmi; xmi and ymi are the coordinates of missile i, which are obtained from the missile’s inertial navigation system, xiv and yiv cannot be measured, which can be calculated by Step 1 and Step 2. Besides, driv=riv/ṙi2wr+driϵ and dqiv=1/rivwq+dqiϵare the disturbances, where wr and wq are the components of the real target’s acceleration in LOS and norm LOS directions and driϵ and dqiϵ are the virtual acceleration caused by the virtual target approaching the real target.In the initial stage of intercepting, theith missile is aiming at the ith virtual target. Then, with the time t tending to Te, the virtual targets are approaching the real target. In the final stage, the virtual targets and real target are coincident, that is, all missiles aim at the real target.


## 3.3. The Guidance Law Design of ITDSG

In this section, an adaptive dynamic inverse method is used to decouple and linearize Eq. (22); then, the ITDSG is designed with a prescribed-time stable control method. Equation (22) can be rewritten as
(23)ẋi=fixi+gixiui+dit,where
(24)fixi=riv2ṙiv2x3iv2−2ṙivrivx3iv,ui=uriuqi,gixi=−rivṙiv200−1riv,dit=drivdqiv.Applying Lemma4, the disturbances driv and dqiv can be estimated by d^riv and d^qiv with two ESOs, and there exist bounded real numbers η1i>0 and η2i>0 satisfying ∣driv−d^riv∣≤η1i,∣dqiv−d^qiv∣≤η2i. The inverse matrix of gixi can be calculated as follows:
(25)gixi−1=−ṙi2ri00−ri.According to the dynamic inverse method, the controller can be computed as follows:(26)uit=gixi−1Vit−fixi−dit.Substituting the above controlleruit into Eq. (23), we obtain
(27)ẋit=Vit.The above equation is the expected linearization one;Vit is the desired dynamic equation of xi, considering the estimation errors of the disturbances and applying prescribed-time control method; the desired dynamic equation of xi can be designed as:
(28)Vit=−Kitxi,where
(29)Kit=diagk11i+k12iμt.μt+η1isignx1iv,k21i+k22iμt.μt+η2isignx1iv,is a diagonal matrix to be designed, where k11i>0, k12i>0, k21i>0, k22i>0, η1i, and η2i are the parameters of controller.Finally, combining with the Eqs. (26)–(28), the controller is designed as Eq. (30).Based on the above design method of the decoupled guidance model, a nonlinear and strong coupled guidance problem can be transformed into linear control stabilization problem. By designing the controller, all state variables can converge to 0.x1iv=0 means tgofii=1,2,⋯,n of all n missiles tend to a same value. When x2iv=0 is satisfied, each missile can be guaranteed to hit the target.
(30)uriuqi=ṙiv2riv−k11i+k12iμt.μt+η1isignx1ivx1iv−rivṙiv2x2iv2+uinom−d^riv−rivk21i+k22iμt.μt+η2isignx2iv−2ri.x2iv−d^qi.Remark 6.
It is easy to obtain that, ast tends to T, μt and μ̇t/μt both approach to infinity, which may cause the control input to be infinity. However, the state values x1i and x2i will approach zero at the prescribed-time T, such that the control input uri and uqi are both bounded, which has been proved in Ref. [31]. In addition, due to the use of a prescribed-time control method, the convergence rate of the state variables is slower in the initial phase, when the time t approaches T, the convergence rate gradually increases. This will avoid large control inputs in the initial stage, which is more conducive to engineering realization.Theorem 7.
For the multiple-missile and multiple-virtual target system Eq. (23), suppose that the disturbances dri and dqi can be estimated by ESOs designed as Eq. (14). The proposed guidance Eq. (30) can guarantee that all the tgofi converge to a same value (all the missiles hit the target simultaneously), and q˙i converges to 0 (each missile can hit the target) in a prescribed-time T, respectively.Proof.
Define the following Lyapunov candidate function:(31)V1=12xiTxi.The derivative of Eq. (31) is given as
(32)V̇1=xiTẋi.By applying Eqs. (30) and (23) to Eq. (32) and rearranging, the following inequality can be obtained:
(33)V̇1=x1ivẋ1iv+x2ivẋ2iv=x1ivriv2ṙiv2x3iv2+d^riv−rivṙiv2uri+x2iv−2rivṙivx3iv+d^qiv−1rivuqi=x1ivψ1t+η1isignx1iv−d^riv+drivx1iv+x2ivψ2t+η2isignx2iv−d^qiv+dqivx2iv,where ψ1t=−k11i+k12iμt/μt$ and $ψ2t=−k21i+k22iμt/μt.Since∣−d^riv+driv∣≤η1i,∣−d^qiv+dqiv∣≤η2i; then, we have
(34)V̇1≤ψ1tx1iv2−ψ2tx2iv2≤−λmin1+λmin2μ̇tμtV1,where λmin1=mink11i,k21i and λmin2=mink12i,k22i. Then, according to Lemma 3, we can obtain that the state variables x1iv and x2iv gradually converge to zero in a prescribed-time T. According to the definition of x1iv and x2iv, it is clear to see that all the tgofi can converge to Tgof∗, and all the q̇i converge to zero in a prescribed-time T, respectively. Besides, the Tgof∗ can converge to a same value in a prescribed-time T by applying consensus protocol Eq. (10), which has been proved in Lemma 2.Remark 8.
The convergence speed of the system states is controllable with the proposed guidance law in this paper. From Eq. (21), it can be seen that the time for the virtual target to approach the real target is determined by Te. By applying the prescribed-time convergence protocol, the desired flight time Tgofi of the missiles converge to a same value at time T. In addition, by introducing a time-varying scaling function, the convergence time of the LOS angular rates q̇i and the times-to-go Tgoi of the missiles are also determined by the prescribed-time T. In other words, by setting different values of Te and T, the convergence speed of multimissile cooperative attack a highly maneuvering target can be set arbitrarily.


## 4. Simulation

To illustrate the effectiveness and superiority of the proposed ITDSG, we design two groups of simulations in the scenario of three missiles cooperative attacking a target with constant velocity and highly maneuvering target, respectively. Simulations with the slide mode cooperative guidance law (SMCG) in [21] are carried out for comparison.


### 4.1. Case 1: Constant Velocity Target

Let us consider the scenario of three missiles attacking single target from different directions; the first group simulations are performed to verify the performances of the proposed ITDSG compared with SMCG.Table1 shows the simulation initial conditions of three missiles. Suppose that the target has a constant velocity, and the initial position of the target is (−10000 m, 0 m), the initial flight path angle of the target is θT0=0°.Table 1
Simulation conditions for missiles.
MissileInitial position (m)θmi0 (°)ami (g)Vmi0 (m/s)R0 (km)Missile 1(8000, 0)2±30 g60018Missile 2(9000, 1500)6±30 g60019Missile 3(7000, -800)-6±30 g60017Assume that the communication network graph of three missiles is connected and undirected, Figure5 shows the communication typology between the three missiles.Figure 5
Communication topology for three missiles.The ESO parameters in LOS and normal LOS direction are the same; they are set asγ11=200, γ12=300, δ=0.01, and μ=0.5. The parameters of ITDSG are set as k11i=1, k12i=1, k21i=0.5, k22i=1, η1i=0.1, and η2i=0.05; besides, the parameters of μt are set as h=2 and T=19; what is more, there are two parameters for calculation of virtual targets Tpmax=8 and δt=1.5. In order to compare SMCG with ITDSG under the same conditions, we set the desired LOS angles of SMCG as the same with the terminal LOS angles qfi (i=1,2,3) of ITDSG.Note 1.
Since the energy of the missile is limited, so the smaller energy needs to provide by the guidance law is, the more favorable application the guidance law is. Therefore, an energy consumption evaluation indicators are defined as Eq. (35).
(35)Jur=∫0turtdt,Juq=∫0tuqtdt.Figure6 shows the trajectories of the real target and virtual targets, where T denotes the real target and Tup, Tdown, and Tgo denote the virtual target from different directions. Figure 7 shows the comparative simulation results of three missiles against a target with SMCG and ITDSG methods, in the scenario of three missiles cooperatively hitting a constant velocity target. Further, Figure 6 shows the trajectories of real target and virtual targets; in ITDSG, all missiles aim the virtual targets. It is clear to see that all the three virtual targets gradually approach the real target.Figure 6
Virtual targets with constant velocity target.Figure 7
Simulation curves for a constant velocity target.
(a)
Trajectories for missiles and target(b)
Distance between missiles and target(c)
LOS angles for missiles(d)
Time-to-go for missiles(e)
Accelerations on the LOS direction(f)
Accelerations on the normal LOS directionThe effectiveness of the proposed ITDSG against a constant velocity target can be verified as follows: Figures7(a)–7(c) show that all of the missiles can hit the target simultaneously, which indicates that the proposed ITDSG subject to the decoupled model is effective for the time consistency. Figure 7(c) shows that all missiles with ITDSG approach the real target from different directions, which shows that the proposed dynamic surrounding attack strategy and the cooperative guidance law are effective.In terms of missile trajectories, ITDSG has a better performance than SMCG in Figure7(a). In the initial stage, the trajectories of ITDSG are smoother than SMCG; then, in the final stage, the trajectories are similar. The reason is that when applying SMCG, there are bigger errors between the initial LOS angles and desired angles of each missile; in order to decrease the errors, larger lateral accelerations must be generated to change the missile’s flight path to meet the constraint of LOS angles; but when applying the proposed ITDSG strategy, all the missiles aim at the virtual targets, and there are no LOS angle constrains; thus, the missile’s trajectories are relatively smooth. With the same reason, Figure 7(f) shows that in the initial stage the control inputs uq in SMCG are bigger than in ITDSG. In the whole guidance process, the energy consumption in ITDSG is also smaller than in SMCG that is listed in Table 2.Table 2
Energy consumption.
JuMissileCase 1Case 2ITDSGSMCGITDSGSMCGJur (m/s2)Missile 1254.4220.4314.51025.4Missile 2133.986.5217.9167.8Missile 3222.5565.9504.6548.4Juq (m/s2)Missile 1553.91024.71021.51858.7Missile 253.741.8944.9911.1Missile 3647.34605.31076.71740.4In terms of the impact time, the SMCG and ITDSG have the same performance. From the simulation curves in Figure7(d), it is clear that even though the missile initial values of tgoi are different, they can converge to the same value under the action of uri, which indicates that the SMCG and the proposed ITDSG law subject to the decoupled model with ITDSG strategy are both effectiveness in impact time. Besides, in Figure 7(e), bigger accelerations in the LOS direction are generated because of the bigger errors between the times-to-go and their desired values of different missiles. What is more, Figures 7(e) and 7(f) show clearly that there are small fluctuations of acceleration curves in LOS and normal LOS directions with ITDSG after 9 seconds, which is caused by the maneuver of virtual target approach the real target.As a result, in the scenario of intercepting a constant velocity target, ITDSG and SMCG both show good performance. Because ITDSG uses a dynamic surrounding attack strategy without LOS angle constraint, the trajectories by ITDSG are smoother than that by SMCG; the accelerations in normal LOS directions are also smaller.


### 4.2. Case 2: Highly Maneuvering Target

In this case, the performance of the proposed ITDSG is investigated in the scenario of three missiles attacking single highly maneuvering target from different directions.In order to further illustrate the superiority of ITDSG over SMCG, simulations are conducted with the same cooperative guidance laws and the same missile parameters as those in Case 1, the only difference is that the target maneuver with a bigger overloadnt=8gsinπ/4t, where g=9.8 m/s2. Furthermore, the selection principle of qfi (i=1,2,3) in SMCG is the same as in Case 1. Figure 8 shows the curves of virtual targets with highly maneuvering target subject to the real target motion.Figure 8
Real and virtual targets with high maneuvering.Similar to Case 1, Figure8 shows the trajectories of the real target and virtual targets, where T denotes the real target and Tup, Tdown, and Tgo denote the virtual target from different directions; Figure 9 shows the effectiveness of the proposed ITDSG strategy against a highly maneuvering target. Figures 9(a) and 9(c) show that the proposed dynamic surrounding attack strategy is effective; three missiles can intercept the target from different directions; Figures 7(a), 7(d), and 7(b) show that the proposed ITDSG is also effective for the time consistency.Figure 9
Simulation curves for a highly maneuvering target.
(a)
Trajectories for missiles and target(b)
Distance between missiles and target(c)
LOS angles for missiles(d)
Time-to-go for missiles(e)
Accelerations on the LOS direction(f)
Accelerations on the normal LOS directionSimilar to the analysis in Case 1, Figure9(a) shows that trajectories of ITDSG are smoother than SMCG; Figure 9(f) and Table 2 show that the maximum overloads in LOS and normal LOS directions of ITDSG are smaller than SMCG, and the total control energy of ITDSG is also smaller. The time constraint performance of the ITDSG is the same as SMCG, which shows in Figures 9(b) and 9(d). What is more, the difference between Case 1 and Case 2 is that the acceleration curves of all missiles in the two directions can both converge but not zero due to the target maneuver.As a result, the proposed guidance law ITDSG can be suitable for constant velocity speed as well as highly maneuvering target. Besides, by introducing virtual targets instead of impact LOS angle to achieve dynamic surrounding attacks, ITDSG has better performance in trajectories and energy consumption than SMCG.


## 4.1. Case 1: Constant Velocity Target

Let us consider the scenario of three missiles attacking single target from different directions; the first group simulations are performed to verify the performances of the proposed ITDSG compared with SMCG.Table1 shows the simulation initial conditions of three missiles. Suppose that the target has a constant velocity, and the initial position of the target is (−10000 m, 0 m), the initial flight path angle of the target is θT0=0°.Table 1
Simulation conditions for missiles.
MissileInitial position (m)θmi0 (°)ami (g)Vmi0 (m/s)R0 (km)Missile 1(8000, 0)2±30 g60018Missile 2(9000, 1500)6±30 g60019Missile 3(7000, -800)-6±30 g60017Assume that the communication network graph of three missiles is connected and undirected, Figure5 shows the communication typology between the three missiles.Figure 5
Communication topology for three missiles.The ESO parameters in LOS and normal LOS direction are the same; they are set asγ11=200, γ12=300, δ=0.01, and μ=0.5. The parameters of ITDSG are set as k11i=1, k12i=1, k21i=0.5, k22i=1, η1i=0.1, and η2i=0.05; besides, the parameters of μt are set as h=2 and T=19; what is more, there are two parameters for calculation of virtual targets Tpmax=8 and δt=1.5. In order to compare SMCG with ITDSG under the same conditions, we set the desired LOS angles of SMCG as the same with the terminal LOS angles qfi (i=1,2,3) of ITDSG.Note 1.
Since the energy of the missile is limited, so the smaller energy needs to provide by the guidance law is, the more favorable application the guidance law is. Therefore, an energy consumption evaluation indicators are defined as Eq. (35).
(35)Jur=∫0turtdt,Juq=∫0tuqtdt.Figure6 shows the trajectories of the real target and virtual targets, where T denotes the real target and Tup, Tdown, and Tgo denote the virtual target from different directions. Figure 7 shows the comparative simulation results of three missiles against a target with SMCG and ITDSG methods, in the scenario of three missiles cooperatively hitting a constant velocity target. Further, Figure 6 shows the trajectories of real target and virtual targets; in ITDSG, all missiles aim the virtual targets. It is clear to see that all the three virtual targets gradually approach the real target.Figure 6
Virtual targets with constant velocity target.Figure 7
Simulation curves for a constant velocity target.
(a)
Trajectories for missiles and target(b)
Distance between missiles and target(c)
LOS angles for missiles(d)
Time-to-go for missiles(e)
Accelerations on the LOS direction(f)
Accelerations on the normal LOS directionThe effectiveness of the proposed ITDSG against a constant velocity target can be verified as follows: Figures7(a)–7(c) show that all of the missiles can hit the target simultaneously, which indicates that the proposed ITDSG subject to the decoupled model is effective for the time consistency. Figure 7(c) shows that all missiles with ITDSG approach the real target from different directions, which shows that the proposed dynamic surrounding attack strategy and the cooperative guidance law are effective.In terms of missile trajectories, ITDSG has a better performance than SMCG in Figure7(a). In the initial stage, the trajectories of ITDSG are smoother than SMCG; then, in the final stage, the trajectories are similar. The reason is that when applying SMCG, there are bigger errors between the initial LOS angles and desired angles of each missile; in order to decrease the errors, larger lateral accelerations must be generated to change the missile’s flight path to meet the constraint of LOS angles; but when applying the proposed ITDSG strategy, all the missiles aim at the virtual targets, and there are no LOS angle constrains; thus, the missile’s trajectories are relatively smooth. With the same reason, Figure 7(f) shows that in the initial stage the control inputs uq in SMCG are bigger than in ITDSG. In the whole guidance process, the energy consumption in ITDSG is also smaller than in SMCG that is listed in Table 2.Table 2
Energy consumption.
JuMissileCase 1Case 2ITDSGSMCGITDSGSMCGJur (m/s2)Missile 1254.4220.4314.51025.4Missile 2133.986.5217.9167.8Missile 3222.5565.9504.6548.4Juq (m/s2)Missile 1553.91024.71021.51858.7Missile 253.741.8944.9911.1Missile 3647.34605.31076.71740.4In terms of the impact time, the SMCG and ITDSG have the same performance. From the simulation curves in Figure7(d), it is clear that even though the missile initial values of tgoi are different, they can converge to the same value under the action of uri, which indicates that the SMCG and the proposed ITDSG law subject to the decoupled model with ITDSG strategy are both effectiveness in impact time. Besides, in Figure 7(e), bigger accelerations in the LOS direction are generated because of the bigger errors between the times-to-go and their desired values of different missiles. What is more, Figures 7(e) and 7(f) show clearly that there are small fluctuations of acceleration curves in LOS and normal LOS directions with ITDSG after 9 seconds, which is caused by the maneuver of virtual target approach the real target.As a result, in the scenario of intercepting a constant velocity target, ITDSG and SMCG both show good performance. Because ITDSG uses a dynamic surrounding attack strategy without LOS angle constraint, the trajectories by ITDSG are smoother than that by SMCG; the accelerations in normal LOS directions are also smaller.


## 4.2. Case 2: Highly Maneuvering Target

In this case, the performance of the proposed ITDSG is investigated in the scenario of three missiles attacking single highly maneuvering target from different directions.In order to further illustrate the superiority of ITDSG over SMCG, simulations are conducted with the same cooperative guidance laws and the same missile parameters as those in Case 1, the only difference is that the target maneuver with a bigger overloadnt=8gsinπ/4t, where g=9.8 m/s2. Furthermore, the selection principle of qfi (i=1,2,3) in SMCG is the same as in Case 1. Figure 8 shows the curves of virtual targets with highly maneuvering target subject to the real target motion.Figure 8
Real and virtual targets with high maneuvering.Similar to Case 1, Figure8 shows the trajectories of the real target and virtual targets, where T denotes the real target and Tup, Tdown, and Tgo denote the virtual target from different directions; Figure 9 shows the effectiveness of the proposed ITDSG strategy against a highly maneuvering target. Figures 9(a) and 9(c) show that the proposed dynamic surrounding attack strategy is effective; three missiles can intercept the target from different directions; Figures 7(a), 7(d), and 7(b) show that the proposed ITDSG is also effective for the time consistency.Figure 9
Simulation curves for a highly maneuvering target.
(a)
Trajectories for missiles and target(b)
Distance between missiles and target(c)
LOS angles for missiles(d)
Time-to-go for missiles(e)
Accelerations on the LOS direction(f)
Accelerations on the normal LOS directionSimilar to the analysis in Case 1, Figure9(a) shows that trajectories of ITDSG are smoother than SMCG; Figure 9(f) and Table 2 show that the maximum overloads in LOS and normal LOS directions of ITDSG are smaller than SMCG, and the total control energy of ITDSG is also smaller. The time constraint performance of the ITDSG is the same as SMCG, which shows in Figures 9(b) and 9(d). What is more, the difference between Case 1 and Case 2 is that the acceleration curves of all missiles in the two directions can both converge but not zero due to the target maneuver.As a result, the proposed guidance law ITDSG can be suitable for constant velocity speed as well as highly maneuvering target. Besides, by introducing virtual targets instead of impact LOS angle to achieve dynamic surrounding attacks, ITDSG has better performance in trajectories and energy consumption than SMCG.


## 5. Conclusion

In this paper, we developed a new dynamic surrounding attack cooperative guidance law against highly maneuvering target without a preset LOS angle constraint. Firstly, we proposed the strategy of dynamic surrounding attack by introducing virtual targets and then established the cooperative guidance models between multiple missiles and multiple virtual targets. Finally, by using the dynamic inverse method to decouple the coupled cooperative guidance model, and the ITDSG subject to the decoupled model is designed based a prescribed-time stable method. Additionally, ESOs are introduced to estimate the disturbances in the LOS and normal LOS directions. In order to demonstrate the effectiveness and superiority of the proposed ITDSG, two groups of comparison simulations are carried out with SMCG in the scenarios of three missiles cooperative attack a constant velocity or highly maneuvering target.Compared with the existing works, the advantages of the proposed ITDSG are that it does not require to set desired LOS angles in advance, and the couples in the cooperative guidance model are also considered. The limitation of the proposed guidance law in this paper lies in the need for precise target information, such asq, q̇, r, and ṙ. In the future work, we would develop a novel cooperative guidance law with dynamic surrounding attack when there are seeker measurement errors.



---

*Source: 6623561-2021-04-19.xml*