Cooperative Obstacle Avoidance for Multiple UAVs Using Spline_VO Method

Abstract

In order to solve multiple unmanned aerial vehicle (UAV) dynamic collision avoidance, a cooperative obstacle avoidance algorithm considering UAV’s kinematic constraints has been developed. In the proposed algorithm, the useful information of UAVs is screened out by a Heartbeat information filtering mechanism and fused by the user datagram protocol (UDP) communication method, which improves communication performance among UAVs. In addition, the velocity obstacle (VO) method combined with cubic uniform B-spline curve is used to avoid obstacles and generate smooth paths, which can be applied to practical scenes. Finally, dynamic and static obstacle avoidance simulations are carried out to verify the effectiveness of the proposed algorithm.

1. Introduction

In the past decades, unmanned aerial vehicle(UAV) has been the subject of much discussion because of promising applications in military and civil fields, such as cooperative operations [1], electric power inspection [2], land mapping [3], and so on. A single UAV has limitations in terms of payload, endurance and mission capability, while a collaborative system composed of multi-UAV has obvious advantages in practicability and scalability [4]. One of the core problems of UAV group is navigation, i.e., how to reach the destination without colliding with dynamic and static obstacles. Therefore, cooperative obstacle avoidance of multi-UAV is an important direction of UAV development and application.

Many collision avoidance models for UAV have been proposed, which can be divided into two categories, i.e., model-free approaches and model-based approaches. The model-free approaches do not require exploring the model to recover the environments, which consist of sampling method, swarm intelligence, deep reinforcement learning, and so on. Early random road map and fast search tree methods are often used for sampling, but the planning process is very time consuming, and the methods are based on the assumption that the environment is static. These factors make it difficult to apply in practical engineering [5,6]. Swarm intelligence algorithms mainly include particle swarm optimization (PSO), ant colony optimization (ACO), artificial bee colony (ABC) algorithm and so on [7,8,9]. When these algorithms are used to deal with a large number of sample data, they will occupy more computer memory, and have a high demand on the running speed of the computer. As a research hotspot in machine learning, deep reinforcement learning can obtain effective control decisions for high-dimensional raw data input by relying on the perception ability of deep learning [10]. However, this system usually works in specific tasks and is difficult to be extended to other environments.

Model-based methods are designed based on accurate models, such as geometric model, artificial potential field method, velocity obstacle (VO) method and so on. However, due to the limitations of realistic environments and the constraints of UAV itself, many of the existing methods have a large amount of calculation and are not suitable for reactive collision avoidance of multi-vehicle systems [11]. Fortunately, VO method has the ability to predict the collision in advance, and the calculation requirements are not high, and it is more suitable for multi-obstacle avoidance in complex environments [12]. VO method was first proposed by Fiorini and Shiller in [13], which is a commonly used multi-robot local path planning method. The model needs to solve complex nonlinear optimization problems in the relative velocity space, it is difficult to guarantee the real-time performance, and does not solve the problem of safe and non-oscillation navigation among multiple agents in a large and chaotic environment [14]. Berg proposed the reciprocal velocity obstacles (RVO) based on VO, which solves the oscillation problem of the VO method [15]. However, the RVO has some limitations, in particular, it often causes agents to end up with a reciprocal dance  condition, as they cannot agree on which side to pass through the other [16]. A selective velocity obstacle (SVO) method is proposed in [17] for collision avoidance between multiple UAVs on the basis of VO method, and the right hand first principle is added in SVO for collision avoidance decision-making. Although the above approaches have had some success, there are still many limitations. For example, each UAV acts independently and makes decisions according to the local state information obtained by itself, which often fails to achieve the global optimal decision. The communication volume is too large during cooperative obstacle avoidance, resulting in redundancy and a lot of calculation. The kinematics constraints of UAVs in real environments are also not considered.

Based on the above factors, this paper proposes a feasible cooperative obstacle avoidance scheme for multi-UAV. The cooperative obstacle avoidance scheme uses user datagram protoco(UDP) and information completion algorithm to reduce communication traffic and share Heartbeat information of each UAV. Then, a Spline_VO method is used to realize cooperative obstacle avoidance for multiple UAVs and generate smooth flight path for each UAV. The scheme is simple in calculation, high in efficiency, in line with the kinematics law of the UAV, and can ensure that multi-UAV will reach the target smoothly.

The main contributions of our work are summarized as follows:

• We present a feasible obstacle avoidance scheme, which can help UAV group to avoid dynamic and static obstacles smoothly and generate smooth flight path. The problems such as easy to fall into local optimization, communication redundancy and kinematics constraint of UAV are solved.
• We propose a screening mechanism of UAV Heartbeat information, which can effectively avoid the interference of timeout signal and long-distance communication to UAV’s obstacle avoidance performance, improve the stability of obstacle avoidance and reduce communication volume.
• For static obstacles, we also use Spline_VO method to avoid obstacles and smooth the path for polygonal obstacles. It is more in line with the situation that the UAV encounters static obstacles in the real environment.
• We verified the effectiveness and performance of the proposed obstacle avoidance scheme by comparing it with other obstacle avoidance schemes in path and time.

The rest of this paper is organized as follows: Cooperative communication mechanism of UAV group is presented in Section 2. Section 3 introduces the obstacle avoidance of UAV based on the proposed communication algorithm. The simulation results are given in Section 4. Section 5 concludes this paper.

2. Cooperative Communication Mechanism for Multi-UAV

UAV communication is the key to cooperative obstacle avoidance. How to reduce communication time and ensure the accuracy of communication is one of the key points of our research. Transmission control protocol (TCP) requires three handshakes before data transmission, resulting in communication delay, while UDP has no delay in establishing connections and can reduce energy consumption through regular communication [18]. Therefore, in this study, each UAV communicates with others based on UDP broadcasting its Heartbeat [19] information. The main information contained in a UAV Heartbeat(HB) is shown in

Table 1. Unmanned aerial vehicle (UAV) $\left(C_i\right)$ Heartbeat.

UAV ID

UAV adjacent number (UAV valency)

Total UAV number in network

x position

y position

z position

Vx speed

Vy speed

Vz speed

GPS time

UAV mode

Replacement UAV

Target ID

Want to target ID

Cost

UAV status

.

In the UAV communication system, all UAVs regularly broadcast their HB information at a fixed frequency $fHz$, which will be stored in MessageBox. If there are N UAVs in the system, each UAV will receive $N-1$ HB messages from other UAVs regularly under normal communication conditions, while MessageBox will receive $N\times N$ HB messages every communication cycle, which will inevitably lead to information redundancy. In addition, due to the decline of long-distance communication or network quality, UAVs may not receive long-distance Heartbeat information, resulting in information loss, or the received signal times out and becomes useless signal, which greatly affects the obstacle avoidance performance of the UAV group. To solve these problems and ensure the real-time and accuracy of communication between UAVs, we proposed a HB information filtering mechanism (HIFM) to screen the Heartbeat signals broadcast by UAVs. The specific process of HIFM is shown in Figure 1.

HIFM firstly filters out useless information. When conducting collision avoidance, the UAV needs to know the horizontal and vertical distances between itself and other UAVs or obstacles. Set the minimum horizontal safety distance and the minimum vertical safety distance to avoid collision as $d_{min}$ and $h_{min}$, respectively. Once the minimum safety distance is reached, the UAV shall conduct collision avoidance operation. When the horizontal distance between two UAVs is greater than $d_{min}$ or the vertical distance is more than $h_{min}$, the HB of each other is regarded as useless information and will not be received. In addition, due to environmental interference or communication delay, a UAV at time T will refuse to receive the message broadcast before time $T-3$, which is also considered as useless information. After sifting through the information, the UAV i has the HB of $k(k\le N)$ other UAVs in memory. The HB of k other UAVs is fused into a $1\times N$ HB information matrix through the ID of UAVs, in which the unreceived HB of UAVs is empty.

In a network of N UAVs, the ith UAV will receive HB messages $C_j(j=1\cdots N,j\ne i)$ from other UAVs. In order to ensure the performance of obstacle avoidance, UAV i needs to check and update the HB from other UAVs in every communication cycle. If the HB $C_i$ of the ith UAV contains the HB of other k UAVs, check the HB $C_1$ of the first UAV and determine whether it contains the latest HB through GPS time, extract the latest HB and store it in the HB $C_i$ of the ith UAV. If the HB of the kth UAV contained in $C_1$ is empty or not the HB under the latest GPS time T, check the HB of the next UAV. Repeat the above process until the HB of other k UAVs contained in the HB of the ith UAV is updated. After several cycles, the latest HB needed for obstacle avoidance will be stored in the MessageBox of each UAV. The above steps are achieved through Algorithm 1, and $C_i^j$ represents the HB message of the jth UAV in the ith UAV.

Algorithm 1 Information completion algorithm

1: Input: HB of UAV $C_i$ 2: $\mathrm{HB\; of\; other\; UAV}{C}_j$, $j=1,2,3.....N$; $j\ne i$ 3: for$j\doteq 1$ to total UAVs do 4:       if $C_i^j\ne null$ then 5:              tem = 0 6:              for $h\doteq 1$ to total UAVs do 7:                    if GPS T of $HB[h*total\_UAV\_Num$ 8:                      $+j]\ge tmp$ then 9:                           store HB[h*total_UAV_Num + j] 10:                     information 11:                         tem = GPS T of HB[h*total_UAV_Num 12:                      + j] 13:                  end if 14:            end for 15:       end if 16: end for

We can represent the information update of the ith UAV by:

$$M_{ki}(t+1)=\sum _j^N{\rho }_{ji}^{\left(k\right)}{M}_{ji}\left(t\right),k=1,2...,1\le j\le N,$$

(1)

where $M_{ji}$ represents the HB of the jth UAV received by the ith UAV. ${\rho }_{ji}^{\left(k\right)}$ is the weighting of the information fusion, indicating whether there is the latest information of the kth UAV in the HB of the jth UAV received in the ith UAV, given as:

$${\rho }_{ji}^{\left(k\right)}=\left\{\begin{array}{c}1\mathrm{If}\mathrm{the}\mathrm{update}\mathrm{is}\mathrm{successful},\hfill \\ 0\mathrm{otherwise}.\hfill \end{array}\right.$$

(2)

All possible HB received by UAV $C_i$ from other UAVs can be obtained by Equations (1) and (2), which is defined as $M_i$,

$$M_i(t+1)=A_i{M}_i\left(t\right),$$

(3)

where $M_i\left(t\right)={[M_{1i}\left(t\right),M_{2i}\left(t\right),\cdots ,M_{Ni}\left(t\right)]}^T$, and

$$A_i=\left[\begin{array}{cccc}{\rho }_{1i}^{\left(1\right)}& {\rho }_{2i}^{\left(1\right)}& \cdots & {\rho }_{Ni}^{\left(1\right)}\\ {\rho }_{1i}^{\left(2\right)}& {\rho }_{2i}^{\left(2\right)}& \cdots & {\rho }_{Ni}^{\left(2\right)}\\ ⋮& ⋮& ⋮& ⋮\\ {\rho }_{1i}^{\left(N\right)}& {\rho }_{2i}^{\left(N\right)}& \cdots & {\rho }_{Ni}^{\left(N\right)}\end{array}\right]$$

(4)

It should be noted that since the UAV only updates and stores the effective obstacle avoidance information when other UAV $C_j$ is in the obstacle avoidance range, because of the update result, only one number in the weighting set {${\rho }_{1i}^k,{\rho }_{2i}^k,\cdots ,{\rho }_{Ni}^k$} is equal to 1, and others are equal to 0. Otherwise, all elements of the weighting are set 0. The weighting set function ${\sum }_j^N{\rho }_{ji}^{\left(k\right)}$ denoted by:

$$\sum _j^N{\rho }_{ji}^{\left(k\right)}=\left\{\begin{array}{c}1\mathrm{If}\mathrm{within}\mathrm{obstacle}\mathrm{avoidance}\mathrm{range},\hfill \\ 0\mathrm{otherwise}.\hfill \end{array}\right.$$

(5)

Through the following proof, we can conclude that the information obtained by each UAV through multiple communications is convergent. In UAV communication Equations (3) and (4), when time t tends to ∞:

$$\begin{array}{cc}\hfill \parallel M_i{(t+1)\parallel }_{t\to \infty }& =\parallel A_i{M}_i{\left(t\right)\parallel }_{t\to \infty }\hfill \\ \hfill & \le \parallel A_i{\parallel }_{\infty }{\parallel M_i\left(t\right)\parallel }_{\infty }\hfill \\ \hfill & \le \sum _{j=1}^N{\rho }_{ji}^{\left(k\right)}{\parallel M_i\left(t\right)\parallel }_{\infty }\hfill \\ \hfill & \le \parallel M_i{\left(t\right)\parallel }_{\infty }\hfill \end{array}$$

(6)

It can be seen that information completion algorithm can be used to reduce information redundancy, and the weakly connected communication network can be processed through the protocol to realize the cooperation of multiple UAV systems.

3. Uav Obstacle Avoidance

3.1. Velocity Obstacle Method

VO is a common method for robots to avoid moving obstacles, and the detailed principle of VO method is described in [13], which has the following characteristics:

• It is a geometric constraint representation method to avoid obstacles;
• It can be used to deal with collision avoidance problems of multiple dynamic obstacles;
• Dynamic constraints and maneuvering constraints are considered.

VO can determine the track segment where there is an urgent threat from the distribution of surrounding obstacles perceived by the sensor. At the same time, VO can construct a VO cone according to the obtained speed and position information of the UAV and the intruder, and obtain the feasible velocity set of the UAV. The VO model is shown in Figure 2.

In Figure 2, A and B are two UAVs, their current position vectors are $P_A$ and $P_B$, respectively, and their speed vectors are $V_A$ and $V_B$, respectively. The VO cone of B to A can be defined by

$$V{O}_B^A\left(V_B\right)=\left\{v_A\right|\lambda (P_A,V_A-V_B)\cap (B\oplus -A)\ne 0\}$$

(7)

The VO cone can be geometrically described as a cone with a vertex at $P_A$, $\lambda (P_A,V_A-V_B)$ and represents a ray from $P_A$ in the direction of $V_A-V_B$. If $V_A\subseteq V{O}_B^A\left(V_B\right)$, A and B will collide at some point in the future. Therefore, if the speed of the UAV is within the area of the VO cone, the speed vector outside the area should be selected, so that the UAV can avoid the obstacle and continue moving.

3.2. Spline _VO Method to Avoid Obstacles

During the task execution, the UAV should detect the constantly changing environment around it in real time, perceive the speed and position of other UAVs and dynamic obstacles to make obstacle avoidance judgment, as shown in Figure 3. There are two UAVs A and B at $P_A$ and $P_B$ with radii $r_a$ and $r_b$, respectively. Generally, UAV A is simplified as a particle and UAV B is expanded into a circle with radius $r_a+r_b$ in VO method.

As shown in Figure 3, the velocity vector of UAV A is $v_a$, and that of UAV B is $v_b$. The speed of UAV B relative to UAV A is $v_r=v_a-v_b$. UAV B can be regarded as stationary, and UAV A moves relative to B at the speed of $v_r$. Assume that the velocity vectors of A and B do not change, and moving at a constant velocity. If the relative velocity is within the blue area, which is called the collision cone, then at some point in the future, UAV A and B will collide. Therefore, the core of the VO method is to determine the blue area.

Assume that the horizontal coordinate of UAV A at the current moment is ($X_a$, $Y_a$), and the coordinate of UAV B is ($X_b$, $Y_b$). Connect $P_a$ and $P_b$, and draw tangent lines $l_1$ and $l_2$ to UAV B from point $P_a$. ${\theta }_1$ is given by Equation (8).

$${\theta }_1={\theta }_{\mathrm{OB}}-\angle \mathrm{BOD}$$

(8)

where ${\theta }_{\mathrm{OB}}$ is the angle between the line OB and the Y-axis, and $\angle \mathrm{BOD}$ can get from the UAVs coordinates:

$${\theta }_{\mathrm{OB}}=arctan\frac{X_a-X_b}{Y_a-Y_b}$$

(9)

$$\angle \mathrm{BOD}=arcsin\frac{(r_a+r_b)}{\sqrt{{(Y_a-Y_b)}^2+{(X_a-X_b)}^2}}$$

(10)

The obstacle avoidance angle ${\theta }_1$ and ${\theta }_2$ can be obtained through the above equations.

$${\theta }_1=arctan\frac{X_a-X_b}{Y_a-Y_b}-arcsin\frac{(r_a+r_b)}{\sqrt{{(Y_a-Y_b)}^2+{(X_a-X_b)}^2}}$$

(11)

$${\theta }_2=arctan\frac{X_a-X_b}{Y_a-Y_b}+arcsin\frac{(r_a+r_b)}{\sqrt{{(Y_a-Y_b)}^2+{(X_a-X_b)}^2}}$$

(12)

According to the VO method, the two UAVs A and B will collide if ${\theta }_1<\theta <{\theta }_2$. Therefore, in order to avoid collision, it should be true that $\theta ⊈[{\theta }_1,{\theta }_2]$. At this point, the UAV selects the feasible speed and generates a new speed $V_{new}$ according to the lowest cost.

Considering the kinematic constraints of a UAV in the real world, the motion path of a UAV should be smooth. The B-spline curve is a powerful tool for path smoothing, which can generate the desired trajectory for different times and obstacle configurations. The basic principle of B-spline is as follows [20].

$$\begin{array}{c}\hfill G_{i,n\left(t\right)}=\frac{1}{n!}\sum _{j=0}^{n-i}{(-1)}^j{C}_{n+1}^j{(t+n-1-j)}_n\\ \hspace{1em}\hspace{1em}t\in [0,1],i=1,2,\cdots ,n\hfill \end{array}$$

(13)

where n is the number of B-splines, so the cubic uniform B-spline can be written as:

$$\left\{\begin{array}{c}{G}_{0,3}\left(t\right)=\frac{1}{6}(-t^3+3t^2-3t+1)\hfill \\ G_{1,3}\left(t\right)=\frac{1}{6}(3t^3-6t^2+4)\hfill \\ G_{2,3}\left(t\right)=\frac{1}{6}(-3t^3+3t^2+3t+1)\hfill \\ G_{3,3}\left(t\right)=\frac{1}{6}{t}^3\hfill \end{array}\right.$$

(14)

Thus, the cubic uniform B-spline segment $P_{0,3}\left(t\right)$ can be described as

$$P_{0,3}\left(t\right)=\frac{1}{6}{\left[\begin{array}{c}1\\ t\\ t^2\\ t^3\end{array}\right]}^T\left[\begin{array}{cccc}1& 4& 1& 0\\ -3& 0& 3& 0\\ 3& -6& 3& 0\\ -1& 3& -3& 1\end{array}\right]\left[\begin{array}{c}{p}_0\\ p_1\\ p_2\\ p_3\end{array}\right],t\in [0,1]$$

(15)

where $p_0$, $p_1$, $p_2$ and $p_3$ are historical locus points, current locus points, and next locus points, respectively.

In this paper, cubic B-spline and VO method are used to smooth the path while avoiding obstacles. For UAV, since the historical waypoints are known, and the information of obstacles in the local range can be obtained through the UAV sensor and communication, $V_{new}$ is selected according to VO method first. Hence, one or more waypoints that the UAV is about to pass through can be estimated in real time through the UAV’s current position and $V_{new}$. Next, we use the historical trajectory points of the UAV, the trajectory points at the current moment, and the trajectory points at the next moment after the speed changes to generate a set of b-spline curves. Then, a series of curve points satisfying the cubic B-spline can be obtained by Equation (15), and the path smoothness can be realized when the UAV avoids obstacles.

3.3. Irregular Static Obstacle Collision Avoidance

When encountering a circular obstacle, set $V_b$ equal to 0. However, when encountering irregular static obstacles, it will cost more to uniformly set obstacles as circular ones. Therefore, the VO method is improved to avoid polygonal obstacles at a lower cost [21]. Static polygons can generally be divided into two types: convex and non-convex, while a non-convex polygon can be considered to consist of several convex polygons. Therefore, the key to avoid irregular static obstacles is how to avoid convex polygon obstacles.

When the sensor carried by the UAV detects an obstacle, the detected part will be constructed with a convex polygon. When the m vertices ($x_0$, $y_0$), ($x_1$, $y_1$)…, ($x_{m-1}$, $y_{m-1}$) of the obstacle are detected, a convex polygon with the centroid denoted as ($C_x$, $C_y$) is constructed. Their values are calculated by the following formula:

$$\begin{array}{cc}\hfill & C_x=\frac{1}{6S}\sum _{i=0}^{m-1}(x_i+x_{i+1})(x_i{y}_{i+1}-x_{i+1}{y}_i),\hfill \\ \hfill & C_y=\frac{1}{6S}\sum _{i=0}^{m-1}(y_i+y_{i+1})(x_i{y}_{i+1}-x_{i+1}{y}_i)\hfill \end{array}$$

(16)

where S represents the area of the constructed convex polygon, which can be obtained from Equation (17).

$$S=\frac{1}{2}\sum _{i=0}^{m-1}(x_i{y}_{i+1}-x_{i+1}{y}_i)$$

(17)

As shown in Figure 4, two half spaces can be formed by connecting the position $P_A$ of the UAV with the centroid $P_B$ of the polygon. From the angle collected in each half space, we can obtain a maximum angle, thus forming the collision cone of polygon. If the UAV’s speed is selected from outside the collision cone, the obstacles will be avoided.

3.4. Cooperative Obstacle Avoidance Algorithm for Multiple UAVs

In this paper, communication between multiple UAVs is firstly achieved through information completion algorithm, and then smooth obstacle avoidance is achieved by Spline_VO method. Specific steps to realize cooperative obstacle avoidance algorithm of multiple UAVs are shown in Figure 5.

In this paper, $V_{optimal}$ is determined by the vector of the current pathpoint and the target point, and is constrained by the maximum velocity and acceleration. When the new speed $V_{new}$ is selected using the Spline_VO method, the speed with the least deviation from the $V_{optimal}$ is selected based on the feasible speed set. Then, the $V_{new}$ is sent to the UAV’s flight control board to update its position.

4. Simulation Results

In order to verify the effectiveness of our proposed cooperative obstacle avoidance algorithm, we use the communication and obstacle avoidance methods described in this paper to give the simulation results of cooperative obstacle avoidance flight of multiple UAVs, and give the comparison of the simulation results of UAV flight path before and after using B-spline to do path smoothing.

The experimental environment has a circular obstacle and a rectangle (convex polygon). In order to fully test the UAV’s obstacle avoidance performance, a simulation algorithm space with size 300 m × 300 m is set, where the algorithm parameters are $v_{max}$ = 5 m/s, $d_{saft}$ = 10 m, $d_{com}^{max}$ = 80 m and $h_{vertical}$ = 30 m. $v_{max}$ represents the maximum flight speed of a UAV, $d_{saft}$ is the safe flight distance between a UAV and obstacles, $d_{com}^{max}$ is the maximum communication range of a UAV, and $h_{vertical}$ represents the flight altitude of all UAVs. The starting and ending points of the UAV group in the horizontal axis are presented in

Table 2. UAVs starting and target points.

UAV ID	Initial Path Point	Target Waypoints
1	(0, 0)	(300 m, 300 m)
2	(0, 75 m)	(300 m, 225 m)
3	(0, 150 m)	(300 m, 150 m)
4	(0, 225 m)	(300 m, 75 m)
5	(0, 300 m)	(300 m, 0)

.

In the case of the same simulation parameters, the information completion algorithm proposed in this paper is used to compare the communication of multiple UAVs with the direct UDP communication and search algorithm. Three path diagrams were generated showing the situation of five UAVs using different communication methods to avoid each other and reach the target point. In addition, after 10 simulation tests, the total time of 5 UAVs arriving at the target point is counted, and the total time of arriving at the target point is the average of 10 experiments.

According to the comparison of paths generated by different communication methods in Figure 6 and the comparison of data in

Table 3. Total time comparison of UAVs to target point.

Communication Mode	Total Obstacle Avoidance Time (s)
Direct communication	669
Search algorithm	616
Information Completion algorithm	585

, it can be seen that the information completion algorithm filters useless heartbeat information and stores the latest heartbeat information more effectively, which improves the communication speed and accuracy of UAVs, thus optimizing the obstacle avoidance path of UAVs and speeding up the arrival time of UAVs.

Figure 7 shows the result of each UAV’s obstacle avoidance performance through cooperative communication and Spline_VO method, and the obstacle avoidance path of multiple UAVs is generated. Figure 8 shows the flying speed of five UAVs. Figure 9 is the horizontal distance profile between UAV i and UAV j.

As can be seen from Figure 7, Figure 8 and Figure 9, a collision-free path of a multiple UAVs can be generated by using the proposed cooperative obstacle avoidance algorithm, and the distance between UAVs is greater than the safe flight distance. Therefore, we can claim that the cooperative obstacle avoidance method we put forward is effective.

However, the trajectory of single UAV in obstacle avoidance has problems of too large turning angle and uneven path, so the spline_VO method is introduced to solve these problems. To show the effect of the spline_VO method smoothing the path, we zoomed in on the flight paths of two UAVs, and plotted Figure 10. Figure 10a shows the simulation part of UAV’s path before smoothing, and Figure 10b shows the simulation part of UAV’s path after smoothing.

According to the comparison between Figure 10a,b, the Spline_VO method does solve the problems that UAV’s turning angle is too large and the path of UAV is not smooth.

5. Conclusions

In this paper, a cooperative obstacle avoidance algorithm of UAV group is proposed. Based on this algorithm, multiple UAVs can avoid dynamic obstacles and irregular static obstacles during the task execution from the start point to the end point. Heartbeat information filtering mechanism is proposed to solve the communication problems of multiple UAVs. Furthermore, the spline_VO method is used to achieve the obstacle avoidance and path smoothing of multiple UAVs, which allows UAVs to be deployed in real-world work environments. The simulation experiments is completed, and the performance of the proposed cooperative obstacle avoidance algorithm in cooperative obstacle avoidance and the feasibility of application in real environments are proved.