Target Tracking Based on a Nonsingular Fast Terminal Sliding Mode Guidance Law by Fixed-wing Uav

This paper proposes a modified nonsingular fast terminal sliding mode (NFTSM) guidance law to solve the problem of ground moving target tracking for fixed-wing unmanned aerial vehicle (UAV) in a planar environment. Firstly, the loitering algorithm is analysed, which can steer the UAV to follow and circle around a ground moving target with the desired distance by heading angle control. Secondly, the effects of different parameters on the convergence time of sliding manifold is presented which is helpful for the designing of sliding manifold. Singularity can be avoided by using a modified saturation function which is obtained through a small range around the null point. Moreover, the NFTSM sliding manifold is used in the loitering algorithm. By using the Lyapunov theory, the finite-time convergence of the proposed method has been proved in the the reaching phase and the sliding phase. In order to verify the approach's feasibility and benefits, numerical simulations are performed by using a moving target with three different motion states in comparison with the conventional sliding model control method. Simulation results indicate that, under the proposed NFTSM guidance law, the UAV can reach the desired distance in a short time.


Introduction
With higher levels of autonomy, unmanned aerial vehicle (UAV) plays an important role in various complex tasks in civilian or military fields [1].To increase the level of autonomy and reduce the dependencies on manual operators, various planning and control strategies have been developed regarding the problem of target tracking, target acquisition, disaster rescue and so on [2][3][4].As one of the most complicated and important problems, the target tracking is regarded as a guidance law problem in this paper, assuming the target motion to be observed in the monitoring range.In addition, tracking a moving target by fixed-wing UAV is more challenging than following a predefined path because the target can vary its speed quickly over a large range while the UAV must keep moving forward to stay in the air.Meanwhile, the method for solving the problem of target tracking can be used in the path-following problem by considering the tracked target as a virtual target point on the desired path [5].
When executing the missions such as aerial search or aerial observation, the UAV is often required to orbit around a ground target at a desired distance [6] or maintain the target within a certain distance in front of UAV [7].Based on the previous studies, the fight strategy for fixed-wing UAV can be divided into a loitering-pattern and following-pattern.Different from the vertical take-off and landing (VTOL) UAV (e.g., quadrotor), the fixed-wing UAV is constrained by the lower bound according to the stall condition.When the target's speed is lower than the minimum speed of the UAV, the circumnavigation is executed to circle around the target within monitoring range [8].However, when the speed of the target is close to the UAV, the aircraft should be guided to follow the target by the following pattern.
In previous works, various algorithms have been developed to the problem of target tracking for UAV.The differential geometry is adopted to solve the problem of rendezvous and target tracking guidance laws in [9].The proposed method has the advantage of rigorous stability as well as less tuning parameters.By implementing Lyapunov vector fields, the guidance laws for unmanned aircraft applications are presented in [10,11].The vector fields have proven to be globally stable for circular loiter patterns.The concept of Hopf bifurcation is first applied to the standoff tracking problem [12].It has been verified that the convergent speed of the proposed algorithm to desired distance is faster than the Lyapunov vector field approach.The target tracking problem is studied based on game theory [13].The control strategy proposed in this study ignores the target's motion.In addition to the nonlinear control method, the model predictive control (MPC) [14,15], backstepping-based controller [16,17] and sliding mode control (SMC) [18] are presented to get good performance of target tracking.
Due to the existence of the more maneuverable target, the problem of target tracking is more suitable to be solved by SMC so that the feature of sliding manifold can drive the UAV to maintain the desired distance.In order to reduce the effect of unmodelled dynamics and disturbances, the target tracking guidance algorithm is introduced by using SMC based on the tangent vector field [19].The artificial potentials and SMC are combined to solve the problem of a maneuvering target tracking [20].A class of the second-order sliding mode for the ground moving target tracking with special unknown bounded uncertainty has been proposed in [21].In addition, the designed sliding manifold is linear in general SMC [18].Although the tracking error can converge to zero and the convergence speed can be adjusted by selecting different parameters, it cannot converge to zero in finite-time [22].The linear sliding manifold can only concern the exponential stability during the sliding phase; as a result, it is difficult for the tracking accuracy to ensure [23].
As aforementioned, this study aims at developing the problem of moving target tracking for the sake of reaching the desired distance as fast as possible.In order to achieve the finite time convergence in the sliding phase, the modified nonsingular fast terminal sliding mode (NFTSM) guidance law, whose sliding mode manifold is a nonlinear function, is applied to solve the problem of ground moving target tracking for fixed-wing UAV in a planar environment.Contrary to the NFTSM technology used in the problem of missile guidance [24], this paper steers the UAV to maintain a desired distance to the target and make the azimuth angle a variable.
The overall structure of this paper is organized as follows: Section 2 mainly introduces the UAV dynamic model and the relative motion model.In Section 3, a modified NFTSM manifold is analyzed and designed.Furthermore, the ground moving target tracking approach for fixed-wing UAV based on modified NFTSM guidance law is proposed in this section.Subsequently, some simulation result analysis is provided in Section 4, and and the conclusions are described in Section 5.

UAV Dynamic Model
The vehicle dynamics are based on a simplified flight dynamics model called coordinated flight vehicle (CFV) widely used in most literature [25,26].The CFV model is described by ordinary differential equations of reasonable complexity, and captures the nonlinear dynamics of maneuvering flight at the same time.We assume that the UAV has a reliable flight control system, which effectively controls the aerodynamic surfaces to accurately track velocity and turn rate commands.Therefore, the UAV's motion can be simplified on the horizontal plane in the presence of environmental wind, which can be described by the following equations: where x a , y a are the UAV's horizontal position in inertial coordinate system; ẋa , ẏa denotes the UAV's velocity component in the xand y-axis, respectively; ψ a ∈ (−π, π] is the UAV's heading angle which is the included angle between velocity direction and x-axis; u a denotes the acceleration command and v a is the airspeed, which is set to a constant value; and ω ψ represents the command of heading rate, which is the control object in this paper, with the constraint For the single-UAV-single-target tracking problem in this study, we suppose that the UAV speed is constant and track the target by holding the altitude constant through the zero climb rate.In addition, (W x , W y ) T is the wind disturbance, and it is easy to get that W x = v w cos ψ w and W y = v w sin ψ w , where v w and ψ w denote the speed and the direction of wind disturbance.In the actual application of UAV, the airspeed v a and the heading angle ψ a cannot be obtained easily due to UAV's scale constraints.For the micro-UAV, the groundspeed v g and the course angle χ a can be achieved through the external sensors.Therefore, Equation (1) can be rewritten as the relation between the airspeed v a and the groundspeed v g can be constructed as and the course rate inputs with the restriction |u χ | ≤ χmax can be given as follows: where . Note that, in the absence of wind, (i.e.,

Relative Motion Model
We suppose that the model of the target is similar to the UAV model as shown in Equation (1) with adding the speed command vt = a t .Namely, the acceleration a t and turning rate ω t of target are defined as the command for target maneuver strategy.The motion state of target can be summarized as (x t , y t , v t , ψ t ).Due to the fact that the detailed control information cannot be obtained by UAV, the extended Kalman filter (EKF) [27] is utilized to estimate the motion of target in this paper as follows: where motion state in EKF can be redefined as X k = (x t , ẋt , y t , ẏt ) T with ẋt = v t cos ψ t and ẏt = v t sin ψ t .Therefore, the state equation can be expressed as [28] , where T s is sampling time.In addition, ζ k with P(ζ) ∼ N(0, Q) is the zero-mean white Gaussian noise, and is the corresponding covariance matrixes.V(κ) is the variance of κ.Assuming that the sensor is fixed at the inertial frame origin, so that the observed value can be defined as Z k = (r t , αt ) T .rt is the observed distance between the target and the sensor, while αt is the azimuth angle.The observation equation H t in Equation ( 4) can be given as where k with P( ) ∼ N(0, P) is the zero-mean white Gaussian observation noise, and P = diag(V( r ), V( α )) is the corresponding covariance matrixes.
Defining the target reference frame by setting the origin of frame at target inertial position, such that the target is relatively static.Figure 1 depicts the relative position between the target and UAV in inertial reference frame and target reference coordinate.The relative motion model between the two vehicles can be described by [29] where R d is the desired separation distance between target and UAV; r = L − R d denotes the distance error, where L = x 2 r + y 2 r = (x − x t ) 2 + (y − y t ) 2 is defined as the distance of two vehicles.In addition, λ = θ − π/2 ∈ (0, 2π] is the auxiliary parameter, and θ = arctan ((y − y t ) (x − x t )) represents the azimuth angle of UAV in the target-frame.It is noteworthy that the target may flee away from the monitoring range of UAV when the speed of target is greater than the maximum speed of the UAV.Hence, it should be limited in Remark 1 in order to avoid task failure.
Remark 1.The UAV and wind speeds are assumed to satisfy 0 ≤ v t + v w < v a .

Definition 1. (Target Tracking
Problem) The objective of the target tracking problem is to design the guidance input ω ψ such that the following conditions are satisfied for the UAV in finite time T f : The purpose of the above conditions is to make the status of the tracking system converge in finite time: (i) the distance convergence requires the position of the UAV will merge into the desired distance to the target; (ii) the direction of velocity convergence asks for the vehicle follows an appropriate heading angle (or course angle); and (iii) the convergence of the state (r(t)) and ṙ(t) will be reached.

Loitering Algorithm
Form the Definition 1, the goal of the target tracking is to keep the distance error as small as possible.However, Equation (5) indicates that there is no direct relationship between the distance error r and the UAV's heading angular velocity ω ψ .Consequently, the control strategy should be designed to drive the distance error r to zero.Therefore, it is reasonable to set ṙ = 0, namely, In order to simplify the formula complexity, define ψ * = ψ * − λ, the steady value of ψa can be given by ψd a = arcsin From Equation ( 7), the control goal in Definition 1 is replaced as to drive ψa to ψd a , such that ṙ(t) → 0. In this condition ψa = ψd a , the distance L reaches its steady state with no changing.Defining the heading angle error is ψa = ψa − ψd a , ψa ∈ (−π, π].By using the trigonometric identities cos σ = 1 − 2 sin 2 (σ/2) and sin σ = 2 sin(σ/2) cos(σ/2), the dynamics of the distance error in Equation ( 5) is rewritten as Therefore, the monotonicity of ṙ is the same as the monotonicity of ψa , and ṙ • r ≤ 0 is equivalent to ψa • r ≤ 0.
Hence, one needs to construct a monotonic function f (r) satisfying ψa = − f (r).On account of ψa ∈ (−π, π], we define f (r), for example, as follows Definition 2. The target tracking problem defined in Definition 1 can be redefined feasibly as: designing the turning rate ω ψ to drive the following condition for UAV: where ψa = ψ a − λ − ψd a , while ψ a can be controlled directly by ω ψ .
From Equation ( 5), factors that determine the relative motion between the UAV and the target include not only distance error rate ṙ but also azimuth angle rate λ.Definitions 1 and 2 just consider r convergence to zero, with λ as a free variable.The UAV flying circle around the ground target is intuitive when the UAV's speed is larger than the target's.In addition, the UAV follows behind the target at the desired distance.Therefore, the UAV is loitering around the target due to the target's maneuver.The desired position trajectory forming a circle with a radius of R d divides the plane into two parts.This feature is suitable for using the sliding mode control method, in which the sliding manifold is designed to generate the appropriate circle trajectory for the heading angle to reach control objectives.The next section will apply SMC to design a guidance law to satisfy the conditions in Definitions 1 and 2.

Sliding Manifold Designing
For the problem of SMC designing, a switching surface providing the desired convergence characteristic should be defined at first.Then, a controller should be designed to steer the objective states to the chosen manifold, which is not influenced by disturbances or uncertainties.Definition 3. The conventional terminal sliding mode (TSM) can be described by the following first-order nonlinear differential equation [30]: where x ∈ R, sig β (x) = sign(x) • |x| β and sign(x) is the signum function.s is the sliding manifold.
As shown in Figure 2, let the initial state be x(0) = 5, and the properties of system (11) can be summed as: (i) when β 1 = 1, the system will reduce to ẋ = −α 1 x, and the system is exponentially stable; (ii) when 0 < β 1 < 1, the convergence rate increased gradually with the increase in distance from zero.This result is interesting as it can make the system converge in finite-time; (iii) when β 1 > 1, the system will converge to origin with a high speed at a distance from zero, but its convergence rate will slow down when close to the origin.The convergence rate is inversely proportional to the distance from zero.In addition for fixed parameters β 1 , convergence rate has the same monotony as α 1 .x Remark 3. From the finite-time differential equation, the dynamics (11) are globally finite-time stable with any given initial condition x(0) = x 0 , and the convergence time can be obtained as As mentioned above, the convergence rate has an obvious difference with different α 1 and β 1 .It is best to combine the two ways with 0 < β 1 < 1 and β 1 > 1.Therefore, the linear combination which is developed as follows not only improves the convergence rate, but is also easy to achieve.Definition 4. The fast terminal sliding mode (FTSM) is described by the following differential equation: From Definition 4, it is evident that FTSM is the combination of different α 2 , α 3 , β 2 and α 4 cases.When the system state is far from the equilibrium point, the subitem in Equation ( 12) α 2 sig β 2 (x) dominates α 3 sig β 3 (x), which provides a high convergence rate.However, the main term α 3 sig β 3 (x) guarantees the system converge in finite-time when the system state is close to the equilibrium.Therefore, the whole FTSM will converge very quickly.Figure 3 shows that the FTSM has a better convergence rate than the TSM (when α 2 = 0, β 2 = 0).The result is verified by the following sliding modes setting the initial state x(0) = 6: Remark 4. By solving the differential Equation ( 12), x = 0 will be reached in a finite time for any initial condition x(0) = x 0 [31]: The definition of the Gaussian hypergeometric function F(•) can be given as follows: where the beta function is B(x, y) = 1 0 t x−1 (1 − t) y−1 dt.F(•) will keep T FTSM in Remark 4 convergent, which is demonstrated in [32].The exact form of F(•) varies with the involved parameters.For example, Furthermore, differentiating Equations ( 11) and ( 12) with respect to time yields From Equations ( 13) and ( 14), the singularity will occur when x = 0 and ẋ = 0 due to β 1 − 1 < 0, β 3 − 1 < 0. In order to avoid this problem, the modified nonsingular fast terminal sliding mode (NFTSM) manifold is proposed in Definition 5.

Definition 5.
The NFTSM manifold in this paper can be proposed as follows: where α 2 , α 3 > 0, β 2 ≥ 1, and σ(x) ∈ R is defined as , and η is defined as a small positive constant.
The time derivative of Equation ( 15) can be expressed as From Equations ( 15) and ( 16), the proposed NFTSM manifold in Definition 5 is nonsingular and its time derivative is continuous.

Guidance Law
In the subsection, the guidance command ω ψ is designed for Equation (5) by using the NFTSM manifold given in Equation (15).From Definition 2, the control goal of this study is to regulate ψa = − f (r) to zero.According to Equation (15), we can redefine a new f (r) = α 2 sig β 2 ( ) + α 3 σ( ), where = arctan (k 1 r), k 1 > 0. From Equation ( 8), the NFTSM manifold s defined in Equation ( 15) can be designed as follows: where η being a small positive constant.These coefficients α 2 > 0, 2 are gains to be designed.
To make the UAV state quickly converge to the manifold s defined in Equation ( 17) from the initial states, we select the fast reaching law as follows: where k 2 > 0, k 3 > 0 and 0 < γ 1 < 1. Definition 6.Using the Equations ( 16)-( 18), the NFTSM guidance law is proposed as follows: From Equation ( 7), ψd a can be expressed as where va = 0 according to the hypothesis that the airspeed of UAV does not change.

Stability Analysis
Lemma 1. Suppose the continuous positive definite function V(t) satisfies the following inequality: where t 0 is the initial time (see [30]).Then, the system converges to the equilibrium point in finite time t f , and the setting time can be given by Theorem 1.For the loitering algorithm described by Definition 2, if the NFTSM manifold is provided by Equation (15), then the distance error r in Equation (5) converges to zero under the guidance law defined in Equation (19) in finite-time time.
Due to ψa ∈ (−π, π], we can then get the inequality as follows: According to ∈ (−π/2, π/2], it is reasonable to set the following inequality: From Equation ( 7) and Remark 1, we obtain ψd a ≤ arcsin ξ with ξ = Let ψa ∈ (−π/2, π/2], the range in Equation ( 28) can be further reduced by using the Equation ( 26) as follows: Let V 2 = r 2 /2 be a Lyapunov candidate.Applying Equations ( 8) and ( 26), on the manifold s = 0, the time derivative of V 2 can be written as Consequently, the distance error r will make converge to the region | | ≤ η asymptotically in finite-time.By using Equation ( 26), we can obtain Case 2: if | | ≤ η, it shows that will converge to the region | | ≤ η in finite-time.By using Equation (17), we obtain Therefore, we can conclude that | ψa | will converge to the bounded domain in finite time, which implies that the desired control constraint is held and the state r will converge to zero in finite-time.

Simulation Results
In this section, the numerical simulation results are presented to demonstrate the effectiveness of the proposed guidance law.Three sets of simulations are performed: (1) when the target is stationary; (2) when the target is moving with constant velocity; and (3) when the target is moving with changing acceleration and heading angle rate.These simulations demonstrate successful target tracking capability in all cases.The necessary parameters of target tracking are listed in Table 1.In order to make full verification for the method in this paper, the proposed NFTSM guidance law is compared with a traditional SMC in [18].In the traditional SMC method, the sliding manifold can be designed as In addition, the guidance law is proposed as where sat(y) is a high-slope saturation function, which is constructed to eliminate chattering by SMC method, defining as follows: The coefficients of the NFTSM guidance law proposed in this paper and the traditional SMC method in Equation ( 35) are listed in Table 2, and another set of coefficients (α 2 and β 2 ), not performing good enough, is given as a contrast (NFTSM 1 ).

Algorithm Coefficient
In this simulation, we get a desired trajectory of the moving target by Equation ( 1) whose subscript a is replaced as t.In order to simulate the actual situation, we let a virtual sensor observe the information of the target at the inertial frame origin.The motion of the target is estimated by using the EKF.The parameters in Equation ( 4) can be set as follows: let the sampling time T s = 0.5 s; set the corresponding covariance matrixes of the process noise and measurement noise are Q = diag(0.2,0.01, 0.2, 0.01) and P = diag(0.5,0.015), respectively.Thus, we can get the estimation of state: x t , y t , v t = ẋ2 t + ẏ2 t , ψ t = arctan ( ẏt / ẋt ).

Stationary Target
Figure 4 shows the paths of stationary target tracking in the inertial reference frame with different initial heading angle ψ a = 30 • and ψ a = 130 • .For both cases, the distance error ṙ, sliding manifold s and the heading rate ω ψ with the heading angle ψ a are shown in Figures 5 and 6, respectively.
From Figure 4a, we can find that all three of the guidance laws will steer the UAV at a constant speed to circle around the target.It is proved that the convergence rate of NFTSM algorithm is faster than the TSM algorithm.However, an overshoot exists when enlarging the α 2 and β 2 as shown in Figures 5a and 6a, due to the subitem α 2 sig β 2 (•) dominating the third subitem defined in Equation (12).This is also the reason why the convergence rate of the TSM algorithm is slower than the others.When α 2 = β 2 = 0, the FTSM is equal to the TSM.
Figure 4b represents that, when the included angle of the the UAV initial heading ψ a and the azimuth angle are large, it takes a long time to achieve the desired trajectory for TSM algorithm, but the NFTSM algorithm has reached the goal position in a shorter time already.In Figures 5b and 6b, the heading rate order of the NFTSM algorithm is restricted because it exceeds the maximum UAV turn rate ψmax from 8 s to 17 s.In order to obtain quick convergence, the NFTSM algorithm needs a strong mobility, while the TSM algorithm's result is changing slowly.After closing at the desired position, all three methods can hold the state without divergence because they have the similar third subitem in Equation ( 12).Table 3 gives the results of the stationary target tracking.For the case ψ a = 30 • , the distance error r can converge to less than 0.0001 m in 31.2 s by the NFTSM algorithm, while closing at −0.742 m by the TSM algorithm.Because of the existence of shock, the NFTSM 1 algorithm will converge in 37.3 s.For the case ψ a = 30 • , due to adjusting the course from the large angle, the NFTSM algorithm will converge in 72.9 s, but the other two methods cannot converge in the 100 s simulation time.For the simulation of stationary target tracking, it can be obtained that the proposed algorithm NFTSM is preformed better than the TSM in convergence time, and the reasonable design parameters are needed to eliminate the shock.

Constant Speed Target
Let the target move following an S-shape trajectory in the barrier free environment with the initial heading angle ψ t = −45 • and the constant speed v t = 2 m/s.The UAV's initial heading angle ψ a = 70 • .After 2000 s simulation time, we get the trajectories which are depicted in Figure 7. Getting the similar results as the stationary target tracking: the NFTSM algorithm has better convergence rate than the TSM algorithm.
Combined with Figures 7 and 8, we can find that the TSM algorithm has a slow heading adjustment compared with the NFTSM algorithm.The overshoot still exists by NFTSM 1 at the start state, but it is improved after 75 s.Due to v t < v a and the azimuth angle λ being considered as free variables, the UAV can loiter above the target to keep the predetermined distance.
The simulation time of this constant speed target tracking is 2000 s.As is shown in Figure 8a, we can find that all three of methods will converge to zero in finite-time.However, there is much difference in convergence time: the NFTSM algorithm can make the distance error r less than 0.0001 m in 38.8 s.NFTSM 1 algorithm can make r less than 0.0001 m in 81.6 s.However, after 320 s, the TSM algorithm just converges to close to 0.18 s.Therefore, the proposed method is not only applicable for the stationary target tracking but is also suitable for the moving target tracking, and the effectiveness is guaranteed.

Maneuvering Target
In this section, two typical maneuvering actions are designed to verify the effectiveness of the proposed algorithm for the maneuvering target: accelerated motion and sharp turn movement.Figure 9a represents the motion profile of the ground target that includes its speed and heading angle.The motion of the target is described as follows.The ground target moves from the start point (10,10) m in the free environment with the initial speed v t (t 0 ) = 2 m/s and the initial heading angle ψ t (t 0 ) = −45 • .Suppose that there is a homogeneous change of the speed and heading angle of the target.As shown in Figure 9a, the target accelerates from 2 m/s to 7 m/s during 300 s to 350 s and accelerates to 11 m/s during 460 s to 470 s.Meanwhile, the heading angle has three changes: −100 • , 30 • and 20 • , during 400 s to 410 s, 460 s to 470 s and 550 s to 570 s, respectively, assuming that the UAV's initial heading angle ψ a = 30 • and the simulation time is 900 s.
As shown in Figure 9b, the UAV can circle around the target which has a low speed during the start time.In addition, the UAV follows the target, which accelerates to a larger speed behind a distance during the ending time.It can be found that some adjustments are executed during the whole flight stage.The adjustments are particularly evident in the sharp turn process of the target.From Figure 10a, with the changing of the target speed and heading angle, all three of the algorithms can make the state converge to the desired position.Before the target changes its motion state, the NFTSM algorithm can make the distance error r converge to less than 0.0001 m in 24.3 s, while NFTSM 1 takes 34.2 s with oscillatory convergence.However, the TSM algorithm converges to the desired distance error range in 113.6 s.This result confirms that the proposed algorithm can converge quickly to the desired position again.When the target starts to accelerate movement from 300 s to 350 s, only the TSM has a large distance error of about 17.4 m, while both NFTSM and NFTSM 1 are stable.The TSM algorithm converges close to zero gradually when the speed of the target is not changing after 350 s.The larger distance error for the TSM occurs at about 460 s where the target motion has high acceleration and sharp left turn.However, the distance error for the TSM is still close to zero at 550 s where the target has a left turn again.Therefore, it proved that the TSM algorithm is sensitive to speed change of the target and insensitive to angle changing.There is an opposite phenomenon for the NFTSM 1 algorithm as shown in Figure 10a.It is easy to find that the proposed NFTSM guidance law can keep the distance error steady (only has a ±0.1 m error range) whether the speeding or angle changing.Hence, robustness against the target's speed and heading angle disturbances can be demonstrated for the proposed NFTSM algorithm.It is more sensitive for angle changing than speed according to the analysis of NFTSM 1 .
The heading angle ψ a and the angle rate ω ψ is given in Figure 10b.It can be found that the input limit is only executed by NFTSM 1 in order to verify the influence by the unlimited maximum command of NFTSM and TSM.This is the reason why there is too large of a change in distance error for NFTSM 1 in Figure 10a.From 350 s to 400 s, there is about a 10.3 s delay compared to NFTSM and NFTSM 1 TSM such that NFTSM can converge in a quick amount of time.

Conclusions
This paper focuses on the problem of moving target tracking for fixed-wing UAV in a planar environment.A modified NFTSM guidance law is proposed to solve this problem.For the sake of solving the singularity problem, which can be occurred in the traditional TSM, a modified saturation function is used through a small range around the null point.Based on Lyapunov-based approach, theoretical analysis shows that the proposed method can guarantee the reaching phase to converge in finite-time as well as the sliding phase.Compared to the traditional SMC method, the proposed guidance law can steer the UAV to reach the desired distance in a short time.Meanwhile, the body constraints can be satisfied.Adopting three kinds of the target's motion state demonstrates that the proposed guidance law can be suitable for the problem of tracking the high maneuvering target.The proposed method is proven to converge to zero in a shorter time.The simulation results also confirm that the coefficients α 2 and β 2 can reduce the convergence time but bring the shock near the equilibrium point.In our future research, we will extend the method on the problem of multi-target tracking by multi-UAVs and will attempt to perform the NFTSM guidance law on the real UAV platform.

Figure 1 .
Figure 1.Tracking geometry between the target and unmanned aerial vehicle (UAV).

Figure 2 .
Figure 2. The Parameter analysis of terminal sliding mode (TSM).

Figure 7 .Figure 8 .
Figure 7. Tracking a moving target along the S-shape trajectory.

Figure 9 .
Figure 9.The trajectory of the moving target and the UAV.

Figure 10 .
Figure 10.The results of tracking a maneuvering target.

Table 1 .
Parameters of target tracking, UAV: unmanned aerial vehicle.

Table 3 .
The convergence time of stationary target tracking.