Next Article in Journal
The Port System in Addressing Sustainability Issues—A Systematic Review of Research
Previous Article in Journal
Multi-Attribute Decision-Making Ship Structural Design
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Collision Avoidance Decision Method for Unmanned Surface Vehicle Based on an Improved Velocity Obstacle Algorithm

1
Merchant Marine College, Shanghai Maritime University, Shanghai 201306, China
2
Shanghai High-Level Local University Innovation Team (Maritime Safety & Technical Support), Shanghai 201306, China
*
Author to whom correspondence should be addressed.
J. Mar. Sci. Eng. 2022, 10(8), 1047; https://doi.org/10.3390/jmse10081047
Submission received: 18 July 2022 / Accepted: 27 July 2022 / Published: 29 July 2022
(This article belongs to the Section Ocean Engineering)

Abstract

:
To ensure navigation safety, unmanned surface vehicles (USVs) need to have autonomous collision avoidance capability. A large number of studies on ship collision avoidance are available, and most of these papers assume that the target ships keep straight or follows the International Regulations for Preventing Collisions at Sea (COLREGS). However, in the actual navigation process, the target ship may temporarily turn. Based on the above reasons, this paper proposes a multi-ship collision avoidance decision method for USVs based on the improved velocity obstacle algorithm. In the basic dynamic ship domain model, a collision risk model is constructed to improve the accuracy of the risk assessment between the USV and target ships. The velocity obstacle algorithm is combined with the dynamic ship domain, and the collision avoidance timing and method are judged according to the collision risk. The simulation results show that the decision method can handle the situation that the target ship temporarily turns and has an emergency collision avoidance capability. Compared with the traditional VO algorithm, the collision avoidance time of the method is shorter, and the number of course changes is less.

1. Introduction

Unmanned surface vehicles (USVs) have a wide range of application value [1]. They can perform dangerous tasks in a messy environment without human intervention [2]. The ability of autonomous collision avoidance is the basis of ensuring the navigation safety and mission accomplishment of the USVs.
The USVs encounter unpredictable obstacles, such as ships in motion, during navigation. Collisions can cause significant economic losses and environmental pollution. There are no regulations specifically for the USVs. However, USVs should follow the International Regulations for Preventing Collisions at Sea (COLREGS) [3], which has become the consensus of relevant research. Common collision avoidance algorithms include the artificial potential field (APF) method [4,5,6,7,8], velocity obstacle (VO) algorithm [8,9,10,11,12,13] and some intelligent algorithms [13,14,15,16,17,18].
The basic principle of the APF method is to transform the influence of the target and the obstacle on the robot motion into an artificial potential field for description, and the robot moves along the combined force of the gravitational force of the target point and the repulsive force of the obstacle [19]. It is often used for path planning in the collision avoidance process, and the planned path is smooth and safe [4,5,6,7,8]. The main problem of this algorithm is that it can easily fall into the local optimum, which may cause the robot to stay at the local optimum point before reaching the target point.
Intelligent algorithms are mostly derived from bionics, such as the genetic algorithm, particle swarm algorithm and ant colony algorithm, which update the population toward the optimal solution through collective iteration of the population, combined with heuristic information provided by the evaluation function [20]. Different intelligent algorithms differ in terms of convergence speed and optimization of results [21]. However, most of them require a large amount of data, which can lead to a high computational cost of the algorithm. In maritime research, intelligent algorithms have been mainly applied in path planning [13,14,15,16,17,18].
The VO algorithm was first proposed in 1998 [22] and has been subsequently improved for the problems in its application. For example, EBVO (ellipse-based velocity obstacle) [23] was proposed for the obstacle shape problem, which sets the obstacle shape as an ellipse; NLVO (non-linear velocity obstacle) [24] and PVO (probability velocity obstacle) [25] were proposed for the obstacle motion problem. NLVO is mainly used to solve the nonlinear motion problem of the obstacle, and PVO is used to deal with the uncertainty in the obstacle motion process. RVO (reciprocal velocity obstacle) [26] and ORCA (optimal reciprocal collision avoidance) [27] were proposed for the motion oscillation problem, which consider mainly the case when both the robot and the obstacle take action because of the collision risk.
The VO algorithm lacks the ability to plan the best path to reach the target point; however, it is also more widely used in the field of ship collision avoidance, such as collision risk assessment [28,29], combining with other algorithms for path planning [9,13] or providing collision avoidance decision solutions. The VO algorithm, as a reactive algorithm, only needs to input the basic information about the robot and the obstacle to obtain the set of collision avoidance velocities. The algorithm is fast in calculation and suitable for high-speed operation with short reaction time. The VO has the ability to handle multiple obstacles to avoid collisions; however, there may be motion oscillation and over-avoidance during collision avoidance.
To make the collision avoidance decisions made by the VO algorithm practically applicable, researchers have combined the VO algorithm or its improvements such as ORCA, RVO, GVO (generalized velocity obstacle), PVO with COLREGs [10,11,30,31]. However, all these studies assume that the Target Ship (TS) also follows COLREGs or the predicted trajectory of the TS can be obtained. In actual navigation, the TS may violate the COLREGs or turn temporarily.
Song et al. considered emergency situations due to the irregular operation of the TS; however, the VO algorithm was only used to deal with non-emergency situations [8]. Shaobo W et al. combined the improved VO algorithm with a finite state machine to build a collision avoidance decision system that handle unexpected situations [32]. The above studies show that the VO algorithm has applications in the field of ships’ collision avoidance.
With the development of USVs, there will be a coexistence of USVs and manned ships. The behavior of manned ships has greater uncertainty, such as temporary turning or violating COLREGs. These behaviors can affect the encounter ships and even lead them into emergency situations. In order to ensure that the USVs safely avoid the manned ships, this paper proposes an improved collision avoidance decision method for USVs based on the VO algorithm.
The advantages of this decision method are that it combines the VO algorithm with the collision risk model, so that it can cope with the unexpected situation due to the TSs’ behaviors. It also ensures that the USV does not take unnecessary actions when the TSs’ actions do not pose a threat to it. Two collision avoidance schemes, non-emergency collision avoidance and emergency collision avoidance, are developed so that the USV follow COLREGs for non-emergency collision avoidance. In emergency situations, it can quickly move away from the TS to avoid collision. The calculation of this method is low cost and fast, so it is suitable for real-time collision avoidance.
The main contribution of this paper is to apply the dynamic ship domain to the VO algorithm. The obstacles in the traditional VO algorithm are set to be circular, and this assumption facilitates the calculation of velocity obstacle cones. However, given the special characteristics of ships’ collision avoidance, this paper replaces the TS with a dynamic ship domain, the shape of which depends on the TS velocity and encounter situation with USV. This approach makes the VO algorithm targeted to deal with collision avoidance in different encounter situations, making it more applicable in ship collision avoidance.
The remainder of this paper is organized as follows. In Section 2, the underlying theories related to the algorithm model are introduced. In Section 3, the mathematical model of the algorithm is introduced. In Section 4 and Section 5, the simulation results are shown to verify the feasibility and effectiveness of the proposed decision method. Section 6 concludes the whole paper and looks ahead to future research.

2. Basic Theory

2.1. VO Algorithm

The basic principle of the VO algorithm is to generate the velocity set that cause the collision by geometric calculation. By keeping the end point of the robot’s velocity vector outside the conical region formed by the velocity set, collisions can be prevented. The generation principle of velocity obstacle cone is shown in Figure 1. The mathematical definition of VO is defined as follows.
VO B A ( v B ) = { v A p A + ( v A v B ) t     B A }
where v A and v B are the velocities of robots A and B; p A is the position of robot A; t is the motion time; and ⊕ is the Minkowski sum operation.

2.2. Encounter Situation

According to the COLREGs, the encounter situation can be divided into three kinds of situations, including overtaking, head-on situation and crossing situation. COLREGs Rule 13 defines that a vessel shall be deemed to be overtaking when coming up with another vessel from a direction more than 22.5° abaft her beam and indicates that the overtaking boat assumes the responsibility of giving way. COLREGs Rule 14 provides that each should change its course to starboard so that each can pass on the port side of the other when two vessels are in a head-on situation.
COLREGs Rule 15 provides that the vessel which has the other on her own starboard side is the give-way vessel in crossing situation. The give-way shall avoid passing the bow of another vessel, and its alteration of course or speed shall be large, as mentioned in Rule 8. The stand-on vessel shall keep her course and speed, except emergency situation. COLREGs do not provide mathematical definitions of the head-on situation and the crossing situation. To ensure safe navigation, the encounter situation should be accurately classified.
In this paper, we classify the encounter type according to the relative bearing α b and relative course α h of the TS. As shown in Figure 2, in the XOY coordinate system, the coordinates of the USV are ( X O , Y O ) , the speed is v O , the course is φ O   ( 0     φ O     2 π ) and the length is l O ; the coordinates of the TS are ( X T , Y T ) , the speed is v T , the course is φ T   ( 0     φ T     2 π ) and the length is l T .
The relative bearing α B   ( 0 α B 2 π ) of the TS with respect to the USV is expressed as Equation (2):
α B = { tan 1 ( X T X O Y T Y O )   X T     X O ,   Y T   >   Y O tan 1 ( Y O Y T X T X O )   +   π 2   X T   >   X O , Y T   Y O tan 1 ( X T X O Y T Y O )   +   π   X T   X O , Y T < Y O tan 1 ( Y T Y O X O X T )   + 3 π 2 X T <   X O , Y T     Y O
Taking the position of the USV as the coordinate origin, the body-fixed coordinate system is established. In this coordinate system, the relative bearing α b   ( 0 α b 2 π ) of the TS is expressed as Equation (3):
α b = { α B φ O   α B   φ O α B φ O + 2 π   α B <   φ O  
The relative course α h   ( 0 α h 2 π ) of the TS with respect to the USV is expressed as Equation (4):
α h = { φ T φ O   α B   φ O φ T φ O + 2 π   α B <   φ O  
According to α b , the area near the USV can be divided into six parts, as shown in Figure 3, where the abbreviations are explained as shown in Table 1, and the range of each part is shown in Table 2. In order to ensure navigation safety, the range of hand-on encounter is determined to π/4, forming the P1 area. The range of overtaking is divided according to 22.5° abaft beam, forming P4 area. The remaining parts are crossing encounter situations. On the basis of the above, the encounter is judged by combining α h [31,33]. Detailed information for determining the encounter situation is shown in Table 3.

2.3. Ship Domain

One of the bases for the determination of the VO cone is the robot shape. The USV is small in size, and thus it is considered as a mass point. The ship domain is used to represent the TS. Collision avoidance maneuvering is conducted with the safety standard that the TS domain should not be violated by the USV.
In this paper, the Richard Bucknall ship domain model is used [34]. The model takes into account COLREGs, and the shape changes with the encounter type and ship’s speed, which facilitates more accurate collision risk assessment.
The front half of the TS domain is semi-elliptical and the back half is semi-circular in head-on or crossing encounter. The expressions are as follows. The radii for the fore section of domain are given by Equation (5).
ESAF = { ( v T ×   Scaling ) + Dcaling   ( v T ×   Scaling ) + Dcaling   MinSD   MinSD     otherwise  
The radii for the aft section of domain are given by Equation (6).
  ESAA = {   R A + Dcaling     R A + Dcaling MinSD   MinSD   otherwise
Dcaling = Δ t ×   DTScale
R A = { v T ×   Scaling   v T ×   Scaling   <   SASLimit   2 SASLimit   ( v T ×   Scaling   ) otherwise  
where Scaling is defined as 1 min; MinSD is defined as 0.7 nm; Δt is the time step; DTScale is defined as 0.5; SASLimit is defined as 0.7 nm.
For overtaking encounter, the ship domain of the TS is circular and the radius is:
R D   = { v T ×   OTScaling     v T ×   OTScaling     MinSD     MinSAD     otherwise
where OTScaling is defined as 1 min.
When there is not collision risk between the two ships, the ship domain of the TS is circular and the radius is:
R D   = { R A   +   Dcaling     R A   +   Dcaling MinSD     MinSAD     otherwise

2.4. Collision Risk Model

The ship collision risk is used to measure the probability of collision between ships and takes a value between 0 and 1. In this paper, the larger the value of collision risk of the TS, the higher the priority of collision avoidance. If the collision risk exceeds 0.5, collision avoidance action is taken. This method can avoid premature collision avoidance.
There is not yet a unified theoretical system for ship collision risk assessment [35]. Fuzzy comprehensive evaluation method is introduced for ship collision risk assessment, which expresses the collision risk through the membership functions of relevant parameters. The definition of the membership function directly affects the reliability of the collision risk assessment.
From the analysis of collision geometry principle, five factors such as the distance at the closest point of approach (DCPA), the time to the closest point of approach (TCPA), distance between two ships (D), relative bearing ( α b ) and speed ratio (K) are used as the basic evaluation parameters to establish the collision risk model [36].
The DCPA and TCPA are calculated as follows.
DCPA = D × sin ( φ OT α b π ) TCPA = D × cos ( φ OT α b π ) V OT
To ensure that the USV does not intrude into the TS’s domain, the minimum safe distance D 1 is defined [37].
For head-on or crossing encounter, D 1 is as:
D 1 = { ESAF × ESAA ESAF 2 sin 2 α + ESAA 2 cos 2 α + 1   0 α < π 2   or   3 π 2   < α 2 π   ESAA + 1   π 2 α 3 π 2  
where α is the relative bearing of the USV.
In other situations, D 1 is as:
D 1 = R D + 1
The membership function of DCPA is as:
r DCPA = { 0 D 2 < | DCPA | 1 2 1 2 sin [ π D 2 D 1 ( | DCPA | D 1 + D 2 2 ) ] D 1 < | DCPA | D 2 1 | DCPA | D 1
D 2 = 2 D 1
The membership function of TCPA is as:
r TCPA = {   0               t 2 < | TCPA | ( t 2 | TCPA | t 2 t 1 ) 2         t 1 < | TCPA | t 2   1   0 | TCPA | t 1
where t 1 and t 2 are calculated as follows:
t 1 = { D 1 2 DCPA 2 V oT         DCPA D 1 ( D 1 DCPA ) V oT           DCPA > D 1
t 2 = { D 2 2 DCPA 2 V oT         DCPA D 2 ( D 2 DCPA ) V oT         DCPA > D 2
The membership function of D is as:
r D = { 1   0 D D 1 ( D 2 D D 2 D 1 ) 2   D 1 < D < D 2 0   D 2 D
The membership function of α b is as:
r α b = 1 2 [ cos ( α b 19 180 × π ) + 440 289 + cos 2 ( α b 19 180 × π ) ] 5 17   ( 0 α b < 2 π )
The membership function of K is as:
r K = ( 1 + 2 K K 2 + 1 + 2 K × | sin ( φ T φ O ) | ) 1
K = v O v T
The weights of the membership functions are set as 0.4, 0.367, 0.167, 0.033 and 0.033. The expression for the risk is obtained as [32]:
E = 0 . 4 r DCPA + 0 . 367 r TCPA + 0 . 167 r D + 0 . 033 r α b + 0 . 033 r K

3. Collision Avoidance Decision Method

The collision avoidance process is shown in Figure 4.
Firstly, the relative bearing and course of the TS are calculated. According to them, determine the encounter situation and ship domain and judge the collision avoidance responsibility k. The values of k are 0, 0.5 and 1, representing three cases that the USV is the stand-on ship, both the USV and TS are the give-way ships, and the USV is the give-way ship. Next, the collision risk E is calculated. When E     0 . 5 , the end point of the velocity vector of the USV is judged whether it falls within the VO cone. The judgment process is as follows.
For head-on and crossing encounters, if X 1 , X 2 X O , Equations (17) and (18) are calculated. If X 1   or   X 2 = X O , Equations (19) and (20) are calculated.
{ dy 1 dx 1 = ESAA × sin ( 2 π φ O ) × sin t ESAF × cos ( 2 π φ O ) × cos t ESAA × cos ( 2 π φ O ) × sin t + ESAF × sin ( 2 π φ O ) × cos t dy 1 dx 1 = ESAA × sin ( 2 π φ O ) × cos t + ESAF × cos ( 2 π φ O ) × sin t + Y T Y O ESAA × cos ( 2 π φ O ) × cos t ESAF × sin ( 2 π φ O ) × sin t + X T X O   ( 0 t π )
{ dy 2 dx 2 = ESAA × sin ( 3 π φ O ) × sin t ESAA × cos ( 3 π φ O ) × cos t ESAA × cos ( 3 π φ O ) × sin t + ESAA × sin ( 3 π φ O ) × cos t dy 2 dx 2 = ESAA × sin ( 3 π φ O ) × cos t + ESAA × cos ( 3 π φ O ) × sin t + Y T Y O ESAA × cos ( 3 π φ O ) × cos t ESAA × sin ( 3 π φ O ) × sin t + X T X O ( 0 t π )
ESAA × cos ( 2 π φ O ) × cos t ESAF × sin ( 2 π φ O ) × sin t + X T X O = 0   ( 0 t π )
ESAA × cos ( 3 π φ O ) × cos t ESAA × sin ( 3 π φ O ) × sin t + X T X O = 0   ( 0 t π )
When in other situations, if X 1 , X 2 X O , then Equation (21) is calculated. If   X 1   or   X 2 = X O , then Equation (24) is calculated.
{ dy dx = cos t sin t   dy dx = R D × sin t + Y T   Y O R D × cos t + X T   X O     ( 0 t 2 π )
R D × cos t + X T X O = 0   ( 0 t 2 π )
By the above equation, t is found and then brought to the ship domain expression. The coordinates of the tangent point ( X 1 , Y 1 ) ,   ( X 2 , Y 2 ) of the line crossing ( X O , Y O ) tangent to the ship domain are obtained.
In this paper, it is assumed that the ship course is equivalent to the velocity direction, and the velocity component of the USV in the XOY coordinate system is expressed as:
X v O = { v O × sin φ O   0 φ O < π 2 v O × sin ( π   φ O )   π 2 φ O < π v O × sin ( φ O   π )   π φ O < 3 π 2 v O × sin ( 2 π   φ O )   3 π 2 φ O < 2 π
Y v O = { v O × cos φ O   0 φ O < π 2 v O × cos ( π φ O )   π 2 φ O < π v O × cos ( φ O π )   π φ O < 3 π 2   v O × cos ( 2 π φ O )   3 π 2 φ O < 2 π
Similarly, the components of the TS’s velocity X v T , Y v T can be calculated. The end point coordinates of the USV velocity vector are ( X O + X v O , Y O + Y v O ) .
The combination of VO algorithm and COLREGs is based on the weight idea of RVO. That is, the absolute VO cone is determined according to k. The starting point of absolute VO cone is calculated as:
{ X = X O + k × X v T + ( 1 k ) × X v O Y = Y O + k × Y v T + ( 1 k ) × Y v O
Similarly, the coordinates of the two tangent points after translation ( X 1 , Y 1 ) , ( X 2 , Y 2 ) can be obtained. Then the absolute VO cone boundary angles α 1 and α 2 and the angle α O , that is the end point of the USV velocity vector relative to the start of the VO cone, are calculated. If Equation (26) is satisfied, it means that collision avoidance is required.
{ min ( α 1 , α 2 ) < α O < max ( α 1 , α 2 )   max ( α 1 , α 2 ) min ( α 1 , α 2 ) π max ( α 1 , α 2 ) < α O 2 π   or   0 α O < min ( α 1 , α 2 )   max ( α 1 , α 2 ) min ( α 1 , α 2 ) > π
This paper sets the USV to avoid collisions by turning only. According to COLREGs Rule 8, course is changed at least π/6 in non-emergency situations [38]. Meanwhile, for the convenience of algorithm design, it is assumed that the USV only turn right when it acts as a give-way ship in non-emergency situations. Therefore, the collision avoidance velocity is calculated as follows.
The lines where the velocity cone boundaries lie are expressed as:
( y Y ) × ( X 1 X ) ( x X ) × ( Y 1 Y ) = 0
( y Y ) × ( X 2 X ) ( x X ) × ( Y 2 Y ) = 0
Based on the coordinates of the points obtained by the Equations (27) and (28), the meeting points of a circle with radii equal to the value of the velocity vector of USV and the lines where the VO cone boundaries are located can be obtained. The angles φ 1 , φ 2 of the meeting points with respect to ( X O , Y O ) are found. If the angle is equal to α 1   or   α 2 , the point is the true intersection with the velocity barrier cone boundary.
{ ( x X O ) 2 + ( y Y O ) 2 = v O 2 ( y Y ) × ( X 1 X ) ( x X ) × ( Y 1 Y ) = 0
{ ( x X O ) 2 + ( y Y O ) 2 = v O 2 ( y Y ) × ( X 2 X ) ( x X ) × ( Y 2 Y ) = 0
According to the COLREGs and the minimum constraint of course change, the collision avoidance velocity angle φ O is found as Equation (29).
φ O = { max ( φ O + π 6 , max ( φ 1 , φ 2 ) )   max ( α 1 , α 2 ) min ( α 1 , α 2 ) π   max ( φ O 11 π 6 , min ( φ 1 , φ 2 ) )   max ( α 1 , α 2 ) min ( α 1 , α 2 ) > π   , φ O 11 π 6 min ( φ O + π 6 , min ( φ 1 , φ 2 ) )   max ( α 1 , α 2 ) min ( α 1 , α 2 ) > π   , φ O < 11 π 6
When 0 . 5     E   <   0 . 8 , the USV avoids collision with the TS according to φ O ; when E     0 . 8 , the COLREGs are ignored. In φ 1 and φ 2 , the course with the smallest difference from the original course is chosen. When the end point of the initial velocity vector is no longer located within the VO cone of any TS, the course is adjusted to the initial state.

4. Simulation Experiments

According to the encounter scenario proposed by Woerner [39], four-ship encounter scenarios are established in this paper. Figure 5 shows the initial position of ships. The information of the ships is shown in Table 4, Table 5, Table 6 and Table 7. Through simulation, the collision avoidance is simulated when the TS follows the COLREGs. On the basis of the four scenarios, the collision avoidance of the USV is simulated when the TS temporarily turn.
The collision avoidance of VO algorithm in the same scenarios is simulated. The collision avoidance effect of the improved algorithm and the VO algorithm is compared. The results of the simulation verify the feasibility and effectiveness of the proposed decision method. Considering the running time of the algorithm, 1 min is used as the time step. The simulation duration is two hours. In the simulation charts, the USV is represented by S0, and the TS1, TS2 and TS3 are represented by S1, S2 and S3.

4.1. Target Ship Follow COLREs

4.1.1. Scenario 1

Figure 6 shows the collision risk between each TS and USV. The collision risk between the USV and the TS3 is greater than 0.5 at the 10th min. The TS3 does not change course because the two vessels will not be in collision if they are sailing at the original velocity. The collision risk between the USV and the TS2 is greater than 0.5 at the 17th min. The USV, as a give-way ship, should turn right to overtake. However, compared to the TS3, the USV is a stand-on ship. Given that the collision risk between the two ships does not increase after the right turn, the USV choose to turn right. Figure 7 shows the process of collision avoidance. Figure 8 shows that the USV does not enter the ship domain of any TS during the navigation.

4.1.2. Scenario 2

Figure 9 shows the collision risk between each TS and USV. The collision risk between the USV and the TS2 is greater than 0.5 at the beginning. The TS2 does not change course because the two vessels will not be in collision if they are sailing at the original velocity. The collision risk between the USV and the TS3 is greater than 0.5 at the ninth min. Given that the collision risk between the USV and the TS2 does not increase after the USV turns right, the USV turns right to avoid the TS3. This action can also achieve the purpose of overtaking the TS1. Figure 10 shows the process of collision avoidance. Figure 11 shows that the USV does not enter the ship domain of any TS during the navigation.

4.1.3. Scenario 3

Figure 12 shows the collision risk between each TS and USV. The TS3, as the give-way ship, turns right to avoid the USV at the beginning of the navigation. The USV and the TS1 are in a head-on situation. According to the improved VO, the two vessels will not be in collision if they are sailing at the original velocity. Therefore, the USV keeps going straight. At the 24th min, the collision risk between the USV and TS2 is greater than 0.5, and the USV turns right. Figure 13 shows the process of collision avoidance. Figure 14 shows that the USV does not enter the ship domain of any TS during the navigation.

4.1.4. Scenario 4

Figure 15 shows the collision risk between each TS and USV. At the 15th min, the collision risk between the USV and the TS1 is greater than 0.5. Both ships start to take collision avoidance actions. At the 18th min, the two ships resume the original course. During the navigation, there is no collision risk between the USV and other TSs, and thus there is no other collision avoidance operation. Figure 16 shows the process of collision avoidance. Figure 17 shows that the USV does not enter the ship domain of any TS during the navigation.

4.2. Target Ship Temporarily Turns

Based on scenario 1, it is assumed that the course of the TS2 changes to 3π⁄4 at the 28th min. While avoiding the collision avoidance through the proposed decision method, the USV starts to overtake the TS2 at the 17th min. The action of TS2 leads the USV to an emergency situation, which causes the USV to turn right again for collision avoidance. At the 36th min, the USV resumes its original course to finish the collision avoidance. While avoiding the collision avoidance through the VO algorithm, the USV takes collision avoidance by turning to the left when the ships start sailing.
Therefore, it is not affected by the action of TS2. After passing the stern of target vessel 2, the USV resumes its original course at the 78th min. The collision avoidance time of the VO algorithm is more than the time spent by the proposed method. During the collision avoidance process, there are three small course changes of the USV, which does not satisfy the COLREGs Rule 8. Figure 18 shows the change of the USV course. Figure 19 shows the trajectory for two hours.
Based on scenario 2, it is assumed that the course of the TS3 changes to 19π⁄12 at the 10th min. While avoiding the collision avoidance through the proposed decision method, the USV turns right at the 9th min. At the 18th min, the USV resumes its original course. The action of TS3 causes the USV to enter an emergency situation. The USV turns right again. While avoiding the collision avoidance through the VO algorithm, the USV turns left. After a small jitter, the USV resumes its original course at the 37th min. The VO algorithm avoids collision by the longer time and more course changes. Figure 20 shows the change of the USV’s course. Figure 21 shows the trajectory for two hours.
Based on scenario 3, it is assumed the TS3 resumes the original course in advance. While avoiding the collision avoidance through the proposed decision method, the behavior of TS3 causes the USV to enter an emergency situation. To avoid the TS3, the USV turns left at the 9th min. While avoiding the collision avoidance through the VO algorithm, the USV turns left at the initial stage of navigation, which is not in accordance with the COLREGs. After several alterations of course, the USV resumes its original course at the 24th min. The VO algorithm avoids collision by more course changes. Figure 22 shows the change of the USV’s course. Figure 23 shows the trajectory for two hours.
Based on scenario 4, it is assumed that the initial position of TS2 is (10, 13). The TS2 and TS1 are in the crossing encounter. TS1 as the give-way ship turns to the right. When collision avoidance is performed by the proposed decision method, the behavior of TS1 results in no collision risk between it and the USV. Therefore, the USV does not take any collision avoidance action. However, the USV still takes action, which is not necessary, when collision avoidance is performed by the VO. And the act of turning to the left at the beginning is not in accordance with COLREGs. Figure 24 shows the change of the USV’s course. Figure 25 shows the trajectory for two hours.

5. Result

In this paper, four four-ship encounter scenarios are established. The scenarios where the TS takes temporary action in different encounter situations are set up to simulate the collision avoidance of the USV.
The simulation shows that the decision method proposed in the paper can help the USV to complete multi-ship collision avoidance in open water. The method has the ability to cope with the unexpected situation arising from the TS. It is found that when the temporary action of the TS puts the USV in danger again, the USV changes direction again or extends the collision avoidance time. When the temporary action of the TS does not affect the USV, the USV does not take unnecessary actions.
To verify whether the proposed decision method also has the same defects as the VO algorithm, the collision avoidance process of VO is simulated. The two methods are compared and the following conclusions are obtained.
The decision method does not cause USV to prematurely avoid collision. There is no condition set in the VO algorithm to start collision avoidance, so it is constantly looking for collision avoidance solutions from the beginning. The decision method determines the start of collision avoidance by the collision risk, which prevents the USV from taking premature action.
The decision method does not adjust course several times in a row. The VO algorithm assumes that the TS keeps its original course, so the change of the TS’s course makes it look for solutions again. In contrast, the decision method considers the actions of the TS, and the TS’s behavior following the COLREGs does not affect the USV anymore. In addition, the USV using VO algorithm avoids all ships at the same time, and the USV using decision method avoids the ships that have collision risk. Therefore, the more TSs there are, the more likely to generate motion oscillation.
The decision method is more efficient. Continuous small turns prevent the USV from moving away from the TS quickly. Therefore, the USV with VO algorithm is within the influence of the TS for a longer time. When non-emergency collision avoidance is completed by the decision method, the behavior of the USV follows the COLREGs. Under the rule constraint, the course of the USV changes at least π ⁄6 so that it can move away from the TS in a short time. This allows the USV to resume its original heading earlier.

6. Conclusions

In this paper, we propose a collision avoidance decision method for USVs based on the VO algorithm. We considered that, in the actual navigation process, the actions of the TS are difficult to predict. Ships may take temporary turns for certain reasons, placing the USV in danger. In this paper, we chose to improve the VO algorithm to help the USVs cope with unexpected situations. To make the VO algorithm more applicable to collision avoidance of the USVs, the dynamic ship domain was used. Combined with the weight idea of RVO algorithm, COLREGs constraints were added to the model to provide the USV with decisions that follow the COLREGs.
According to the collision risk, the collision avoidance timing and target were judged to avoid taking premature or unsuitable collision avoidance actions. In addition, temporary action of the target vessel may lead to an emergency situation. The emergency risk value was set, beyond which, the USV will take collision avoidance action without considering the COLREGs. Through simulation experiments, the feasibility and effectiveness of the decision method were verified.
Compared with the VO algorithm, the method had a shorter collision avoidance time, did not take collision avoidance actions prematurely and did not change course several times in a row. However, the algorithm does not consider the maneuverability constraint of the USV and assumes that the USV can change its velocity instantaneously and that the heading is the direction of speed. After completing collision avoidance, only the heading was adjusted, and the course deviation was not considered. Future research will focus on the above two aspects.

Author Contributions

Writing—review and editing, Y.L. and Writing—original draft, H.Z. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by National Natural Science Foundation of China (51909155), Science and Technology Commission of Shanghai Municipality (22010502000, 21692193000, 22010501800).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The funders had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript; or in the decision to publish the results.

References

  1. Liu, Z.; Zhang, Y.; Yu, X.; Yuan, C. Unmanned surface vehicles: An overview of developments and challenges. Annu. Rev. Control 2016, 41, 71–93. [Google Scholar]
  2. Barrera, C.; Padron, I.; Luis, F.S.; Llinas, O.; Marichalet, N. Trends and challenges in unmanned surface vehicles (Usv): From survey to shipping. TransNav Int. J. Mar. Navig. Saf. Sea Transp. 2021, 15, 135–142. [Google Scholar]
  3. IMO. Conventions on the International Regulations for Preventing Collision at Sea (COLREGs); The International Maritime Organization (IMO): London, UK, 1972.
  4. Mousazadeh, H.; Jafarbiglu, H.; Abdolmaleki, H.; Elham, O. Developing a navigation, guidance and obstacle avoidance algorithm for an Unmanned Surface Vehicle (USV) by algorithms fusion. Ocean. Eng. 2018, 159, 56–65. [Google Scholar]
  5. Ou, W.; Guo, X. Collision Avoidance Algorithm for Unmanned Surface Vehicle Based on Improved Artificial Potential Field and Ant Colony Optimization. In Proceedings of the 2019 International Conference on Computer, Network, Communication and Information Systems (CNCI 2019), Qingdao, China, 27–29 March 2019; Atlantis Press: Dordrecht, The Netherlands, 2019; pp. 334–347. [Google Scholar]
  6. Chen, Y.; Bai, G.; Zhan, Y.; Hu, X. Path planning and obstacle avoiding of the USV based on improved ACO-APF hybrid algorithm with adaptive early-warning. IEEE Access 2021, 9, 40728–40742. [Google Scholar]
  7. Sang, H.; You, Y.; Sun, X.; Zhou, Y.; Liu, F. The hybrid path planning algorithm based on improved A* and artificial potential field for unmanned surface vehicle formations. Ocean. Eng. 2021, 223, 108709. [Google Scholar]
  8. Song, A.L.; Su, B.Y.; Dong, C.Z.; Shen, D.W.; Xiang, E.Z.; Mao, F.P. A two-level dynamic obstacle avoidance algorithm for unmanned surface vehicles. Ocean. Eng. 2018, 170, 351–360. [Google Scholar]
  9. Mou, J.; Li, M.; Hu, W.; Zhang, X.; Gong, S.; Chen, P.; He, Y. Mechanism of dynamic automatic collision avoidance and the optimal route in multi-ship encounter situations. J. Mar. Sci. Technol. 2021, 26, 141–158. [Google Scholar]
  10. Kuwata, Y.; Wolf, M.T.; Zarzhitsky, D.; Huntsberger, T.L. Safe Maritime Autonomous Navigation with COLREGS, Using Velocity Obstacles. IEEE J. Ocean. Eng. 2013, 39, 110–119. [Google Scholar]
  11. Zhao, Y.; Li, W.; Shi, P. A real-time collision avoidance learning system for Unmanned Surface Vessels. Neurocomputing 2016, 182, 255–266. [Google Scholar]
  12. Kufoalor, D.K.M.; Brekke, E.F.; Johansen, T.A. Proactive collision avoidance for ASVs using a dynamic reciprocal velocity obstacles method. In Proceedings of the 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), Madrid, Spain, 1–5 October 2018; IEEE: New York, NY, USA, 2018; pp. 2402–2409. [Google Scholar]
  13. Xia, G.; Han, Z.; Zhao, B.; Wang, X. Local path planning for unmanned surface vehicle collision avoidance based on modified quantum particle swarm optimization. Complexity 2020, 2020, 15. [Google Scholar]
  14. Ning, J.; Chen, H.; Li, T.; Li, W.; Li, C. COLREGs-Compliant unmanned surface vehicles collision avoidance based on multi-objective genetic algorithm. IEEE Access 2020, 8, 190367–190377. [Google Scholar]
  15. Wang, L.; Zhang, Z.; Zhu, Q.; Ma, S. Ship route planning based on double-cycling genetic algorithm considering ship maneuverability constraint. IEEE Access 2020, 8, 190746–190759. [Google Scholar]
  16. Lyridis, D.V. An improved ant colony optimization algorithm for unmanned surface vehicle local path planning with multi-modality constraints. Ocean. Eng. 2021, 241, 109890. [Google Scholar]
  17. Wang, H.; Fu, Z.; Zhou, J.; Fu, M.; Ruan, L. Cooperative collision avoidance for unmanned surface vehicles based on improved genetic algorithm. Ocean. Eng. 2021, 222, 108612. [Google Scholar]
  18. Zhang, L.; Mou, J.; Chen, P.; Li, M. Path planning for autonomous ships: A hybrid approach based on improved apf and modified vo methods. J. Mar. Sci. Eng. 2021, 9, 761. [Google Scholar]
  19. Khatib, O. Real-time obstacle avoidance for manipulators and mobile robots. In Autonomous Robot Vehicles; Springer: New York, NY, USA, 1986; pp. 396–404. [Google Scholar]
  20. Mohamed-Seghir, M.; Kula, K.; Kouzou, A. Artificial intelligence and soft computation methods in automatic collision avoidance algorithms for ships. Navig. China 2016, 39, 35–40. [Google Scholar]
  21. Liu, X.; Ye, X.; Wang, Q.; Li, W.; Gao, H. Review on the research of local path planning algorithms for unmanned surface vehicles. Chin. J. Ship Res. 2021, 16, 1–10. [Google Scholar]
  22. Fiorini, P.; Shiller, Z. Motion planning in dynamic environments using velocity obstacles. Int. J. Robot. Res. 1998, 17, 760–772. [Google Scholar]
  23. Lee, B.H.; Jeon, J.D.; Oh, J.H. Velocity obstacle based local collision avoidance for a holonomic elliptic robot. Auton. Robot. 2017, 41, 1347–1363. [Google Scholar]
  24. Large, F.; Laugier, C.; Shiller, Z. Navigation among moving obstacles using the NLVO: Principles and applications to intelligent vehicles. Auton. Robot. 2005, 19, 159–171. [Google Scholar]
  25. Coué, C.; Pradalier, C.; Laugier, C.; Fraichard, T.; Bessière, P. Bayesian occupancy filtering for multitarget tracking: An automotive application. Int. J. Robot. Res. 2006, 25, 19–30. [Google Scholar]
  26. Berg, J.; Guy, S.J.; Lin, M.; Manocha, D. Reciprocal n-body collision avoidance. In Robotics Research; Springer: Berlin/Heidelberg, Germany, 2011; pp. 3–19. [Google Scholar]
  27. Van Den Berg, J.; Guy, S.J.; Lin, M.; Lin, M.C.; Manocha, D. Optimal reciprocal collision avoidance for multi-agent navigation. In Proceedings of the IEEE International Conference on Robotics and Automation, Anchorage, AK, USA, 4–8 May 2010. [Google Scholar]
  28. Yuan, X.; Zhang, D.; Zhang, J.; Zhang, M.; Soarese, C.G. A novel real-time collision risk awareness method based on velocity obstacle considering uncertainties in ship dynamics. Ocean. Eng. 2021, 220, 108436. [Google Scholar]
  29. Li, J.; Wang, H.; Guan, Z.; Pan, C. Distributed multi-objective algorithm for preventing multi-ship collisions at sea. J. Navig. 2020, 73, 971–990. [Google Scholar]
  30. Huang, Y.; Chen, L.; Van Gelder, P. Generalized velocity obstacle algorithm for preventing ship collisions at sea. Ocean. Eng. 2019, 173, 142–156. [Google Scholar]
  31. Cho, Y.; Han, J.; Kim, J. Efficient COLREG-compliant collision avoidance in multi-ship encounter situations. IEEE Trans. Intell. Transp. Syst. 2020, 23, 1899–1911. [Google Scholar]
  32. Shaobo, W.; Yingjun, Z.; Lianbo, L. A collision avoidance decision-making system for autonomous ship based on modified velocity obstacle method. Ocean. Eng. 2020, 215, 107910. [Google Scholar]
  33. Ni, S.; Liu, Z.; Cai, Y.; Wang, X. Modelling of ship’s trajectory planning in collision situations by hybrid genetic algorithm. Pol. Marit. Res. 2018, 25, 14–25. [Google Scholar]
  34. Tam, C.K.; Bucknall, R. Collision risk assessment for ships. J. Mar. Sci. Technol. 2010, 15, 257–270. [Google Scholar]
  35. Chen, P.; Huang, Y.; Mou, J.; van Gelder, P.H.A.J.M. Probabilistic risk analysis for ship-ship collision: State-of-the-art. Saf. Sci. 2019, 117, 108–122. [Google Scholar]
  36. Hu, Y.; Zhang, A.; Tian, W.; Zhang, J.; Hou, Z. Multi-ship collision avoidance decision-making based on collision risk index. J. Mar. Sci. Eng. 2020, 8, 640. [Google Scholar]
  37. Zheng, Z.Y.; Wu, Z.L. Space collision risk and its model. J. Dalian Marit. Univ. 2001, 27, 1–5. [Google Scholar]
  38. Cockcroft, A.N.; Lameijer, J.N.F. Guide To The Collision Avoidance Rule; Elsevier: Amsterdam, The Netherlands, 2003. [Google Scholar]
  39. Woerner, K.L.; Benjamin, M.R.; Novitzky, M.; John, J.; Leonard, J.J. Collision avoidance road test for COLREGS-constrained autonomous vehicles. In Proceedings of the OCEANS 2016 MTS/IEEE Monterey, Monterey, CA, USA, 19–23 September 2016; IEEE: New York, NY, USA, 2016; pp. 1–6. [Google Scholar]
Figure 1. Principle of the VO algorithm.
Figure 1. Principle of the VO algorithm.
Jmse 10 01047 g001
Figure 2. Location map of two ships.
Figure 2. Location map of two ships.
Jmse 10 01047 g002
Figure 3. Chart used to determine the encounter type.
Figure 3. Chart used to determine the encounter type.
Jmse 10 01047 g003
Figure 4. Collision avoidance process.
Figure 4. Collision avoidance process.
Jmse 10 01047 g004
Figure 5. Initial state of each ship.
Figure 5. Initial state of each ship.
Jmse 10 01047 g005
Figure 6. The collision risk between TS and USV.
Figure 6. The collision risk between TS and USV.
Jmse 10 01047 g006
Figure 7. The process of collision avoidance in scenario 1.
Figure 7. The process of collision avoidance in scenario 1.
Jmse 10 01047 g007
Figure 8. The distance between ship domain of TS and USV.
Figure 8. The distance between ship domain of TS and USV.
Jmse 10 01047 g008
Figure 9. The collision risk between TS and USV.
Figure 9. The collision risk between TS and USV.
Jmse 10 01047 g009
Figure 10. The process of collision avoidance in scenario 2.
Figure 10. The process of collision avoidance in scenario 2.
Jmse 10 01047 g010
Figure 11. The distance between ship domain of TS and USV.
Figure 11. The distance between ship domain of TS and USV.
Jmse 10 01047 g011
Figure 12. The collision risk between TS and USV.
Figure 12. The collision risk between TS and USV.
Jmse 10 01047 g012
Figure 13. The process of collision avoidance in scenario 3.
Figure 13. The process of collision avoidance in scenario 3.
Jmse 10 01047 g013
Figure 14. The distance between ship domain of TS and USV.
Figure 14. The distance between ship domain of TS and USV.
Jmse 10 01047 g014
Figure 15. The collision risk between TS and USV.
Figure 15. The collision risk between TS and USV.
Jmse 10 01047 g015
Figure 16. The process of collision avoidance in scenario 4.
Figure 16. The process of collision avoidance in scenario 4.
Jmse 10 01047 g016
Figure 17. The distance between ship domain of TS and USV.
Figure 17. The distance between ship domain of TS and USV.
Jmse 10 01047 g017
Figure 18. Course of USV. (a) Course of USV based on the proposed decision method. (b) Course of USV based on the VO algorithm.
Figure 18. Course of USV. (a) Course of USV based on the proposed decision method. (b) Course of USV based on the VO algorithm.
Jmse 10 01047 g018
Figure 19. Ships’ navigation paths. (a) Navigation paths based on the proposed decision method and (b) navigation paths based on the VO algorithm.
Figure 19. Ships’ navigation paths. (a) Navigation paths based on the proposed decision method and (b) navigation paths based on the VO algorithm.
Jmse 10 01047 g019
Figure 20. Course of USV. (a) Course of USV based on the proposed decision method. (b) Course of USV based on the VO algorithm.
Figure 20. Course of USV. (a) Course of USV based on the proposed decision method. (b) Course of USV based on the VO algorithm.
Jmse 10 01047 g020
Figure 21. Ships’ navigation paths. (a) Navigation paths based on the proposed decision method and (b) navigation paths based on the VO algorithm.
Figure 21. Ships’ navigation paths. (a) Navigation paths based on the proposed decision method and (b) navigation paths based on the VO algorithm.
Jmse 10 01047 g021
Figure 22. Course of USV. (a) Course of USV based on the proposed decision method. (b) Course of USV based on the VO algorithm.
Figure 22. Course of USV. (a) Course of USV based on the proposed decision method. (b) Course of USV based on the VO algorithm.
Jmse 10 01047 g022
Figure 23. Ships’ navigation paths. (a) Navigation paths based on the proposed decision method. (b) Navigation paths based on the VO algorithm.
Figure 23. Ships’ navigation paths. (a) Navigation paths based on the proposed decision method. (b) Navigation paths based on the VO algorithm.
Jmse 10 01047 g023
Figure 24. Course of USV. (a) Course of USV based on the proposed decision method. (b) Course of USV based on the VO algorithm.
Figure 24. Course of USV. (a) Course of USV based on the proposed decision method. (b) Course of USV based on the VO algorithm.
Jmse 10 01047 g024
Figure 25. Ships’ navigation paths. (a) Navigation paths based on the proposed decision method. (b) Navigation paths based on the VO algorithm.
Figure 25. Ships’ navigation paths. (a) Navigation paths based on the proposed decision method. (b) Navigation paths based on the VO algorithm.
Jmse 10 01047 g025
Table 1. Table used to explain the abbreviations in Figure 3.
Table 1. Table used to explain the abbreviations in Figure 3.
AbbreviationsDescription
HOHead-on encounter
OTOvertaking or overtaken
CRCrossing encounter
SFSafe encounter
Table 2. Table used to determine the encounter area.
Table 2. Table used to determine the encounter area.
PartP1P2P3P4P5P6
Range α b = [ 0 , π / 8 ) [ 15 π / 8 , 2 π ) α b = [ π / 8 , π / 2 ) α b = [ π / 2 , 5 π / 8 ) α b = [ 5 π / 8 , 11 π / 8 ) α b = [ 11 π / 8 , 3 π / 2 ) α b = [ 3 π / 2 , 15 π / 8 )
Table 3. Table used to determine the encounter type.
Table 3. Table used to determine the encounter type.
Head-OnOvertakingOvertakenCrossing (Give Way)Crossing (Stand On)
P1 α h = [ 7 π / 8 , 9 π / 8 ) α h = [ 0 , 3 π / 8 ) [ 13 π / 8 , 2 π ) - α h = [ 9 π / 8 , 13 π / 8 ) α h = [ 3 π / 8 , 7 π / 8 )
P2- α h = [ 13 π / 8 , 2 π ) - α h = [ 9 π / 8 , 13 π / 8 ) -
P3--- α h     ( 3 π / 2 , 2 π ) -
P4-- α h = [ 0 , 3 π / 8 ] [ 13 π / 8 , 2 π ) --
P5---- α h = ( 0 , π / 2 )
P6- α h = [ 0 , 3 π / 8 ) -- α h = [ 3 π / 8 , 7 π / 8 )
Table 4. Basic information of each ship in scenario 1.
Table 4. Basic information of each ship in scenario 1.
InformationShip Length (m)Velocity (kn)Course (Rad)Initial Position
USV1020.4 π / 4 (5,5)
TS16012 π / 4 (13,13)
TS210012 π / 4 (10,10)
TS31008.4 3 π / 4 (5,13)
Table 5. Basic information of each ship in scenario 2.
Table 5. Basic information of each ship in scenario 2.
InformationShip Length (m)Velocity (kn)Course (Rad)Initial Position
USV1020.4 π / 4 (5,5)
TS11008.4 π / 4 (10,10)
TS22008.4 3 π / 4 (4,9)
TS3608.4 7 π / 4 (12,6)
Table 6. Basic information of each ship in scenario 3.
Table 6. Basic information of each ship in scenario 3.
InformationShip Length (m)Velocity (kn)Course (Rad)Initial Position
USV1015 π / 4 (10,10)
TS110015 5 π / 4 (18,16)
TS22008.4 7 π / 4 (20,12)
TS36015 3 π / 4 (10,16)
Table 7. Basic information of each ship in scenario 4.
Table 7. Basic information of each ship in scenario 4.
InformationShip Length (m)Velocity (kn)Course (Rad)Initial Position
USV1015 π / 4 (5,5)
TS110015 5 π / 4 (15,15)
TS22008.4 3 π / 4 (0,20)
TS3608.4 5 π / 4 (17,12)
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Li, Y.; Zhang, H. Collision Avoidance Decision Method for Unmanned Surface Vehicle Based on an Improved Velocity Obstacle Algorithm. J. Mar. Sci. Eng. 2022, 10, 1047. https://doi.org/10.3390/jmse10081047

AMA Style

Li Y, Zhang H. Collision Avoidance Decision Method for Unmanned Surface Vehicle Based on an Improved Velocity Obstacle Algorithm. Journal of Marine Science and Engineering. 2022; 10(8):1047. https://doi.org/10.3390/jmse10081047

Chicago/Turabian Style

Li, Yun, and Haiyu Zhang. 2022. "Collision Avoidance Decision Method for Unmanned Surface Vehicle Based on an Improved Velocity Obstacle Algorithm" Journal of Marine Science and Engineering 10, no. 8: 1047. https://doi.org/10.3390/jmse10081047

APA Style

Li, Y., & Zhang, H. (2022). Collision Avoidance Decision Method for Unmanned Surface Vehicle Based on an Improved Velocity Obstacle Algorithm. Journal of Marine Science and Engineering, 10(8), 1047. https://doi.org/10.3390/jmse10081047

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop