A traversal path planning and collision avoidance method for unmanned boats based on satellite maps

By generating traversal paths for unmanned surface vessels (USVs) using satellite map-based image processing and the minimum spanning tree algorithm, and combining this with obstacle control functions to achieve dynamic obstacle avoidance, the problems of task area selection and dynamic obstacle avoidance in USV path planning are solved, thus optimizing path planning and collision avoidance control.

CN115494842BActive Publication Date: 2024-11-15DALIAN MARITIME UNIVERSITY
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202211131685.4
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-09-15
Publication Date
2024-11-15
Estimated Expiration
2042-09-15

AI Technical Summary

Technical Problem

Existing unmanned surface vessel (USV) path planning algorithms cannot autonomously select mission areas, cannot effectively avoid all obstacles, and have failed to effectively solve the problem of dynamic obstacles.

Method used

The path planning is performed using satellite map-based image processing and minimum spanning tree algorithm, and collision avoidance control is performed by combining obstacle control function. The OpenCV image processing library is used for image rotation and rasterization. The minimum spanning tree is used to generate the traversal path of the unmanned surface vessel, and speed control is used to achieve collision avoidance of dynamic obstacles.

Benefits of technology

It enables users to independently select the task area for path planning, optimizes the path planning algorithm, reduces the number of turns, lowers energy consumption, and achieves effective collision avoidance of dynamic obstacles through speed control.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN115494842B_ABST
    Figure CN115494842B_ABST
Patent Text Reader

Abstract

The present invention discloses a traversal path planning and collision avoidance method for an unmanned boat based on a satellite map, comprising the following steps: processing satellite map images; establishing a grid map and expanding obstacles; optimizing the design of the unmanned boat traversal path planning algorithm based on a minimum spanning tree; and performing collision avoidance design on the unmanned boat based on an obstacle control function algorithm. Users of the present invention can use online satellite maps to manually select different mission areas to perform traversal path planning operations for unmanned boats for different mission scenarios. The present invention optimizes the traversal path planning algorithm, improves the turning rate of the unmanned boat, and adopts a traversal path with fewer turns. By reducing the number of turns of the unmanned boat, on the one hand, the time to complete the task is reduced, and on the other hand, the energy consumption of the unmanned boat is reduced. The present invention adopts a speed-based obstacle control function method, which can enable the unmanned boat to avoid collisions with dynamic obstacles when performing a task by only changing the speed of the unmanned boat.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of shipbuilding and marine engineering, and in particular to a satellite map-based unmanned boat traversal path planning and collision avoidance method. Background Art

[0002] The exploration, development and utilization of the ocean are the current development priorities of various countries. Unmanned boats are important tools for people to explore and develop the ocean because of their miniaturization, light weight and autonomy. As a form of unmanned boat path planning, the traversal path planning of unmanned boats has great application value in hydrological monitoring, sea search and rescue, regional patrol and other fields. In the traversal path planning of unmanned boats, there are map processing problems, so it is necessary to perform image processing on the mission area based on satellite maps; there are path optimization problems in traversal path planning, so it is necessary to optimize the traversal path planning method; there are dynamic obstacles in the path tracking and guidance process of unmanned boats, so it is necessary to avoid collisions with dynamic obstacles. Therefore, it is of great significance to study the regional traversal path planning and collision avoidance problems of unmanned boats based on satellite maps.

[0003] In terms of unmanned boat traversal path planning, domestic and foreign scholars have conducted a lot of relevant research and proposed a variety of control methods, among which the methods of plowing round-trip planning, rotation path planning based on the shape of the Chinese character, and traversal path planning based on the spanning tree are the most widely used. From the perspective of traversal path planning algorithm design, the existing unmanned boat traversal path planning and collision avoidance methods still have the following shortcomings: First, most of the existing unmanned boat traversal path planning algorithms are based on given map information or given mission areas, and cannot select mission areas according to user needs, so such methods are not widely used in practice. Second, most of the existing unmanned boat traversal path planning algorithms are based on simple plowing round-trip planning, which cannot effectively avoid all obstacles in the scene. In practical applications, it is necessary to plan a path that completely avoids obstacles in advance, so it is necessary to study the regional traversal path planning and collision avoidance of unmanned boats. Third, the existing unmanned boat path tracking and guidance algorithm does not solve the problem of dynamic obstacles very well. The collision avoidance problem of dynamic obstacles is not considered in the unmanned boat tracking and guidance process, which is also an important research direction for unmanned boat regional traversal. Summary of the invention

[0004] In order to solve the deficiencies in the prior art, the present invention proposes an unmanned boat traversal path planning and collision avoidance method based on satellite maps, which can complete the regional traversal path planning and path tracking and collision avoidance of the unmanned boat based on the mission area selected by the user.

[0005] In order to achieve the above-mentioned purpose, the technical route of the present invention is as follows: firstly, a satellite map processing method based on image recognition is proposed, and the rotation segmentation, binarization processing, rasterization processing, etc. of the satellite map image are completed based on the opencv image processing library of the python platform; for the unmanned boat area traversal path planning task, a path planning method based on the minimum spanning tree is adopted to complete the area traversal path planning of the unmanned boat; for the path tracking and collision avoidance problem of the unmanned boat, a speed-based control obstacle function algorithm is adopted, and the position information, heading information and speed information of the unmanned boat and the obstacle are used to complete the collision avoidance control of the dynamic obstacle by controlling the speed of the unmanned boat; a hardware-in-the-loop simulation experiment of the traversal path planning and collision avoidance control of the unmanned boat is carried out, and a hardware-in-the-loop simulation platform built by combining the Raspberry Pi and the flight control source code is adopted to complete the path planning and path tracking and collision avoidance tasks of the unmanned boat for a mission area.

[0006] The technical solution of the present invention is as follows: A method for traversal path planning and collision avoidance of an unmanned boat based on a satellite map, comprising the following steps:

[0007] A. Process images and create raster maps

[0008] A1. Processing satellite map images

[0009] First, the required mission area image is captured from the online satellite map, and the rotation and cropping functions in the OpenCV image processing database are used to maximize the presentation of the mission area.

[0010] Secondly, the color satellite image is gray-scaled using the image enhancement and image segmentation algorithms, and the threshold function is used to perform global threshold processing on the image, converting the color image into a single-channel 8-bit black-and-white type image to sharpen the outline of the obstacle area in the mission area image.

[0011] A2. Create a grid map and expand obstacles

[0012] First, according to the limitation of the iterative operation of the path planning algorithm, the image is scaled proportionally to obtain a binary image with a pixel size of m*n. m is the height of the grid map, n is the width of the grid map, and each grid has a square grid with a side length of d. The image obtained at this time has an irregular boundary, so the image obstacles are expanded before being converted into a grid map. Since the planning algorithm is designed to perform a spanning tree algorithm on a 2*2 grid, the obstacles in the image are expanded according to the 2*2 grid, that is, starting from the origin, there are obstacles in the four adjacent grids, so this 2*2 grid is designed as an obstacle grid, and the obstacle grid is expanded to obtain a binary image of obstacle expansion. The pixel points of the image are taken out, and the obstacle grid is assigned 0 and the free grid is assigned 1 using the rasterization algorithm. All pixel points are traversed to obtain a grid map for the execution of the path planning algorithm. The area in the grid map where the unmanned boat cannot navigate is regarded as the obstacle area, and all grid coordinates of the obstacle area are set as Point obs :

[0013] Point obs ={p o1 ,p o2 ,…,p og}, g = 1, 2…i

[0014] Among them, p o1 =[x obs1 ,y obs1 ] T 、p o2 =[x obs2 ,y obs2 ] T ,…,p og =[x obsg ,y obsg ] T are the 1st, 2nd, …, gth obstacle grids respectively, [x obs1 ,y obs1 ] T ,[x obs2 ,y obs2 ] T ,[x obsg ,y obsg ] T are the horizontal and vertical coordinate values ​​of the 1st, 2nd, …, gth obstacle grids respectively, and i is the number of obstacle grids.

[0015] The free grid coordinates for the unmanned boat to navigate are collected as Point free :

[0016] Point free ={p f1 ,p f,…,p fk}, k = 1, 2, ..., j

[0017] Among them, p o1 =[x free1 ,y free1 ] T 、p o2 =[x free2 ,y free2 ] T ,…,p ok =[x freek ,y freek ] T are the first, second, ..., kth free grids, [x free1 ,y free1 ] T ,[x free2 ,y free2 ] T ,…,[x freek ,y freek ] T are the horizontal and vertical coordinate values ​​of the 1st, 2nd, …, kth free grids respectively, and j is the number of free grids.

[0018] B. Optimization design of unmanned boat traversal path planning algorithm based on minimum spanning tree

[0019] After the grid map is established, a traversal path for the unmanned boat is planned in the mission area. For path generation, the minimum spanning tree algorithm is used. Specifically, a minimum spanning tree is constructed for the mission area, and then a path is generated to bypass it. The minimum spanning tree algorithm generates a traversal path, and the planned generated path is in a rectangular area with length and width of m*n, with l as the minimum distance for the unmanned boat to move. And make the following assumptions:

[0020] First, set the initial position of the unmanned boat to p start :

[0021] p start =[x start ,y start ] T ,[x start ,y start ] T ∈Point free

[0022] Among them, [x start ,y start ] T are the horizontal and vertical coordinates of the initial position.

[0023] Secondly, the unmanned boat is only allowed to move in the four directions of up, down, left, and right of the grid where the unmanned boat is located. Set the set of path points of the unmanned boat as Point ship , set the last position of the unmanned boat to p last :

[0024] p last =[x last ,y last ] T ,[x last ,y last ] T ∈Point free

[0025] Among them, [x last ,y last ] T is the horizontal and vertical coordinates of the previous position of the unmanned boat, and the current position of the unmanned boat is set to p now :

[0026] p now =[x now ,y now ] T ,[x now ,y now ] T ∈Point free

[0027] Among them, [x now ,y now ] T is the horizontal and vertical coordinates of the current position of the unmanned boat, and the initial settings are as follows:

[0028] p now =p start

[0029] p last =p now

[0030] The unmanned boat traverses the free grid area according to the number of free grids j, and sets the number of loops count = 0:

[0031] When count <j:

[0032] Each cycle selects in the counterclockwise direction, that is, searching in the right, up, left, and down directions. The operation refers to adding elements to the collection.

[0033] First, if the grid on the right side of the unmanned boat is a free grid, the unmanned boat moves to the grid on the right side:

[0034] If [x now +l,ynow ] T ∈Point free The conditions are met:

[0035] [x now ,y now ] T =[x now +l,y now ] T

[0036]

[0037] If the grid on the right side of the UAV is an obstacle grid and the grid on the upper side of the UAV is a free grid, the UAV moves to the upper grid:

[0038] If [x now ,y now +l] T ∈Point free The conditions are met:

[0039] [x now ,y now ] T =[x now ,y now +l] T

[0040]

[0041] If the grids on the right and top of the UAV are obstacle grids, and the grid on the left of the UAV is a free grid, the UAV moves to the grid on the left:

[0042] If [x now -l,y now ] T ∈Point free The conditions are met:

[0043] [x now ,y now ] T =[x now -l,y now ] T

[0044]

[0045] If the grids on the right, top, and left of the UAV are obstacle grids, and the grid on the bottom of the UAV is a free grid, the UAV moves to the bottom grid:

[0046] If [x now ,y now -l]T ∈Point free The condition holds:

[0047] [x now ,y now T = [x now ,y now - l] T

[0048]

[0049] At this time, it has moved to the next grid, so the loop count = count + 1. If count < j, continue the loop; if count = j, end the loop.

[0050] Finally, based on the spanning tree generated by the above algorithm, starting from p start in the counter - clockwise direction around Point ship a closed - loop path is generated for the path points.

[0051] C. Collision avoidance design for the unmanned surface vehicle based on the control barrier function algorithm

[0052] The unmanned surface vehicle described is an under - actuated unmanned surface vehicle, and the kinematic model of the under - actuated unmanned surface vehicle is as follows:

[0053]

[0054] Among them, x, y, and ψ respectively represent the positions on the x - axis and y - axis of the under - actuated unmanned surface vehicle in the earth coordinate system and the yaw angle; u, v, and r respectively represent the surge speed, sway speed, and yaw angular velocity of the under - actuated unmanned surface vehicle in the body coordinate system; set p = [x, y] T as the position coordinates of the unmanned surface vehicle.

[0055] Set the kinematic model of the dynamic obstacle as:

[0056]

[0057] Among them, x d , y d , ψ d respectively represent the positions on the x - axis and y - axis of the dynamic obstacle in the earth coordinate system and the yaw angle; u d , v d , r d respectively represent the surge speed, sway speed, and yaw angular velocity of the dynamic obstacle in the body coordinate system; set p d = [x d , y d T as the position coordinates of the dynamic obstacle:​​

[0058] ψ t =atan2(y d -y,x d -x)

[0059]

[0060] Among them, ψ t is the target heading; s is the lateral guidance following error, e is the longitudinal guidance following error, and the values ​​of s and e are both 0; is the heading guidance following error; R(ψ t ) is the rotation matrix; u c is the target speed, r c is the target angular velocity; k1 is the speed control parameter, k2 is the angular velocity control parameter, a is the speed saturation limit parameter, b is the angular velocity saturation limit parameter, k1, k2, a, b are all positive numbers;

[0061] In order to make the unmanned boat avoid dynamic obstacles, the following distance-based control obstacle function h(p,p d ):

[0062]

[0063] where d d is the minimum collision avoidance distance between the unmanned boat and the dynamic obstacle, α is the slack variable, and α is a positive constant. Consider the upper and lower bounds of the speed u min ≤u≤u max , where u min 、u max These are the minimum and maximum speeds set for the unmanned boat. The speed limits are as follows:

[0064] Au≤B

[0065] in:

[0066]

[0067] Furthermore, the grid side length d is 1 to 2 m.

[0068] Compared with the prior art, the present invention has the following beneficial effects:

[0069] First, compared with the existing unmanned boat path planning algorithm, the present invention develops an online traversal path planning platform based on satellite maps, and users can use online satellite maps to manually select different mission areas to perform traversal path planning operations for unmanned boats for different mission scenarios. Therefore, the application scenarios of the present invention are broader, which is conducive to platform transplantation and secondary development.

[0070] Second, compared with the existing unmanned boat traversal path planning algorithm, the present invention optimizes the traversal path planning algorithm, improves the turning rate of the unmanned boat, and adopts a traversal path with fewer turns. By reducing the number of turns of the unmanned boat, the time to complete the task is reduced on the one hand, and the energy consumption of the unmanned boat is reduced on the other hand.

[0071] Third, compared with the existing unmanned boat path tracking algorithm, the present invention adopts a speed-based control obstacle function method to achieve the collision avoidance function of the unmanned boat. The addition of the collision avoidance algorithm can enable the unmanned boat to avoid dynamic obstacles only by changing the speed of the unmanned boat when performing a mission. BRIEF DESCRIPTION OF THE DRAWINGS

[0072] Figure 1 Flowchart of the present invention

[0073] Figure 2 This is the image after global thresholding using the threshold function.

[0074] Figure 3 The image is rasterized.

[0075] Figure 4 Augment the processed image for obstacles.

[0076] Figure 5 This is the result of the spanning tree calculation of the unmanned boat on the grid map.

[0077] Figure 6 Generate results for the path of the unmanned boat on the raster map.

[0078] Figure 7 It is the minimum distance curve for the unmanned boat to avoid dynamic collision.

[0079] Figure 8 This is the minimum speed curve for the unmanned boat to avoid dynamic collision. DETAILED DESCRIPTION

[0080] The present invention will be further described below in conjunction with the accompanying drawings.

[0081] like Figure 1 As shown, a satellite map-based unmanned boat traversal path planning and collision avoidance method includes the following steps:

[0082] The first step is to capture the required mission area image from the online satellite map according to the user's mission requirements.

[0083] In the second step, based on the intercepted satellite image, the rotation and cropping functions in the opencv image processing database are used to obtain a processed image with appropriate size and direction; the threshold function is used to perform global threshold processing on the image to process the image into a black and white binary image (such as Figure 2 According to the pixel information of the binary image, the image is rasterized using the rasterization function (as shown in Figure 3 As shown in Figure 2 ); To address the problem of irregular obstacle areas in raster images, an obstacle expansion function is used to expand the obstacle boundaries of the rasterized image (as shown in Figure 2 ). Figure 4 shown).

[0084] The third step is to extract the set Point of the obstacle grid according to the processed grid map. obs Set Point with free grid free , and generate a spanning tree that traverses all free grids according to the spanning tree algorithm (such as Figure 5 ); generate a closed loop traversal path around the spanning tree in a counterclockwise direction, and use this path as the result of the unmanned boat traversal path planning (as shown in Figure 6 shown).

[0085] Embodiments of the present invention are as follows:

[0086] Before starting planning, determine the number of unmanned boats to perform the task in advance, connect to the hardware platform of the unmanned boat through the communication protocol, and obtain the initial state information of the unmanned boat. The user drags the map with the mouse to obtain the area where the task needs to be performed. The center point needs to be placed in the plannable area. Click "Center Point" to obtain the coordinates of the center point of the current area and set this position as the starting position of the unmanned boat. Click "Traversal Path Planning" with the mouse to process the image of the task area. First, capture the image of the current area. After the capture is completed, the raster map of the corresponding area is obtained through the image processing algorithm. Use the minimum spanning tree algorithm to obtain the planned path for traversing the task area, and click "Send Data Points" to send the path data to the unmanned boat. After connecting the unmanned boat, click the algorithm mode. At this time, you can monitor the status information and tracking effect of the unmanned boat in real time on the satellite map on the right.

[0087] The total number of grids in the mission area is 1400, of which 744 are free grids, 590 are obstacle grids, and 66 are expanded obstacle grids. The initial position of the underactuated unmanned vehicle p = [3,5] T , with an overall coverage rate of 92%.

[0088] Based on the above design scheme, the parameters of the unmanned boat collision avoidance algorithm are set as follows:

[0089] k1=1.5, k2=1, Δ=0.5, α=0.5, d d=2

[0090] Figure 7 , 8 The minimum distance curve and speed curve of the unmanned boat when avoiding collision are shown respectively. When the distance between the unmanned boat and the dynamic obstacle decreases, the speed constraint of the control obstacle function begins to reduce the speed of the unmanned boat. When the distance between the unmanned boat and the dynamic obstacle is close to the set minimum collision avoidance distance of 2 meters, the speed of the unmanned boat drops to 0 meters / second, and the collision avoidance effect of the dynamic obstacle can be completed. The effectiveness of the proposed method is verified by hardware-in-the-loop simulation experiments.

[0091] The present invention is not limited to this embodiment, and any equivalent concepts or changes within the technical scope disclosed by the present invention are included in the protection scope of the present invention.

Claims

1. An unmanned boat traversal path planning and collision avoidance method based on satellite maps, Characterized in that: It includes the following steps: A. Process the image and establish a grid map A1. Process the satellite map image First, intercept the required task area image from the online satellite map, and use the rotation and cropping functions in the opencv image processing database to maximize the display of the task area; Secondly, use the image enhancement and image segmentation algorithms to perform gray-scale processing on the color satellite image, and use the threshold function to perform global thresholding on the picture, converting the color map into a single-channel 8-bit black and white type map to sharpen the contour of the obstacle area in the task area image; A2. Establish a grid map and expand the obstacles First, according to the limitation of the iterative operation of the path planning algorithm, the image is scaled proportionally to obtain a binary image with a pixel size of m*n, where m is the height of the grid map, n is the width of the grid map, and each grid has a square grid with a side length of d. The image obtained at this time has an irregular boundary, so the image obstacles are expanded before being converted into a grid map; since the planning algorithm is designed to perform a spanning tree algorithm on a 2*2 grid, the obstacles in the image are expanded according to the 2*2 grid, that is, starting from the origin, there are obstacles in the four adjacent grids, so this 2*2 grid is designed as an obstacle grid, and the obstacle grid is expanded to obtain a binary image of obstacle expansion; the pixel points of the image are taken out, and the obstacle grid is assigned 0 and the free grid is assigned 1 using the rasterization algorithm. All pixel points are traversed to obtain a grid map for the execution of the path planning algorithm, and the area in the grid map where the unmanned boat cannot navigate is regarded as an obstacle area, and all grid coordinates of the obstacle area are set as Point obs : Point obs ={p o1 ,p o2 ,…,p og },g=1,2…i Among them, p o1 =[x obs1 ,y obs1 ] T 、p o2 =[x obs2 ,y obs2 ] T ,…,p og =[x obsg ,y obsg ] T are the 1st, 2nd, …, gth obstacle grids respectively, [x obs1 ,y obs1 ] T ,[x obs2 ,y obs2 ] T ,[x obsg ,y obsg ] T are the horizontal and vertical coordinate values ​​of the first, second, …, and g-th obstacle grids, respectively, and i is the number of obstacle grids; The free grid coordinates for the unmanned boat to navigate are collected as Point free : Point free ={p f1 ,p f ,…,p fk },k=1,2,…,j Among them, p o1 =[x free1 ,y free1 ] T 、p o2 =[x free2 ,y free2 ] T ,…,p ok =[x freek ,y freek ] T are the first, second, ..., kth free grids, [x free1 ,y free1 ] T ,[x free2 ,y free2 ] T ,…,[x freek ,y freek ] T are the horizontal and vertical coordinate values ​​of the first, second, …, kth free grids, respectively, and j is the number of free grids; B. Optimize the design of the unmanned boat traversal path planning algorithm based on the minimum spanning tree After the grid map is established, plan a coverage path for the unmanned boat in the task area; for path generation, use the minimum spanning tree algorithm; specifically, construct a minimum spanning tree for the task area, and then generate a path to bypass it; the minimum spanning tree algorithm generates a coverage path, and the planned path is in a rectangular area with length m*n and width, and l is used as the minimum distance for the unmanned boat to move; and make the following assumptions: First, set the initial position of the unmanned boat to p start : p start =[x start ,and start ] T ,[x start ,and start ] T ∈Point free Among them, [x start ,y start ] T are the horizontal and vertical coordinates of the initial position; Secondly, the unmanned boat is only allowed to move in the four directions of up, down, left, and right of the grid where the unmanned boat is located. Set the set of path points of the unmanned boat as Point ship , set the last position of the unmanned boat to p last : p last =[x last ,and last ] T ,[x last ,and last ] T ∈Point free Among them, [x last ,y last ] T is the horizontal and vertical coordinates of the previous position of the unmanned boat, and the current position of the unmanned boat is set to p now : p now =[x now ,and now ] T ,[x now ,and now ] T ∈Point free Among them, [x now ,y now ] T is the horizontal and vertical coordinates of the current position of the unmanned boat, and the initial settings are as follows: p now =p start p last =p now The unmanned boat traverses the free grid area according to the number j of free grids, and set the loop count = 0: When count < j: Each cycle selects in the counterclockwise direction, that is, searching in the right, up, left, and down directions. Operations refer to adding elements to a collection; First, if the grid on the right side of the unmanned boat is a free grid, the unmanned boat moves to the grid on the right side: If [x now +l,y now ] T ∈Point free The conditions are met: [x now ,and now ] T =[x now +l,y now ] T If the grid on the right side of the unmanned boat is an obstacle grid, and the grid on the upper side of the unmanned boat is a free grid, the unmanned boat moves to the grid on the upper side: If [x now ,y now +l] T ∈Point free The conditions are met: [x now ,and now ] T =[x now ,and now [+l] T If the grids on the right and upper sides of the unmanned boat are obstacle grids, and the grid on the left side of the unmanned boat is a free grid, the unmanned boat moves to the grid on the left side: If [x now -l,y now ] T ∈Point free The conditions are met: [x now ,and now ] T =[x now -l,y now ] T If the grids on the right, upper and left sides of the unmanned boat are obstacle grids, and the grid on the lower side of the unmanned boat is a free grid, the unmanned boat moves to the grid on the lower side: If [x now ,y now -l] T ∈Point free The conditions are met: [x now ,and now ] T =[x now ,and now -l] T At this time, it has moved to the next grid, so the loop count = count + 1. If count < j, continue the loop. If count = j, the loop ends; Finally, the spanning tree generated by the above algorithm is represented by p start Around Point in counterclockwise direction from the starting point ship The waypoints generate a closed loop path; C. Design the collision avoidance of the unmanned boat based on the control barrier function algorithm The unmanned boat is an underactuated unmanned boat, and the kinematic model of the underactuated unmanned boat is as follows: Where x, y, ψ represent the position of the underactuated unmanned boat on the x-axis and y-axis in the earth coordinate system and the bow roll angle respectively; u, v, r represent the sway speed, drift speed and bow roll angular velocity of the underactuated unmanned boat in the hull coordinate system respectively; set p = [x, y] T As the location coordinates of the unmanned boat; Set the kinematic model of the dynamic obstacle as: Among them, x d ,y d , d Respectively represent the position of the dynamic obstacle on the x-axis and y-axis in the earth coordinate system and the yaw angle; u d 、v d 、r d represent the sway velocity, drift velocity and bow angular velocity of the dynamic obstacle in the hull coordinate system respectively; set p d =[x d ,y d ] T As the position coordinates of dynamic obstacles: ψ t =atan2(y d -y,x d -x) Among them, ψ t is the target heading; s is the lateral guidance following error, e is the longitudinal guidance following error, and the values ​​of s and e are both 0; ψ e is the heading guidance following error; R(ψ t ) is the rotation matrix; u c is the target speed, r c is the target angular velocity; k 1 is the speed control parameter, k 2 is the parameter of angular velocity control, a is the velocity saturation limit parameter, b is the angular velocity saturation limit parameter, k 1 ,k 2 ,a,v are both positive numbers; In order to make the unmanned boat avoid dynamic obstacles, the following distance-based control obstacle function h(p,p d ): where d d is the minimum collision avoidance distance between the unmanned boat and the dynamic obstacle, α is the relaxation variable, and α is a positive constant; consider the upper and lower bound constraints on the speed u min ≤u≤u max , where u min 、u max These are the minimum and maximum speeds set for the unmanned boat. The speed limits are as follows: Au ≤ B Where:

2. According to the method for unmanned boat traversal path planning and collision avoidance based on satellite maps described in claim 1, Characterized in that: The side length d of the grid is 1 - 2m.