{'fraction_non_alphanumeric': 0.03634318861167836, 'fraction_numerical': 0.02906271271715647, 'mean_word_length': 4.251787379546161, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 1, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 3, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
DCA-Based Collision Avoidance Path Planning for Marine Vehicles in Presence of the Multi-Ship Encounter Situation

: The problem of ship collision avoidance path planning is one of the key problems in the ship motion control ﬁeld. Aiming at the high computational time problem of path planning in multi-ship encounter situations and the impact of the target ship’s action changes on path planning, this paper proposes a dynamic path-planning method based on dynamic cluster analysis (DCA), which is used to dynamically cluster target ships with similar attributes into a group ship, reducing the number of calculated targets and improving the efﬁciency of path planning. Taking into full consideration the action requirements of the International Regulations for Preventing Collisions at Sea (COLREGs), the course alteration action matrix (CAAM) for collision avoidance is established to limit the space of candidate solutions. On the basis of the rapid optimization capability of the deterministic optimization algorithm (DOA), a dynamic monitoring mechanism is introduced to establish a multi-ship encounter intelligent collision avoidance decision-making model that meets the needs of real-time collision avoidance. The simulation results showed that the method can obtain a dynamic collision avoidance path that is safe and feasible.


Introduction
Multi-ship encounter collision avoidance path planning is a hot research topic in the field of ship motion control. Many methods have been used to solve this problem. As early as the 1980s and 1990s, a knowledge-based system was used for multi-ship encounter collision avoidance path planning [1,2]. The problems of decision-making blind spots and low decision-making efficiency are affected by the collision avoidance knowledge base and reasoning mechanism.
Analytical geometry methods are also used for collision avoidance path optimization. In [3], a cooperative path planning algorithm was proposed, and the concept of ship priority was used in the algorithm. However, only three typical encounter situations (the overtaking, head-on, and crossing situations) were considered, and Rule 18 and 19 of the COLREGs were not considered. For the multi-ship encounter situation, the uncertainty of the target ship's action makes this cooperative collision avoidance difficult to achieve in the practice of ship collision avoidance. In [4], a deterministic collision avoidance path optimization algorithm TBA (Trajectory Base Algorithm) was proposed, which effectively shortened the calculation time but did not consider the action changes of the target ship. The CCDWA (COLREG-compliant dynamic window approach) was used to solve the collision avoidance problem in ref. [5]. However, this method only considers three typical encounter situations between the two ships and does not consider the changes in the action of the target ship.
Control theory methods are also used for collision avoidance path optimization [6][7][8]. In [9], a concept of a ship collision avoidance system based on model predictive control was proposed. This algorithm considers the action changes of the target ship and the constraints 2 of 17 of the COLREGs. With an increase in the number of target ships, the computational complexity of the algorithm increases, which affects the decision-making time. A combined nonlinear model predictive control (NMPC) method was used for trajectory tracking and collision avoidance [10]. However, this approach only considers three typical encounter situations and does not take into account the collision-avoidance action requirements of the COLREGs.
Fuzzy logic methods are used for collision avoidance path optimization. Aiming at the problem of collision avoidance in complex multi-ship encounter situations, ref. [11] proposed a Fuzzy-Bayesian ship intelligent collision avoidance decision-making model to achieve continuous collision avoidance actions. In addition, this method was upgraded in ref. [12], but the action changes of the target ship were not considered. In [13][14][15], Fuzzy theory was employed to infer the collision risk index for collision avoidance, but Rules 18 and 19 of the COLREGs were not considered.
Artificial Potential Field (APF) has been used for collision avoidance path optimization in some studies [16][17][18]; the principle is to guide the target to avoid obstacles through the action rules of Virtual Field Force (VFF). Ref. [19] proposed a multi-vessel cooperative path planning method based on APF, which makes collision avoidance decisions according to the priority of target vessels. Additionally, the uncertainty of the action of the target ship makes it difficult to realize the coordinated path planning scheme. Ref. [20] proposed a COLREGs-constrained real-time path-planning method for autonomous ships using modified artificial potential fields; this method has high decision-making efficiency, but it only considers three typical encounter situations.
Evolutionary algorithms are also used for multi-ship encounter collision avoidance path optimization. In [21], the decision to avoid the four target ships took about 900 s. A multivessel path planning method based on an evolutionary algorithm was proposed [22,23] called ESoSST (Evolutionary Sets of Safe Ship Trajectories). Subsequently, the method was used in TSS (Traffic Separation Scheme) waters [24], as well as in waters with restricted visibility [25]. ESoSST is a cooperative path planning method, and the computational time is about 10-30 s.
The swarm intelligence optimization algorithm has been used for collision avoidance path optimization. A method of ship collision avoidance path planning based on the ant colony optimization (ACO) algorithm has been proposed [26,27], which assumes that target ships maintain their course and speed. The simulation results show that the decisionmaking time to avoid four target ships and eight target ships can reach up to 29 s and 57 s, respectively. In [28], particle swarm optimization (PSO) was used for the path planning problem of unmanned surface vehicles with currents effects, but the targets were static.
The differential game theory method is also used for collision avoidance path optimization [29,30]. The method takes into account the action changes of the target ship. However, the drawback is that the high computational complexity in multi-ship encounters reduces the decision-making efficiency.
Distributed decision-making methods are used for collision avoidance path optimization [31,32]. These methods rely on information exchange and negotiation between ship agents to make collision avoidance decisions, but they are not applicable to non-agent ships.
The velocity obstacle (VO) method, based on the relative motion principle in physics, is also used for ship collision avoidance path optimization. In [33], VO was used for avoiding dynamic targets, but only three typical encounter situations were considered. Ref. [34] used VO to avoid target ships with predictable trajectories, but the constraints of the COLREGs were not considered.
With the rapid development of artificial intelligence technology, there has been related research on the application of machine learning in the field of ship collision avoidance [35,36]. In [37], a concise deep reinforcement learning obstacle avoidance method was presented, but the target ships were static. Ref. [38] proposed an automatic collision avoidance of multiple ships method based on deep Q-learning, but only three typical encounter situations were considered. In [39], deep reinforcement learning was used for AUV (autonomous underwater vehicle) obstacle avoidance planning, but the constraints of the COLREGs were not considered. Moreover, when machine learning deals with complex problems, it is often inefficient because of the high amount of computation.
In view of the above literature review, this paper presents a DCA-based collision avoidance path planning method for marine vehicles in presence of a multi-ship encounter situation. The proposed method fully takes into account the constraints of the COLREGs and the changes in the action of the target. The purpose of the method is to give an optimal collision avoidance path quickly and dynamically. The rest of the paper is organized as follows. In Section 2, a simplification of an encounter situation based on DCA is presented. The multi-ship encounter intelligent collision avoidance decision-making method is given in Section 3. Simulation results are shown in Section 4, and conclusions are given in Section 5.

Simplification of Encounter Situation Based on DCA
In practice at sea, in fishing areas, in TSS waters, or in habitual waterways, for a group of ships with a similar course, speed and position are often encountered (e.g., a fleet of fishing vessels). In the process of collision avoidance, the officer on watch (OOW) usually considers such a group of ships as one target. On the basis of this collision avoidance logic, it is possible to simplify the multi-ship encounter situation. In this paper, a dynamic cluster analysis (DCA) method is used to classify the target ships with similar attributes as group ships.

Cluster Analysis Method
In this paper, the Hierarchical Clustering Method (HCM) is used. The method divides the n samples into n classes, and then, the two classes with the closest attributes are merged into a new class by calculating the distance D G . After multiple clustering, all samples are merged into one class, and then a dendrogram is drawn. Finally, the number of classes and the sample composition of classes are determined.

Calculation of Distance between Samples
Suppose there are n samples X i (i = 1, 2, . . . , n), and each sample has m attributes; x ij (j = 1, 2, . . . , m) represents the j-th attribute value of the i-th sample. d ij is the Euclidean distance between X i and X j .
x j and s j represent the sample mean and standard deviation of the j-th attribute value, respectively. The calculation formula is as follows.
x ij represents the normalized data of each attribute value.
The standardized Euclidean distance d ij can be obtained by calculation Formula (5).

Calculation of the Distance between Classes
In this paper, the Group Average Method was used to calculate the distance between classes. There are two classes, G p1 and G p2 , containing q p1 and q p2 samples, respectively.
The distance D G between two classes is calculated as follows.

Group Ship Model
Suppose the target ship's course is C ts , the speed is V ts , the distance to own ship (OS) is D ts , and the true bearing is TB ts . Take each target ship (TS) as the sample of cluster analysis, choose C ts , V ts , D ts , and TB ts as characteristic indices, and multiple target ships with a close course, speed, and position are classified into one group ship (GS).
The constraints of the cluster analysis are as follows. If the course difference of the target ships is more than E c degrees, the speed difference of the target ships is more than E v knots, or the distance between the target ships is greater than 2SD (safe distance), these three cases cannot be classified as one class. E c , E v , and SD are not fixed and can be determined according to specific encounter situations.
N target ships (TS 1 -TS n ) are classified into K (K ≤ N) group ships (GS 1 -GS k ) on the basis of the HCM. GS p (p = 1, 2, . . . k) contains q p (1 ≤ q p ≤ N, q 1 + . . . + q 2 = N) target ships. The domain of GS p is a circle, the central position is (x gsp , y gsp ), the radius is R gsp , the course is C gsp , the speed is V gsp , DCPA gsp is the distance to the closest point of approach (DCPA) from the center of GS p to OS, and the passing distance to OS is SD gsp . The calculation formula of each variable of GS p is as follows.
where x tsqp is the X coordinate value of each target ship in GS p ; y tsqp is the Y coordinate value of each target ship in GS p ; C tsqp is the course of each target ship in GS p ; V tsqp is the speed of each target ship in GS p .
Two samples of the group ship are shown in Figure 1.

Dynamic Cluster Analysis
The cluster analysis method was introduced for the collision avoidance problem [40], but it does not consider the action changes of the target ship. Actually, when the action of the target ship changes, it may be necessary to re-cluster the target ships to simplify the

Dynamic Cluster Analysis
The cluster analysis method was introduced for the collision avoidance problem [40], but it does not consider the action changes of the target ship. Actually, when the action of the target ship changes, it may be necessary to re-cluster the target ships to simplify the encounter situation. In order to realize the dynamic cluster analysis of the target ships, it is necessary to detect the action changes of the target ship, and the detection period is set as T c . When it is detected that the course difference between the target ships exceeds the threshold E c or the speed difference exceeds the threshold E v , the clustering analysis is performed again. A flow chart of the DCA of the target ships is shown in Figure 2.

Dynamic Cluster Analysis
The cluster analysis method was introduced for the collision avoidance problem [40], but it does not consider the action changes of the target ship. Actually, when the action of the target ship changes, it may be necessary to re-cluster the target ships to simplify the encounter situation. In order to realize the dynamic cluster analysis of the target ships, it is necessary to detect the action changes of the target ship, and the detection period is set as Tc. When it is detected that the course difference between the target ships exceeds the threshold c E or the speed difference exceeds the threshold v E , the clustering analysis is performed again. A flow chart of the DCA of the target ships is shown in Figure 2.

Course Alteration Action Matrix
In order to determine the course-altering direction of the collision avoidance path, this paper establishes the course alteration action matrix (CAAM) model AM.
where the rows represent the relative bearing (RB) of the target ship, the columns represent the type of the target ship, a mn is action value, and the range of action values is (−1, 0, 1). A value of −1 indicates that OS should change course to the port side, 0 means that either a change to the port side or starboard is possible, and 1 means that OS should change course to starboard. When encountering multiple ships, according to the RB of each target ship and the ship type, the action vector AT of the ship's course alteration to avoid collision is constructed.
The priority of the action value is from high to low: 1, −1, 0. If a value of 1 appears in AT, it is limited to altering the course to starboard. Then, whether there is a −1 value is judged, and if so, it is limited to altering the course to the port side. If the values in AT are all 0, it means that OS can change course to the port side or to starboard.

CAAM in Sight of One Another
In sight of one another, considering the constraints of the COLREGs (Rules 13, 14, 15, 17, and 18) and good seamanship, the encounter situation is divided as shown in Figure 3a. 0, 1). A value of −1 indicates that OS should change course to the port side, 0 means that either a change to the port side or starboard is possible, and 1 means that OS should change course to starboard.
When encountering multiple ships, according to the RB of each target ship and the ship type, the action vector AT of the ship's course alteration to avoid collision is constructed.
The priority of the action value is from high to low: 1, −1, 0. If a value of 1 appears in AT, it is limited to altering the course to starboard. Then, whether there is a −1 value is judged, and if so, it is limited to altering the course to the port side. If the values in AT are all 0, it means that OS can change course to the port side or to starboard.

CAAM in Sight of One Another
In sight of one another, considering the constraints of the COLREGs (Rules 13, 14, 15, 17, and 18) and good seamanship, the encounter situation is divided as shown in Figure  3a. OS is a regular power-driven vessel (PDV). For a vessel being overtaken (A), the action value is 0. For an overtaken vessel (B), the action value is −1. For a head-on vessel (C), the action value is 1. For a crossing vessel from starboard (D), the action value is 1. For a crossing vessel from the port side (E), the action value is 1. For the other types of vessels in Rule 18, the action value is 0. For an abeam vessel (F), OS should avoid altering course toward it. Based on these, the CAAM in sight of one another is shown in Table 1. OS is a regular power-driven vessel (PDV). For a vessel being overtaken (A), the action value is 0. For an overtaken vessel (B), the action value is −1. For a head-on vessel (C), the action value is 1. For a crossing vessel from starboard (D), the action value is 1. For a crossing vessel from the port side (E), the action value is 1. For the other types of vessels in Rule 18, the action value is 0. For an abeam vessel (F), OS should avoid altering course toward it. Based on these, the CAAM in sight of one another is shown in Table 1.
NUC is a vessel not under command, RAM is a vessel restricted in her ability to maneuver, VEF is a vessel engaged in fishing, SV is a sailing vessel, PDV1 is overtaken PDV, and PDV2 is not overtaken PDV.

CAAM Not in Sight of One Another
Not in sight of one another, considering constraints of the COLREGs (Rule 19) and good seamanship, the encounter situation is divided as shown in Figure 3b.
OS is a regular power-driven vessel (PDV). For a vessel being overtaken (A), the action value is 0. For vessels forward of the beam (B, C), the action value is 1. For a vessel abeam (D) or abaft the beam (E), OS should avoid altering course towards it. Based on these, the CAAM not in sight of one another is shown in Table 2.

Problem Description
At time t 0 , OS is at position (x 0 , y 0 ) with initial course C oi and speed V oi encountering N target ships (TS 1 -TS n ), and a risk of collision (ROC) exists. To pass these target ships at a safe distance (SD), OS intends to take action to avoid a collision at time t s taking steer course C o1 to sail D co1 n miles and steer course C o2 at time t r to sail D co2 n miles to the goal position (x e , y e ) and return to the initial course C oi at time t e . The values of t 0 , (x 0 , y 0 ), C oi , and V oi can be obtained from OS. The data for the target ship's C ts , V ts , D ts , and TB ts are available from radar (these data are assumed to be known in this paper). The value of t s and (x e , y e ) can be preset according to a specific encounter situation. The problem of collision avoidance path planning can be presented by an optimization problem, namely searching for the optimal (C o1 , t r , C o2 ) among the candidate solutions, which make OS pass target ships at a safe distance, and voyage losses are minimal under the constraints of COLREGs. Figure 4a shows the process of path planning for collision avoidance.

Determination of Candidate Solutions
The side to be steered can be determined on the basis of CAAM. A rectangular area on the side to be steered is defined, and the length (Lc) and width (Bc) of the area are determined according to the specific encounter situation. Candidate waypoints are determined at equal intervals along the length and width of the rectangular area. The value of the interval (Dwp) is determined according to own ship's length overall (LOA); the larger the LOA, the larger the interval, and vice versa. Each candidate waypoint corresponds to a (Co1, tr, Co2), which is a candidate solution for the collision avoidance path, as shown in Figure 4b.

Objective Function
In the algorithm, each group ship is used as the calculation target, and a global search is performed in the candidate solutions. The optimal collision avoidance path should satisfy the following conditions.

•
The SDgsp of each group ship is not to be less than SD • The course change is at least 30 degrees

Determination of Candidate Solutions
The side to be steered can be determined on the basis of CAAM. A rectangular area on the side to be steered is defined, and the length (L c ) and width (B c ) of the area are determined according to the specific encounter situation. Candidate waypoints are determined at equal intervals along the length and width of the rectangular area. The value of the interval (D wp ) is determined according to own ship's length overall (LOA); the larger the LOA, the larger the interval, and vice versa. Each candidate waypoint corresponds to a (C o1 , t r , C o2 ), which is a candidate solution for the collision avoidance path, as shown in Figure 4b.

Objective Function
In the algorithm, each group ship is used as the calculation target, and a global search is performed in the candidate solutions. The optimal collision avoidance path should satisfy the following conditions.

•
The SD gsp of each group ship is not to be less than SD • The course change is at least 30 degrees • The sum of D co1 and D co2 takes the minimum value

Steps of the Algorithm
Pseudocode for collision avoidance path planning on the basis of the deterministic optimization algorithm (DOA); see Algorithm 1.
Algorithm 1: Pseudocode for collision avoidance path planning on the basis of DOA.

Input:
C oi , V oi , C ts , V ts , D ts , TB ts , SD gsp Process: 1: Initialization: (x 0 , y 0 ), t 0 , t s , (x e , y e ), L c , B c 2: Calculate the sum of D co1 and D co2 3: If SD gsp >=SD && course change is at least 30 degrees 4: keep the candidate solution 5: Else 6: abandon the candidate solution 7: End if 8: Search for a solution in which the sum of D co1 and D co2 goes to the minima Output: C o1 , t r , C o2

Collision Avoidance Decision-Making Model
Aiming at the action changes of the target ship, this paper introduces a dynamic monitoring mechanism to realize dynamic collision avoidance path planning. When the action of the target ship leads to a new ROC, the collision avoidance decision needs to be updated, that is, the collision avoidance path of OS needs to be re-planned. If the action change of the target ship does not form a new ROC, the current collision avoidance path will be maintained.
The multi-vessel encounter intelligent collision avoidance decision-making model established in this paper includes three modules: the encounter situation simplification module, the ship collision avoidance decision-making module, and the dynamic monitoring and evaluation module. The model is shown in Figure 5.

Collision Avoidance Decision-Making Model
Aiming at the action changes of the target ship, this paper introduces a dynamic monitoring mechanism to realize dynamic collision avoidance path planning. When the action of the target ship leads to a new ROC, the collision avoidance decision needs to be updated, that is, the collision avoidance path of OS needs to be re-planned. If the action change of the target ship does not form a new ROC, the current collision avoidance path will be maintained.
The multi-vessel encounter intelligent collision avoidance decision-making model established in this paper includes three modules: the encounter situation simplification module, the ship collision avoidance decision-making module, and the dynamic monitoring and evaluation module. The model is shown in Figure 5.

Simulation and Analysis
To verify the validity of the decision-making model, two simulation cases were implemented using MATLAB software; one case is for in sight of one another, and the other is for not in sight of one another.

Simulation and Analysis
To verify the validity of the decision-making model, two simulation cases were implemented using MATLAB software; one case is for in sight of one another, and the other is for not in sight of one another.

Experimental Conditions and Explanations
The simulation tests were conducted on the basis of a computer with an Intel(R) Core (TM) i7-3770 3.4GHz processor, 4G RAM, and a 32-bit Windows 7 Professional system. The simulation results are presented in the form of data tables and ship trajectory graphs.
The following parameter values were used in the simulation: E c = 1 • , E v = 0.5 kn, T c = 5 s, SD = 1 nm, LOA = 116 m, L c = 4 nm, B c = 2 nm, and D wp = 0.2 nm. In the simulation cases, the initial data of OS and target ships were considered to be known, and the process of acquiring data from the radar is not considered in this paper.
In the simulation cases, DCPA and TCPA (time to the closest point of approach) were used to determine the ROC. When an ROC exists, all target ships with approximate TCPA values were considered to give the optimal collision avoidance path.

Initial Situation of the Encounter
In sight of one another, OS's course is 000, the initial speed is 13.2 kn, the initial position is (0,0), and the initial time is 0000. OS encounters 10 target ships, TS 1 -TS 10 ; TS 1 -TS 6 are fishing vessels propelled by machinery but not engaged in fishing. The data of the target ships at 0000 are known, as shown in Table 3. It can be determined that a ROC exists, and the TCPA values for each TS are approximate.

Simulation Process and Analysis
A cluster analysis was performed, and target ships (TS 1 -TS 10 ) were classified into three group ships (GS 1 -GS 3 ). The distribution of target ships and group ships at 0000 is shown in Figure 6.
According to the CAAM in sight of one another, OS should alter course to starboard. The candidate solution area is on OS's starboard. The action time t s is 0002, and the goal position is (0, 7). The optimal collision avoidance decision is to steer course 032 at 0002 (C 0002 = 032), 329.2 at 0019 (C 0019 = 329.2), and 000 at 0037 (C 0037 = 000).
At 0005, TS 5 and TS 6 change their course to 245, and their speed remains unchanged. The trajectories of each ship from 0000 to 0005 are shown in Figure 7a.

Simulation Process and Analysis
A cluster analysis was performed, and target ships (TS1-TS10) were classified into three group ships (GS1-GS3). The distribution of target ships and group ships at 0000 is shown in Figure 6. According to the CAAM in sight of one another, OS should alter course to starboard. The candidate solution area is on OS's starboard. The action time ts is 0002, and the goal position is (0, 7). The optimal collision avoidance decision is to steer course 032 at 0002 (C0002 = 032), 329.2 at 0019 (C0019 = 329.2), and 000 at 0037 (C0037 = 000).
At 0005, TS5 and TS6 change their course to 245, and their speed remains unchanged. The trajectories of each ship from 0000 to 0005 are shown in Figure 7a. The course changes of TS 5 and TS 6 lead to a new ROC, so OS should update the collision avoidance decision. The data of the target ships at 0005 are shown in Table 4. After the re-clustering analysis, the target ships (TS 1 -TS 10 ) were classified into four group ships (GS 1 -GS 4 ). The distribution of target ships and group ships at 0005 is shown in Figure 7b.
According to the CAAM in sight of one another, OS should alter course to starboard. The candidate solution area is on OS's starboard. The action time t s is 0007, and the goal position is (0, 7). The optimal collision avoidance decision is to steer course 068.9 at 0007 (C 0007 = 068.9), 333.5 at 0016 (C 0016 = 333.5), and 000 at 0041 (C 0041 = 000).
At 0010, TS 9 and TS 10 change their courses to 180, and their speed remains unchanged. The trajectories of each ship from 0000 to 0010 are shown in Figure 7c.
The course changes of TS 9 and TS 10 do not lead to a new ROC, so OS should maintain the current collision avoidance decision.
At 0018, TS 7 and TS 8 change their course to 065, and their speed remains unchanged. The trajectories of each ship from 0000 to 0018 are shown in Figure 7d.
The course changes of TS 7 and TS 8 lead to a new ROC, so OS should update the collision avoidance decision. The data of the target ships at 0018 are shown in Table 5.   After the re-clustering analysis, target ships (TS 1 -TS 10 ) were classified into four group ships (GS 1 -GS 4 ). The distribution of target ships and group ships at 0018 is shown in Figure 7e.
According to the CAAM in sight of one another, OS altering course to starboard or the port side is acceptable. To pass the stern of TS 7 and TS 8 , OS chooses to alter course to the port side, and the candidate solution area is on OS's port side. The action time t s is 0020, and the goal position is (0, 7). The optimal collision avoidance decision is to steer course 299.8 at 0020 (C 0020 = 299.8), 356.6 at 0030 (C 0030 = 356.6), and 000 at 0044 (C 0044 = 000).
From that point to time 0044, the actions of each TS remain unchanged. The trajectories of each ship from 0000 to 0044 are shown in Figure 7f.
During the period from 0000 to 0044, OS changes its course to C 0002 , C 0007 , C 0016 , C 0020 , and C 0030 successively. The DCPA values of target ships corresponding to different courses are shown in Table 6. As shown in the table, the absolute value of all DCPA is greater than the SD value, indicating that all target ships can pass OS at a safe distance. Not in sight of one another, OS's course is 000, the initial speed is 12.8 kn, the initial position is (0,0), and the initial time is 0000. OS encounters 10 target ships, TS 1 -TS 10 ; TS 1 -TS 5 are fishing vessels propelled by machinery but not engaged in fishing. The data of the target ships at 0000 are known, as shown in Table 7. It can be determined that an ROC exists, and the TCPA values for each TS are approximate.

. Simulation Process and Analysis
A cluster analysis was performed, and target ships (TS 1 -TS 10 ) were classified into three group ships (GS 1 -GS 3 ). The distribution of the target ships and group ships at 0000 is shown in Figure 8a.
According to the CAAM not in sight of one another, OS should alter course to starboard. The candidate solution area is on OS's starboard. The action time t s is 0002, and the goal position is (0, 7). The optimal collision avoidance decision is to steer course 048 at 0002 (C 0002 = 048), 337.3 at 0015 (C 0015 = 337. 3), and 000 at 0039 (C 0039 = 000).
At 0004, TS 1 and TS 2 change their course to 220, and their speed remains unchanged. The trajectories of each ship from 0000 to 0004 are shown in Figure 8b.
The course changes of TS 1 and TS 2 lead to a new ROC, so OS should update the collision avoidance decision. The data of the target ships at 0004 are shown in Table 8. After the re-clustering analysis, target ships (TS 1 -TS 10 ) are classified into four group ships (GS 1 -GS 4 ). The distribution of target ships and group ships at 0004 is shown in Figure 8c.
According to the CAAM not in sight of one another, OS should alter course to starboard. The candidate solution area is on OS's starboard. The action time t s is 0006, and the goal position is (0, 7). The optimal collision avoidance decision is to steer course 083.6 at 0006 (C 0006 = 083.6), 338.0 at 0014 (C 0014 = 338.0), and 000 at 0043 (C 0043 = 000).
At 0016, TS 6 and TS 7 change their course to 121, their speed increases to 7.8 kn, and they are not engaged in fishing; TS 8 and TS 9 change their courses to 186, and their speeds remain unchanged. The trajectories of each ship from 0000 to 0016 are shown in Figure 8d.
The course changes of TS 8 and TS 9 do not lead to a new ROC, but the course and speed changes of TS 6 and TS 7 lead to a new ROC, so OS should update the collision avoidance decision. The data of the target ships at 0016 are shown in Table 9.   After the re-clustering analysis, the target ships TS 1 -TS 10 were classified into five group ships (GS 1 -GS 5 ). The distribution of target ships and group ships at 0016 is shown in Figure 8e.
According to CAAM not in sight of one another, OS should alter course to starboard. The candidate solution area is on OS's starboard. The action time t s is 0018, and the goal position is (0, 7). The optimal collision avoidance decision is to steer course 010 at 0018 (C 0018 = 010), 323.4 at 0027 (C 0027 = 323.4), and 000 at 0045 (C 0045 = 000).
From then to time 0045, the actions of each TS remained unchanged. The trajectories of each ship from 0000 to 0045 are shown in Figure 8f.
During the period from 0000 to 0045, OS changed its course to C 0002 , C 0006 , C 0014 , C 0018 , and C 0027 successively. The DCPA values of the target ships corresponding to different courses are shown in Table 10. As shown in the table, the absolute value of all DCPA is greater than the SD value, indicating that all target ships can pass OS at a safe distance.

Conclusions
In this paper, a method to simplify the encounter situation based on dynamic cluster analysis was proposed to improve the efficiency of collision avoidance path planning. Target ships with similar properties were dynamically classified into one group ship, the model of the group ship was given, and the number of computational targets was effectively reduced. Fully considering the constraints of the COLREGs, a course alteration action matrix model (CAAM) was established to determine the side of course changing, which narrows the range of candidate solutions and helps improve the efficiency of the decision-making. In order to realize dynamic collision avoidance path planning, a dynamic monitoring mechanism was introduced, and a multi-ship encounter intelligent collision avoidance decision-making model was established. The simulation results show that the dynamic path planning method in this paper is safe and feasible. However, in the simulation tests, the ship's maneuverability was not considered; this will be taken into account in subsequent studies.