# A Coordination Law for Multiple Air Vehicles in Distributed Communication Scenarios

Authors: Zhongtao Cheng; Mao Su; Lei Liu; Bo Wang; Yongji Wang
Journal: Journal of Advanced Transportation
 (2020)

---

## Abstract

This paper proposes a consensus-based guidance methodology for multiple air vehicles to arrive at the same spot cooperatively. First, based on the Lyapunov stability theory, a guidance law with only one control parameter is proposed, and the exact expression of total flight time can be obtained with a control parameter equal to one. Then, a two-step guidance scheme, which can achieve a finite-time consensus of the flight time, is built upon the Lyapunov-based guidance law. In the first step, on account of the information exchange between the air vehicles through an undirected and connected communication topology, a time-varying control parameter is designed to reduce the disparities of the flight time. After the consensus of the flight time, the control parameter will remain constant at one, and simultaneous arrival can be achieved. Besides, the guidance strategy is applied in a leader-follower case that one of the vehicles cannot receive information from the others and acts as the leader. The effectiveness of the proposed method is demonstrated with simulations.


---

## Body

## 1. Introduction

The consensus of multiple dynamic agents has a long history and can be found in many applications, such as unmanned underwater vehicles [1], mobile robots [2], sensor networks [3], and other areas. With the vigorous development of unmanned air vehicles in recent years, the simultaneous arrival of multiple air vehicles has attracted much attention. Based on information exchange between the agents, the control strategy is designed to make sure that the agents reach an agreement on the state or output values. It is obvious that simultaneous arrival can be achieved if all the agents synchronize the arrival time.A widely used strategy to achieve simultaneous arrival is individual homing. Studies in this direction usually set a common arrival time as the desired time for each vehicle before homing, and then each vehicle tries to arrive at the target with the same specific time independently. In this way, any guidance law with the ability to control flight time can be applied to this kind of simultaneous arrival. The earliest appearance in this direction was proposed in [4]; a guidance law was proposed as a combination of two terms with the ability to control the flight time. One term was the proportion navigation guidance (PNG) law and the other was the flight time error. Then, it was applied to the simultaneous arrival case. The work in [4] was extended in [5] by controlling both arrival time and angle. The design framework in [4] was further enhanced by taking the field of view constraint into consideration in [6].Some other studies solve the flight time control problem for simultaneous arrival with nonlinear control theory. Two-dimensional and three-dimensional guidance laws with arrival time constraint were derived using the Lyapunov stability theory in [7], where the Lyapunov candidate function contained the flight time error directly. While the work in [8] dealt with the problem indirectly, a Lyapunov candidate function concerning the heading angle error was proposed and the exact expression of the flight time was derived. However, the incomplete beta function was used and the flight time control covered only a small-time interval.Other studies on individual homing take advantage of the polynomial function [9–12]. In [9], the guidance command was proposed as a polynomial function with three unknown coefficients, one of which was determined to satisfy the flight time constraint. The guidance law in [10] solved the flight time control problem by following the look angle profile that was polynomial in time; both second-order and third-order polynomials were considered. The design framework in [10] was extended in [11] by considering an adaptive guidance scheme. The work in [12] generalized some preliminary solutions in this direction and extended the polynomial function to any order through mathematical induction. On the other hand, a very recent work presented a guidance scheme that can extend a certain class of existing guidance laws to satisfy the flight time constraints. The only requirement was that the time-to-go prediction was provided by the existing laws [13].It should be noted that individual homing strategy usually requires the calculation of the achievable range of flight time for each air vehicle before homing. Then the intersection is determined from each vehicle’s achievable range. A suitable common time is chosen from the intersection. It means that the cooperative arrival may fail if the intersection between each vehicle is null.The disadvantage of the individual homing can be avoided by cooperative homing, which requires no predetermined suitable time selected from the intersection. The consensus of the flight time is achieved through communications among themselves. To the best of the author’s knowledge, more interest has been directed to individual homing in the guidance literature, and rare instances of cooperative homing can be found except in [14–17], where the consensus of the vehicles’ time-to-go estimates was addressed to synchronize the arrival time.The work in [14] proposed a centralized cooperative proportion navigation (CPN) guidance law to achieve the consensus of time-to-go through a time-varying navigation gain, the calculation of which required the instantaneous time-to-go information of the air vehicle and that of all the others. The navigation gain would be updated at each time step until the instantaneous time-to-go variances went to zero. As an improvement of the work in [14], a distributed guidance law was proposed in [15], where each air vehicle merely exchanged information through an undirected and connected communication topology with its neighbors rather than all the other vehicles. Inspired by the work in [15], the research in [16] introduced a more practical case by considering both the perpendicular acceleration and the tangential acceleration, and the results were further extended to communication failure case, where one of the group vehicles cannot get information from the others. The robust guidance law proposed in [17] could still achieve simultaneous arrival without the information of faulty vehicles, which was different from the unidirectional communication error in [16]. It should be noted that the aforementioned centralized law or distributed laws achieved the cooperative arrival by the consensus of the time-to-go estimates. It should be noted that the aforementioned guidance laws are based on the consensus of the time-to-go estimation, which is accurate only toward the end of the homing process.Motivated by the previous work, this paper proposes a consensus-based guidance law for multiple vehicles arriving at a target cooperatively. Specifically, the exact expression for total flight time can be obtained from the Lyapunov-based guidance law with control parameter equal to one. At each time step, we assume the control parameters are initialized with one, and the total flight time for each vehicle can be calculated. Then, by exchanging the total flight time between the vehicle and its neighbors under an undirected and connected communication topology, the control parameter will be adjusted to reduce the disparities of the arrival time. After the consensus of the flight time, the control parameters will remain constant at one. Furthermore, the guidance law is applied in a leader-follower case that one of the vehicles cannot receive information from the others and acts as the leader. The effectiveness of the proposed method is demonstrated with simulations. The main contributions of this paper are stated as follows:(1)
The cooperative guidance law is distributed and requires only neighboring information rather than global information, which reduces the communication burden.(2)
The previous work needs the information of the time-to-go estimates. However, the proposed guidance law deals with the consensus of the real flight time directly rather than the estimation of the time-to-go. This improves the accuracy of the guidance law.(3)
To ensure the scalability of this coordination method, the number of vehicles is not specific in the modeling and design process. Furthermore, the validity of the law is then examined in the single node failure case.The paper is structured as follows: Lyapunov-based guidance law is introduced in Section2. Coordination law for multiple air vehicles is offered in Section 3. Then, the guidance law is extended to a communication failure case in Section 4. Simulations are carried out in Section 5 to show the effectiveness of the proposed law. Finally, the conclusion of the work is proposed in Section 6.


## 2. Lyapunov-Based Guidance Law Design

In this paper, a scenario where multiple air vehicles arrive at a common target is considered in two-dimensional space. The planar multiple agents system is profiled in Figure1, in which X−O−Y is an inertial reference frame denoting the vertical plane. To ensure the scalability of this coordination method, the number of vehicles, which can be hundreds or more, is not specific in the modeling and design process.Figure 1
Engagement geometry.Considering that the communication scenarios can be very complex for a group of vehicles, communication state between different vehicles is defined as a binary variable, and communication topology between the air vehicles is denoted byGE,A. Before moving on, it is necessary to present some basic fundamental facts. E stands for the set of edges, edge i,j means that ith vehicle and jth vehicle are neighbors, and jth vehicle can receive information from ith vehicle. A graph is called undirected if, for any i,j∈E, j,i∈E. An undirected graph is called connected if there is an undirected path between any two different vehicles. A=aijN×N is the adjacency matrix, aij=1 if the ith vehicle can get information from the jth vehicle, and aij=0 if it cannot. Besides, the Laplacian matrix L=lijN×N of G associated with adjacency matrix A is defined as lij=−aij,i≠j and lij=∑j=1Naij,i=j.The following assumptions are claimed before deriving the kinematic equations. First, the target is assumed to be stationary. Second, the speed of each air vehicle remains constant during the process but may not be the same as that of other vehicles. Third, the communication topologyG of the multiagents system is assumed to be undirected and connected. The aforementioned assumptions can lead to the following lemmas.Lemma 1 (see [18]).
One eigenvalue ofL is zero, with 1 being the right eigenvector. It can be expressed mathematically as L1=01, where 1 denotes a column vector with all entries equal to one. Moreover, all nonzero eigenvalues have positive real parts.Lemma 2 (see [19]).
xTLx≥λxTx if x satisfies 1Tx=0, where x refers to any x∈Rn and λ denotes the smallest nonzero value of the Laplacian matrix L.In Figure1, a subscript i is added to demonstrate variables associated with the ith vehicle. θ denotes the heading angle, which is the angle between the velocity vector and the fixed reference axis. q denotes the line of sight (LOS) angle. The heading error angle σ is the angle between the velocity vector and LOS vector. All the angles are measured counterclockwise. The relationship between the aforementioned angles is(1)σi=θi+−qi=θi−qi,i=1,…,n.We can obtain the two-dimensional kinematic equations from the engagement geometry as(2)x˙i=Vicosθi,i=1,…,n,(3)y˙i=Visinθi,i=1,…,n,where x and y denote the instantaneous positions of the air vehicle. The heading angle turning rate is connected with the lateral acceleration a by(4)θ˙i=aiVi,i=1,…,n,and R denotes the relative range between target and vehicle. The differential equations for the relative range and LOS angle are(5)R˙i=−Vicosσi,i=1,…,n,(6)q˙i=−VisinσiRi,i=1,…,n.In order to arrive at the target with zero miss distance, the velocity vector should aim directly at the target, which means the heading error angle should reach zero before or at the instant of arrival. Considering this, the following Lyapunov candidate function is proposed:(7)Wi=2sin2σi2,i=1,…,n.The derivative ofW with respect to time is(8)W˙i=sinσi⋅σ˙i,i=1,…,n.To make each vehicle satisfy the Lyapunov asymptotic stability condition, the heading error rate is proposed as(9)σ˙i=−ciViRisinσi,ci>0,i=1,…,n,where c is the control parameter for each vehicle. Substituting equation (9) into equation (8), we have(10)W˙i=−ciViRisin2σi,i=1,…,n.It is obvious thatW˙ will be negative definite if c>0. Besides, equation (7) implies that W is positive definite. Hence, the Lyapunov asymptotic stability condition can be met under the proposed law.Dividing equations (9) and (5) side by side yields(11)dσitanσi=ciRidRi,i=1,…,n.Integrating both sides of equation (11), we have(12)sinσi=RiR0icisinσ0i,i=1,…,n.Equation (12) illustrates that the heading error is connected with the relative range, the value of which will decline to zero as engagement proceeds. In the meantime, equation (5) indicates that the relative range will decrease monotonously. This signifies that the value of the heading error will also converge to zero at the end of the flight.Combining equations (12) and (9) yields(13)σ˙i=−ciViR0iciRici−1sinσ0i,i=1,…,n.According to equation (13), control value c<1 will inevitably lead to an undesirable situation as the relative range goes to zero in the terminal guidance situation. This valuable information indicates that it is necessary to require c≥1 in the terminal guidance situation.Since the proposed guidance law can also be used in a midcourse guidance situation, the relative range of which will not go near zero, there is no need to worry about the undesired situation caused by zero relative range. Then the value of the control parameter just needs to meet the requirement of the Lyapunov asymptotic stability condition, which isc>0. So the reasonable range for the control parameter is(14)ci>0midcourse guidance,i=1,…,n,ci≥1terminal course guidance,i=1,…,n.Differentiating equation (1) with respect to time results in(15)σ˙i=θ˙i−q˙i,i=1,…,n.Substituting equations (6) and (9) into equation (15), we get(16)θ˙i=−ci+1ViRisinσi,i=1,…,n.The following guidance command can be obtained from equations (4) and (16):(17)ai=−ci+1V12Risinσi,i=1,…,n.Substituting equation (12) into equation (17) yields(18)ai=−ci+1Vi2R0iciRci−1sinσ0i,i=1,…,n.Suppose that the control parameterc for the vehicles is fixed at one, and we are going to see the flight time calculation under this specific circumstance.Substitutingc=1 into equation (13) yields(19)σ˙i=−ViR0isinσ0i,i=1,…,n.From equation (19), we know that the heading error rate remains negative, meaning that heading error will decrease monotonously. From equation (12), we know that the heading error will go to zero with relative range. As a result, the heading error will decrease from the initial value all along to zero at the end of the flight. Furthermore, equation (19) also implies that the heading error rate is constant. Hence, dividing the total variation of the heading error by its change rate, the analytical form of the total flight time can be acquired as(20)ti=0−σ0iσ˙i=σ0iR0iVisinσ0i,i=1,…,n.If every vehicle’s total flight time calculated from equation (20) is equal to the others, simultaneous arrival can be achieved. Then the main objective of this paper is to find a guidance law to reduce the flight time disparities between different vehicles.Remark 1.
The proposed Lyapunov-based guidance law can achieve the basic objective of reducing the relative distance to an acceptable order of magnitude. Utilizing of the Lyapunov stability condition can make sure that the system is stable.Remark 2.
Equation (20) gives the mathematical expression of the flight time with the vehicle’s initial condition. The exact mathematical expression of the vehicles’ total flight time can be derived if the control parameter equals one. No estimation or linearization is used in the process.


## 3. Coordination Law for Multiple Air Vehicles

### 3.1. Design Strategy

Enlightened by the mathematical acquisition of the total flight time in equation (20), a two-step control strategy is proposed here to achieve the cooperative guidance law.First, assume that all the vehicles are under the proposed Lyapunov-based guidance law with control parameter equal to one, such that equation (20) can be used to calculate the total flight time once the initial conditions are given. Then, each time step is viewed as the initial time and the instantaneous states are treated as the initial states; use equation (20) to recalculate the flight time. Then equation (20) should be updated accordingly:(21)ti′=σiRiVisinσi,i=1,…,n.It is obvious that the flight time calculated from equation (21) can also be viewed as the real time-to-go. The total flight time can be written as(22)ti=t+ti′,i=1,…,n,where t is the instantaneous flight time for the vehicles. We choose the vehicle’s total flight time as the consensus variable. The consensus error of the vehicles’ total flight time under the undirected and connected communication topology is defined as(23)εi=∑j=1naijtj−ti,i=1,…,n.Second, adjust the control parameter to make the total flight time reach an agreement. In the previous discussion, we know that the consensus of the total flight time for the vehicles can lead to a simultaneous arrival. Once the consensus error calculated from equation (23) is zero, the control parameter for all the vehicles will change to one and remain there.


### 3.2. Coordination Law

Substituting equation (22) into equation (23) yields(24)εi=∑j=1naijtj′−ti′,i=1,…,n.The analytical form of the flight time in equation (20) is derived from dividing the total variation of the heading error by its changing rate. In order to achieve the consensus of the flight time, the vehicles with larger flight time should increase their heading error changing rate, while the others with smaller flight time decrease their changing rate to delay the flight time. Based on the information exchange between vehicles via the communication network, the heading error in the first step is proposed as(25)σ˙i=−1−kiεiusgnεiVisinσiRi,i=1,…,n,where u is a constant that satisfies 0<u<1. It is obvious that the proposed heading error rate is under the Lyapunov-based guidance law structure, where the control parameter for each vehicle is ci=1−εiusgnεi. Once the total flight time arrives at a consensus, the control parameter for each vehicle will be fixed at one.Before moving on, two other lemmas are introduced in advance.Lemma 3 (see [20]).
Forxi∈R,i=1,…,n,0<a≤1; then,(26)∑i=1nxia≥∑i=1nxia.Lemma 4 (see [21]).
If there exists a Lyapunov functionVx such that(27)V˙x≤−aVmx,where a>0 and 0<m<1, then Vx will converge to zero or a small neighborhood of zero before the final time. The settling time T, depending on initial condition state x0, is given by(28)T≤Vx01−ma1−λ.Theorem 1.
The proposed heading error rate in equation (25) can make εi,i=1,…,n converge to zero in finite time, and the simultaneous arrival problem for the multivehicles system in Section 2 can be solved.Proof.
Differentiating equation (21) with respect to time yields(29)t˙i′=σ˙iRiVsinσi+σiR˙iVisinσi−σ˙iσiRicosσiVisinσi,i=1,…,n.
Substituting equation (25) into (29), we have(30)t˙i′=kiεiusgnεi−1−σicosσisinσi−kiεiusgnεi−1σicosσisinσi,i=1,…,n,where σi are usually small angles; then, sinσi≈σi and cosσi≈1−σi2/2. Hence, equation (30) can be rewritten as(31)t˙i′=1−cosσikiεiusgnεi,i=1,…,n.
The following Lyapunov candidate function is considered:(32)V1=12∑i,j∈aijtj′−ti′2=12tTLt,where t=t1,…,tn. The derivative of V1 with respect to time is given by(33)V˙1=t˙TLt=−∑i=1n1−cosσikiεiu.
Note that the last equality in equation (33) is obtained by using the fact that L1=0 and ε=−Lt. Define(34)k=min1−cosσiki,i=1,…,n.
Then, we have(35)V˙1≤−k∑i=1nεiu+1≤−kεTεu+1/2.
As1TL1=0=L1/21TL1/21, we can get L1/21=0. Then we have 1TL1/2t=0. According to Lemma 1, we can get tTLLt≥λtTLt, which can be written as εTε≥2λV. On account of these analyses, the following equation can be driven from equation (35):(36)V˙1≤−k2λ1+u/2V11+u/2.
According to finite-time convergence theory from Lemma4, V1 will converge to zero or a small neighbor of zero in finite time. The convergence of V1 also means that the consensus error εi will converge to zero. Once the consensus error reaches zero, the simultaneous arrival can be achieved. In addition, the consensus time is given by(37)T≤2V11−u/2k1−u2λ1−u/2,which completes the proof of Theorem 1.Remark 3.
Different from previous works [14–17], where the consensus of the time-to-go estimations is considered, this paper deals with the consensus of the flight time directly. Moreover, the assumption that ri>0 and σi≠0 before the consensus is not necessary. Thus, the guidance law is more operationally effective. Compared with [14, 15], only the neighboring information is required rather than the global information in this method. Hence, the guidance law is distributed.


## 3.1. Design Strategy

Enlightened by the mathematical acquisition of the total flight time in equation (20), a two-step control strategy is proposed here to achieve the cooperative guidance law.First, assume that all the vehicles are under the proposed Lyapunov-based guidance law with control parameter equal to one, such that equation (20) can be used to calculate the total flight time once the initial conditions are given. Then, each time step is viewed as the initial time and the instantaneous states are treated as the initial states; use equation (20) to recalculate the flight time. Then equation (20) should be updated accordingly:(21)ti′=σiRiVisinσi,i=1,…,n.It is obvious that the flight time calculated from equation (21) can also be viewed as the real time-to-go. The total flight time can be written as(22)ti=t+ti′,i=1,…,n,where t is the instantaneous flight time for the vehicles. We choose the vehicle’s total flight time as the consensus variable. The consensus error of the vehicles’ total flight time under the undirected and connected communication topology is defined as(23)εi=∑j=1naijtj−ti,i=1,…,n.Second, adjust the control parameter to make the total flight time reach an agreement. In the previous discussion, we know that the consensus of the total flight time for the vehicles can lead to a simultaneous arrival. Once the consensus error calculated from equation (23) is zero, the control parameter for all the vehicles will change to one and remain there.


## 3.2. Coordination Law

Substituting equation (22) into equation (23) yields(24)εi=∑j=1naijtj′−ti′,i=1,…,n.The analytical form of the flight time in equation (20) is derived from dividing the total variation of the heading error by its changing rate. In order to achieve the consensus of the flight time, the vehicles with larger flight time should increase their heading error changing rate, while the others with smaller flight time decrease their changing rate to delay the flight time. Based on the information exchange between vehicles via the communication network, the heading error in the first step is proposed as(25)σ˙i=−1−kiεiusgnεiVisinσiRi,i=1,…,n,where u is a constant that satisfies 0<u<1. It is obvious that the proposed heading error rate is under the Lyapunov-based guidance law structure, where the control parameter for each vehicle is ci=1−εiusgnεi. Once the total flight time arrives at a consensus, the control parameter for each vehicle will be fixed at one.Before moving on, two other lemmas are introduced in advance.Lemma 3 (see [20]).
Forxi∈R,i=1,…,n,0<a≤1; then,(26)∑i=1nxia≥∑i=1nxia.Lemma 4 (see [21]).
If there exists a Lyapunov functionVx such that(27)V˙x≤−aVmx,where a>0 and 0<m<1, then Vx will converge to zero or a small neighborhood of zero before the final time. The settling time T, depending on initial condition state x0, is given by(28)T≤Vx01−ma1−λ.Theorem 1.
The proposed heading error rate in equation (25) can make εi,i=1,…,n converge to zero in finite time, and the simultaneous arrival problem for the multivehicles system in Section 2 can be solved.Proof.
Differentiating equation (21) with respect to time yields(29)t˙i′=σ˙iRiVsinσi+σiR˙iVisinσi−σ˙iσiRicosσiVisinσi,i=1,…,n.
Substituting equation (25) into (29), we have(30)t˙i′=kiεiusgnεi−1−σicosσisinσi−kiεiusgnεi−1σicosσisinσi,i=1,…,n,where σi are usually small angles; then, sinσi≈σi and cosσi≈1−σi2/2. Hence, equation (30) can be rewritten as(31)t˙i′=1−cosσikiεiusgnεi,i=1,…,n.
The following Lyapunov candidate function is considered:(32)V1=12∑i,j∈aijtj′−ti′2=12tTLt,where t=t1,…,tn. The derivative of V1 with respect to time is given by(33)V˙1=t˙TLt=−∑i=1n1−cosσikiεiu.
Note that the last equality in equation (33) is obtained by using the fact that L1=0 and ε=−Lt. Define(34)k=min1−cosσiki,i=1,…,n.
Then, we have(35)V˙1≤−k∑i=1nεiu+1≤−kεTεu+1/2.
As1TL1=0=L1/21TL1/21, we can get L1/21=0. Then we have 1TL1/2t=0. According to Lemma 1, we can get tTLLt≥λtTLt, which can be written as εTε≥2λV. On account of these analyses, the following equation can be driven from equation (35):(36)V˙1≤−k2λ1+u/2V11+u/2.
According to finite-time convergence theory from Lemma4, V1 will converge to zero or a small neighbor of zero in finite time. The convergence of V1 also means that the consensus error εi will converge to zero. Once the consensus error reaches zero, the simultaneous arrival can be achieved. In addition, the consensus time is given by(37)T≤2V11−u/2k1−u2λ1−u/2,which completes the proof of Theorem 1.Remark 3.
Different from previous works [14–17], where the consensus of the time-to-go estimations is considered, this paper deals with the consensus of the flight time directly. Moreover, the assumption that ri>0 and σi≠0 before the consensus is not necessary. Thus, the guidance law is more operationally effective. Compared with [14, 15], only the neighboring information is required rather than the global information in this method. Hence, the guidance law is distributed.


## 4. Extension to a Communication Failure Case

In this subsection, the communication faults scenario that one of the group vehicles cannot receive information from other vehicles is considered. As a result, the flight time for this fault vehicle cannot be adjusted. The only way to make cooperative arrival possible in this case is that all the other vehicles coordinate their flight time with the fault one, which will be viewed as the leader.The communication topology is viewed as a leader-follower graphG′ with the fault vehicle as the root, which will be denoted as the nth one. In this case, the control parameter for the nth vehicle will remain constant at one.With the assumption in this section, the Laplacian matrix ofG′ can be denoted as(38)L=L1L201×n−10,where L1∈Rn−1×n−1 is symmetric and L2∈Rn−1. It is obvious that(39)L11=−L2.Theorem 2.
The proposed heading error rate in equation (25) can solve the simultaneous arrival problem for the multivehicles system when the communication topology is G′.Proof.
Lett˜=t1,…,tn−1T; the Lyapunov candidate function is proposed as(40)V2=12t˜−t˜n1TL1t˜−t˜n1.
It can be concluded from Lemma1 that L1 is positive definite. Let ε˜=ε1,…,εn−1T; we have(41)ε˜=−L1L2t˜tnT.
Combining equations (39) and (41) yields(42)ε˜=−L1t˜−tn1.
Differentiating equation (40) with respect to time, we have(43)V˙2=t˜−t˜n1TL1t˜˙−t˜˙n1=−∑i=1n−11−cosσikiεiu.
Similar to the proof Theorem1, the following equation can be driven:(44)V˙2≤−k˜ε˜Tε˜u+1/2,where(45)k˜=min1−cosσiki,i=1,…,n−1.
Note that(46)L11/2t˜−t˜n1TL1L11/2t˜−t˜n1≥λL11/2t˜−t˜n1TL11/2t˜−t˜n1,which means that ε˜Tε˜≥2λV2. On account of these analyses, the following equation can be driven from equation (35):(47)V˙2≤−k˜2λ1+u/2V21+u/2.
According to finite-time convergence theory from Lemma4, V2 will converge to zero or a small neighbor of zero in finite time. The convergence of V2 also means that the consensus error εi will converge to zero, and the simultaneous arrival can be achieved. Hence, Theorem 2 has been proven.


## 5. Simulations

In this section, numerical simulations are carried out to show the effectiveness of the proposed strategies. The simulation step is0.01s. All the simulations are terminated when the sign of the relative velocity becomes positive or the relative range is less than 0.01 m. We consider four vehicles arriving at a common target from different directions, and the target is fixed at (8000, 0) m. Detailed simulation parameters for the vehicles are tabulated in Table 1.Table 1
Initial parameters for the four vehicles.
VehicleInitial relative range (m)Velocity (m/s)Initial heading angle (deg.)Initial LOS angle (deg.)18000270600275002503003770022045047000200300


### 5.1. Case 1. Undirected and Connected

In this subsection, simulations are carried out to show the effectiveness of the proposed law under undirected and connected communication topology, which is demonstrated in Figure2. The detailed simulation parameters are tabulated in Table 1.Figure 2
Undirected and connected communication topology among vehicles.An undirected path exists between any two different vehicles. Hence, all the vehicles can receive information from their neighbors. The Laplacian matrix of the communication topology can be acquired as(48)L=3−1−1−1−12−10−1−13−1−10−13.Simulation results are demonstrated in Figure3. Solid line, dashed line, dash-dotted line, and dotted line stand for the results of vehicles 1, 2, 3, and 4, respectively. Combining the vehicle trajectories in Figure 3(a) and range variation in Figure 3(d), we can see that simultaneous arrival can be achieved under the proposed guidance law. The variance of the heading error angles is in Figure 3(b), all of which decline to zero at the end of the engagement, which verifies the analysis in equation (12). The consensus error of the flight time is demonstrated in Figure 3(e). It is obvious that the flight time of each vehicle can reach an agreement in finite time under the proposed law. Once the consensus of flight time is achieved, the control parameter will remain constant at 1. We know that the acceleration will remain constant if the control parameter remains at 1, which is consistent with the simulation results in Figure 3(c). This simulation proves that the proposed guidance law can be applied in cooperative arrival for multiple vehicles.Figure 3
Simulation results under undirected and connected communication topology. (a) Vehicle trajectory. (b) Heading error. (c) Lateral acceleration. (d) Range variation. (e) Consensus error of flight time.
(a)(b)(c)(d)(e)


### 5.2. Case 2: Leader-Follower

In this subsection, the leader-follower communication topology between the vehicles is demonstrated in Figure4. We consider that four vehicles arrive at a target. The detailed simulation parameters are the same as those of case 1, which are tabulated in Table 1. Vehicle 3 acts as the leader, which means that vehicle 3 cannot receive information from the other vehicles.Figure 4
Leader-follower communication topology among vehicles.The Laplacian matrix of the communication topology can be acquired as(49)L=2−10−1−13−1−10−12−10000.Simulation results are demonstrated in Figure5. Dashed line, dotted line, solid line, and dash-dotted line stand for vehicles 1, 2, 3, and 4, respectively. It can be concluded from the vehicle trajectories in Figure 5(a) that all four vehicles can arrive at the target. Furthermore, the range variation in Figure 5(d) means that all the vehicles’ relative ranges converge to zero at the same time, implying that a successful simultaneous arrival is achieved under the proposed law. The variance of the heading error angles is depicted in Figure 5(b), and all of them decline to zero at the end of the engagement, which is in line with the analysis in equation (12). Vehicle 3 acts as the leader, which means its control parameter will remain constant at 1 during the homing process. The other vehicles will adjust their control parameters according to vehicle 3. After the follower vehicles reach an agreement with the leader in flight time, all the vehicles’ control parameters will be 1. This is consistent with the simulation results in Figures 5(c) and 5(e). It is obvious that the flight time of each vehicle can reach an agreement in finite time under the proposed law. This simulation proves the proposed guidance law can also be applied in cooperative arrival even if communication failures exist.Figure 5
Simulation results under leader-follower communication topology. (a) Vehicle trajectory. (b) Heading error. (c) Lateral acceleration. (d) Range variation. (e) Consensus error of flight time.
(a)(b)(c)(d)(e)


## 5.1. Case 1. Undirected and Connected

In this subsection, simulations are carried out to show the effectiveness of the proposed law under undirected and connected communication topology, which is demonstrated in Figure2. The detailed simulation parameters are tabulated in Table 1.Figure 2
Undirected and connected communication topology among vehicles.An undirected path exists between any two different vehicles. Hence, all the vehicles can receive information from their neighbors. The Laplacian matrix of the communication topology can be acquired as(48)L=3−1−1−1−12−10−1−13−1−10−13.Simulation results are demonstrated in Figure3. Solid line, dashed line, dash-dotted line, and dotted line stand for the results of vehicles 1, 2, 3, and 4, respectively. Combining the vehicle trajectories in Figure 3(a) and range variation in Figure 3(d), we can see that simultaneous arrival can be achieved under the proposed guidance law. The variance of the heading error angles is in Figure 3(b), all of which decline to zero at the end of the engagement, which verifies the analysis in equation (12). The consensus error of the flight time is demonstrated in Figure 3(e). It is obvious that the flight time of each vehicle can reach an agreement in finite time under the proposed law. Once the consensus of flight time is achieved, the control parameter will remain constant at 1. We know that the acceleration will remain constant if the control parameter remains at 1, which is consistent with the simulation results in Figure 3(c). This simulation proves that the proposed guidance law can be applied in cooperative arrival for multiple vehicles.Figure 3
Simulation results under undirected and connected communication topology. (a) Vehicle trajectory. (b) Heading error. (c) Lateral acceleration. (d) Range variation. (e) Consensus error of flight time.
(a)(b)(c)(d)(e)


## 5.2. Case 2: Leader-Follower

In this subsection, the leader-follower communication topology between the vehicles is demonstrated in Figure4. We consider that four vehicles arrive at a target. The detailed simulation parameters are the same as those of case 1, which are tabulated in Table 1. Vehicle 3 acts as the leader, which means that vehicle 3 cannot receive information from the other vehicles.Figure 4
Leader-follower communication topology among vehicles.The Laplacian matrix of the communication topology can be acquired as(49)L=2−10−1−13−1−10−12−10000.Simulation results are demonstrated in Figure5. Dashed line, dotted line, solid line, and dash-dotted line stand for vehicles 1, 2, 3, and 4, respectively. It can be concluded from the vehicle trajectories in Figure 5(a) that all four vehicles can arrive at the target. Furthermore, the range variation in Figure 5(d) means that all the vehicles’ relative ranges converge to zero at the same time, implying that a successful simultaneous arrival is achieved under the proposed law. The variance of the heading error angles is depicted in Figure 5(b), and all of them decline to zero at the end of the engagement, which is in line with the analysis in equation (12). Vehicle 3 acts as the leader, which means its control parameter will remain constant at 1 during the homing process. The other vehicles will adjust their control parameters according to vehicle 3. After the follower vehicles reach an agreement with the leader in flight time, all the vehicles’ control parameters will be 1. This is consistent with the simulation results in Figures 5(c) and 5(e). It is obvious that the flight time of each vehicle can reach an agreement in finite time under the proposed law. This simulation proves the proposed guidance law can also be applied in cooperative arrival even if communication failures exist.Figure 5
Simulation results under leader-follower communication topology. (a) Vehicle trajectory. (b) Heading error. (c) Lateral acceleration. (d) Range variation. (e) Consensus error of flight time.
(a)(b)(c)(d)(e)


## 6. Conclusion

This paper proposes a guidance law for multiple vehicles arriving at a target cooperatively. The Lyapunov-based guidance law is proposed, and the flight time can be calculated with control parameter equal to one. Specifically, we assume that the control parameters are initialized with one at each time step. Then, by exchanging the total flight time between the vehicle and its neighbors under an undirected and connected communication topology, the control parameter will be adjusted to reduce the disparities of the flight time. After the consensus of the flight time, the control parameters will remain constant at one. The effectiveness of the proposed method is demonstrated with simulations. Compared with previous work, this paper deals with the consensus of the flight time directly rather than the estimation of time-to-go. In future related work, the tangential acceleration should be considered in the design of guidance law.



---

*Source: 1810962-2020-07-04.xml*