Amphibious unmanned vehicle overwater path optimization method considering wind wave influence
By combining the energy-efficient A* algorithm with grid maps and real-time wind and wave information, the water path of amphibious unmanned vehicles is optimized, solving the problems of time-consuming and energy-consuming paths under the influence of wind and waves, and achieving more efficient navigation.
Patent Information
- Application Number
- CN202411048749.3
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-01
- Publication Date
- 2024-11-08
AI Technical Summary
Existing path planning algorithms fail to effectively consider the impact of wind and waves on the energy consumption of amphibious unmanned vehicles, resulting in path time or energy consumption that may not be optimal.
The energy-optimized A* algorithm is used to generate a priori navigation path by combining grid map and historical wind and wave information. The path points are optimized to reduce energy consumption by taking into account wind and wave changes in real time and local optimization.
The generated path takes less time and consumes less energy under the influence of wind and waves, thus improving the energy efficiency of amphibious unmanned vehicles.
Smart Images

Figure CN118915763A_ABST
Abstract
Description
Technical Field
[0001] The invention provides a method for optimizing the water path of an amphibious unmanned vehicle taking into account the influence of wind and waves, and belongs to the technical field of unmanned vehicle control. Background Art
[0002] An amphibious vehicle is a special vehicle that can travel on land and on water. Benefiting from its flexibility and versatility, amphibious unmanned vehicles have played an increasingly important role in civil and military fields such as emergency rescue, ocean exploration, and ocean border patrol. Path planning technology, as one of the key technologies, is a prerequisite for ensuring that amphibious unmanned vehicles can complete their tasks safely and efficiently. However, for amphibious vehicles, existing path planning algorithms focus on obstacle avoidance and rarely consider the impact of wind and waves, which may lead to additional increase in amphibious vehicle energy consumption. In 1968, the A* algorithm proposed by Peter Hart is a heuristic algorithm for solving path search problems. It is used to find the shortest path from the starting point to the end point in a map. This method does not take into account the impact of wind and waves on amphibious vehicles, resulting in the search path being the shortest but not necessarily the least time-consuming or energy-consuming. Therefore, the present invention comprehensively considers the impact of wind and waves and provides a path optimization method based on amphibious unmanned vehicles. Summary of the invention
[0003] The technical problem to be solved by the present invention is to provide a method for optimizing the water path of an amphibious unmanned vehicle taking into account the influence of wind and waves, aiming to solve the problem that the amphibious unmanned vehicle can still navigate along the path with optimal energy consumption under the influence of wind and waves.
[0004] A method for optimizing the water path of an amphibious unmanned vehicle considering the influence of wind and waves comprises the following steps:
[0005] Step 1: Obtain the electronic nautical chart of the sea area where the amphibious unmanned vehicle is sailing, use the grid map method to model the environment of the area, and set the starting and ending points of the navigation.
[0006] 1.1 The navigation area is divided into a certain number of square cells according to the electronic nautical chart to form a grid map, and is divided into passable grids and impassable grids according to whether there are obstacles in the grids.
[0007] Step 2: Obtain prior information on the navigation area, and generate the navigation path and waypoints from the starting point to the end point based on the energy consumption optimized A* algorithm as the prior navigation path and waypoints.
[0008] Since we cannot fully know the wind and wave information at all locations in the navigation area, we can estimate the current wind and waves based on the wind and wave information of the same period in history. The path generated by the energy-optimized A* algorithm based on the historical wind and wave information takes the impact of wind and waves into account to a certain extent.
[0009] 2.1 Prior information on the navigation area refers to the average wind speed, wind direction, and wave height information of the same historical period, and this information is added to the grid map.
[0010] 2.2 Establish the energy consumption model of amphibious unmanned vehicles. During the driving process of amphibious vehicles, the output power of the amphibious vehicle propeller is used to overcome the resistance of water, so the power consumption of the engine is
[0011]
[0012] P is the power consumption of the amphibious vehicle engine, ρ is the seawater density, S is the submerged area of the amphibious vehicle, V is the speed, C R is the drag coefficient and η is the mechanical efficiency.
[0013] 2.3 The so-called energy-optimized A* algorithm is an improved A* algorithm. In the traditional A* algorithm, the cost function of each node in the grid map is set to F = G + H;
[0014] Where G is the cost of moving from the starting point to the current node, and H is a heuristic function that estimates the estimated cost from the current node to the end point. The process of the A* algorithm is:
[0015] Create open lists and close lists;
[0016] Put the starting point into the open list;
[0017] Repeat the process below:
[0018] Traverse the open list, pop out the node with the smallest F value as the current node to be processed, and add it to the closelist; if it is the end point, end the repetitive process and get the global path by backtracking the parent node;
[0019] Traverse the 8 nodes adjacent to this node. If they are obstacle nodes or are already in the close list, ignore them. Otherwise, perform the following operations:
[0020] If it is not in the open list, take the current node as its parent node and record its F value, G value and H value;
[0021] If in the open list, compare the G value of the current node and its parent node. If the G value of the current node is smaller, update its parent node to the current node.
[0022] In the energy-optimized A* algorithm, the cost G required to move from the starting point to the current node takes into account the impact of wind and waves on amphibious vehicles and includes the following two parts:
[0023] G=G1+G2,
[0024] Among them, G1 represents the time cost required to move from the starting point to the current node, and G2 represents the energy cost required to move from the starting point to the current node. Specifically:
[0025] G1=k1*s / v, where k1 is the time cost weight coefficient, s is the distance, and v is the actual speed of the amphibious vehicle under the influence of wind and waves. For specific calculation, refer to the formula proposed by RLTOWNSIN:
[0026]
[0027] Among them, α is the ship deceleration coefficient, μ is the directional speed reduction coefficient, BN is the wind level of the bushel wind gauge, Δ is the displacement of the amphibious vehicle, and v0 is the speed of the amphibious vehicle in still water. Specifically, the directional speed reduction coefficient is as follows:
[0028] G2=k2*P*t, where k2 is the energy consumption cost weight coefficient, t is time, and P is the engine power consumption in the amphibious unmanned vehicle energy consumption model.
[0029] Combined with the prior information of the navigation area in 2.1, the energy-optimized A* algorithm is used to generate the prior navigation path and path points.
[0030] Step 3: Obtain wind and wave information in the current sea area, set effective optimization time, and perform real-time local optimization of the path.
[0031] The prior navigation path in the previous step uses historical wind and wave information and can only be used as a reference, so the path is optimized in real time during the actual movement of the amphibious vehicle. Since the wind and waves are constantly changing, the effective time T is set. It is assumed that the wind and waves are basically unchanged within the effective time T, so the optimized path is meaningful and can reduce the energy consumption of the amphibious vehicle. The path point P that the amphibious vehicle can reach within the effective time T becomes the local navigation point.
[0032] 3.1 Get the wind speed and direction information of each grid at the current moment. The wind level is determined according to the Beaufort wind scale and wind speed. Add grid time-varying attributes such as wind level, wind speed, wave height and direction to the grid map.
[0033] 3.2 Set the effective time T and the local navigation point F. Use the energy-optimized A* algorithm in the second step to optimize the path from the current position of the amphibious vehicle to the local navigation point F to reduce energy consumption.
[0034] 3.3 When the amphibious unmanned vehicle movement time reaches T or reaches the navigation point, 3.1 and 3.2 are re-executed until the amphibious unmanned vehicle reaches the end point.
[0035] The present invention takes into account the impact of wind and waves on the energy consumption and time of amphibious unmanned vehicles. The traditional A* algorithm believes that the shortest path is the optimal path, but under the influence of wind and waves, the shortest path does not mean the fastest time or the lowest energy consumption. The present invention proposes an energy consumption optimization A* algorithm that comprehensively considers the impact of wind and waves on energy consumption and time.
[0036] Compared with the traditional A* algorithm, the present invention takes into account the impact of wind and waves on the path planning of amphibious vehicles, adds time cost and energy consumption cost to the A* algorithm, and generates a path that consumes less time and consumes less energy. BRIEF DESCRIPTION OF THE DRAWINGS
[0037] Figure 1 It is a flow chart of the present invention.
[0038] Specific implementation method
[0039] The specific technical solution of the present invention is described in conjunction with the accompanying drawings.
[0040] A method for optimizing the water path of an amphibious unmanned vehicle considering the influence of wind and waves. Figure 1 As shown, the following steps are included:
[0041] Step 1: Obtain the electronic nautical chart of the sea area where the amphibious unmanned vehicle is sailing, use the grid map method to model the environment of the area, and set the starting and ending points of the navigation.
[0042] 1.1 The navigation area is divided into 200x200 square cells according to the electronic nautical chart to form a grid map. The side length of each cell is 0.1km. The grid is divided into passable grids and impassable grids according to whether there are obstacles in the grid.
[0043] Step 2: Obtain prior information on the navigation area, and generate a navigation path from the starting point to the end point based on the energy consumption optimized A* algorithm as the prior navigation path.
[0044] Since we cannot fully know the wind and wave information at all locations in the navigation area, we can estimate the current wind and waves based on the wind and wave information of the same period in history. The path generated by the energy-optimized A* algorithm based on the historical wind and wave information takes the impact of wind and waves into account to a certain extent.
[0045] 2.1 Obtain the average wind speed, wind direction, and wave height information of the sea area in the past ten years, and add this information to the grid map.
[0046] 2.2 Establish an energy consumption model for amphibious unmanned vehicles. During the driving process of an amphibious vehicle, the output power of the amphibious vehicle propeller is used to overcome the resistance of water, so the power consumption of the engine is:
[0047]
[0048] P is the power consumption of the amphibious vehicle engine, ρ is the seawater density, S is the submerged area of the amphibious vehicle, V is the speed, C R is the drag coefficient and η is the mechanical efficiency.
[0049] 2.3 The so-called energy-optimized A* algorithm is an improved A* algorithm. In the traditional A* algorithm, the cost function of each node in the grid map is set to F = G + H;
[0050] Where G is the cost of moving from the starting point to the current node, and H is a heuristic function that estimates the estimated cost from the current node to the end point. The process of the A* algorithm is:
[0051] Create open lists and close lists;
[0052] Put the starting point into the open list;
[0053] Repeat the process below:
[0054] Traverse the open list, pop out the node with the smallest F value as the current node to be processed, and add it to the closelist; if it is the end point, end the repetitive process and get the global path by backtracking the parent node;
[0055] Traverse the 8 nodes adjacent to this node. If they are obstacle nodes or are already in the close list, ignore them. Otherwise, perform the following operations:
[0056] If it is not in the open list, take the current node as its parent node and record its F value, G value and H value;
[0057] If in the open list, compare the G value of the current node and its parent node. If the G value of the current node is smaller, update its parent node to the current node.
[0058] In the energy-optimized A* algorithm, the cost G required to move from the starting point to the current node consists of the following two parts:
[0059] G=G1+G2,
[0060] Among them, G1 represents the time cost required to move from the starting point to the current node, and G2 represents the energy cost required to move from the starting point to the current node. Specifically,
[0061] G1=k1*s / v, where k1 is the time cost weight coefficient, s is the distance, and v is the actual speed of the amphibious vehicle under the influence of wind and waves. For specific calculation, refer to the formula proposed by RL TOWNSIN:
[0062]
[0063] Among them, α is the ship deceleration coefficient, μ is the directional speed reduction coefficient, BN is the wind level of the bushel wind gauge, Δ is the displacement of the amphibious vehicle, and v0 is the speed of the amphibious vehicle in still water. Specifically, the directional speed reduction coefficient is as follows:
[0064]
[0065] Where ε is the angle between the amphibious vehicle and the direction of the wind and waves.
[0066] G2=k2*P*t, where k2 is the energy consumption cost weight coefficient, t is time, and P is the engine power consumption in the amphibious unmanned vehicle energy consumption model.
[0067] In order to comprehensively consider the impact of time and energy consumption, the values of k1 and k2 are as follows:
[0068] Assuming that there is no wind or wave, the time cost for an amphibious vehicle to pass through a grid is G 01 , the energy cost is G 02 , then k1=G 02 , k2=G 01 .
[0069] Step 3: Obtain wind and wave information in the current sea area, set effective optimization time, and perform real-time local optimization of the path.
[0070] The prior navigation path in the previous step uses historical wind and wave information and can only be used as a reference, so the path is optimized in real time during the actual movement of the amphibious vehicle. Since the wind and waves are constantly changing, the effective time T is set. It is assumed that the wind and waves are basically unchanged within the effective time T, so the optimized path is meaningful and can reduce the energy consumption of the amphibious vehicle. The path point P that the amphibious vehicle can reach within the effective time T becomes the local navigation point.
[0071] 3.1 Get the wind speed and direction information of each grid at the current moment. The wind level is determined according to the Beaufort wind scale and wind speed. Add grid time-varying attributes such as wind level, wind speed, wave height and direction to the grid map.
[0072] 3.2 Set the effective time T and the local navigation point F. Use the energy-optimized A* algorithm in the second step to optimize the path from the current position of the amphibious vehicle to the local navigation point F to reduce energy consumption.
[0073] The effective time T is set to 0.15h, and the local navigation point is set to the farthest prior navigation point that the amphibious vehicle can reach within T time.
[0074] 3.3 When the amphibious unmanned vehicle movement time reaches T or reaches the navigation point, 3.1 and 3.2 are re-executed until the amphibious unmanned vehicle reaches the end point.
Claims
1. A method for optimizing the water path of an amphibious unmanned vehicle considering the influence of wind and waves, characterized in that: The following steps are involved: Step 1: Obtain the electronic chart of the amphibious unmanned vehicle navigation area, use the grid map method to model the area environment, and set the starting and ending points of the navigation; Step 2: Obtain prior information on the navigation area, and generate a navigation path and path points from the starting point to the end point based on the energy consumption optimized A* algorithm as the prior navigation path and path points; Step 3: Obtain wind and wave information in the current sea area, set effective optimization time, and perform real-time local optimization of the path.
2. The method for optimizing the water path of an amphibious unmanned vehicle considering the influence of wind and waves according to claim 1 is characterized in that: The first step is to divide the navigation area into a certain number of square cells according to the electronic nautical chart to form a grid map, and divide it into passable grids and impassable grids according to whether there are obstacles in the grid.
3. The method for optimizing the water path of an amphibious unmanned vehicle considering the influence of wind and waves according to claim 1 is characterized in that: The second step specifically includes the following steps: 2.1 Prior information of the navigation area refers to the average wind speed, wind direction and wave height information of the same period in history, and this information is added to the grid map; 2.2 Establish the energy consumption model of amphibious unmanned vehicles; during the driving process of amphibious vehicles, the output power of the amphibious vehicle propeller is used to overcome the resistance of water, so the power consumption of the engine is: P is the power consumption of the amphibious vehicle engine, ρ is the seawater density, S is the submerged area of the amphibious vehicle, V is the speed, C R is the drag coefficient, η is the mechanical efficiency; The energy consumption optimized A* algorithm described in 2.3 is an improved A* algorithm; In the energy-optimized A* algorithm, the cost G required to move from the starting point to the current node takes into account the impact of wind and waves on amphibious vehicles and includes the following two parts: G = G1 + G2, Among them, G1 represents the time cost required to move from the starting point to the current node, and G2 represents the energy cost required to move from the starting point to the current node; specifically: G1=k1*s / v, where k1 is the time cost weight coefficient, s is the distance, and v is the actual speed of the amphibious vehicle under the influence of wind and waves. The calculation refers to the formula proposed by RLTOWNSIN: Among them, α is the ship deceleration coefficient, μ is the directional speed reduction coefficient, BN is the wind level of the bushel wind scale, Δ is the displacement of the amphibious vehicle, and v0 is the speed of the amphibious vehicle in still water; specifically, the directional speed reduction coefficient is as follows: G2 = k2*P*t, where k2 is the energy cost weight coefficient, t is time, and P is the engine power consumption in the amphibious unmanned vehicle energy consumption model; Combined with the prior information of the navigation area in 2.1, the energy-optimized A* algorithm is used to generate the prior navigation path and path points.
4. The method for optimizing the water path of an amphibious unmanned vehicle considering the influence of wind and waves according to claim 1 is characterized in that: The third step specifically includes the following steps: 3.1 Obtain the wind speed and direction information of each grid at the current moment. The wind level is determined according to the Beaufort wind scale and wind speed; add the grid time-varying attributes such as wind level, wind speed, wave height and direction to the grid map; 3.2 Set the effective time T and the local navigation point F; use the energy consumption optimization A* algorithm in the second step to optimize the path from the current position of the amphibious vehicle to the local navigation point F to reduce energy consumption; 3.3 When the amphibious unmanned vehicle movement time reaches T or reaches the navigation point, 3.1 and 3.2 are re-executed until the amphibious unmanned vehicle reaches the end point.
Citation Information
Cited By
Dynamic adaptive amphibious vehicle path and energy consumption optimization method
CN119573751A
A Dynamic Adaptive Amphibious Vehicle Path and Energy Consumption Optimization Method
CN119573751B
