Transportation equipment path planning method, device and equipment in storage system, readable storage medium and program product

By combining Manhattan distance and Euclidean distance as heuristic functions in AGV path planning and optimizing the path using the cost function, the problem of excessive turn times in tight intensive storage systems is solved, and the system efficiency is improved.

CN118980380APending Publication Date: 2024-11-19SHANGHAI FANGTRON INTELLIGENT TECH CO LTD
View PDF 8 Cites 0 Cited by

Patent Information

Application Number
CN202411206967.5
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-30
Publication Date
2024-11-19

AI Technical Summary

Technical Problem

In tight intensive storage systems, the turn operation of AGV results in increased energy loss and time cost. Existing path planning methods such as the heuristic functions of the Astar algorithm (European distance and Manhattan distance) generate redundant paths when encountering obstacles. Causes inefficiency.

Method used

Manhattan distance is used as the heuristic function of global path planning, and when encountering obstacles, it switches to Euclidean distance as the heuristic function of local path planning. The path is optimized by combining turn cost and collision cost functions to reduce the number of turns.

Benefits of technology

It effectively reduces the number of turns of the AGV path, reduces energy consumption and running time, and improves system efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118980380A_ABST
    Figure CN118980380A_ABST
Patent Text Reader

Abstract

The invention relates to a transport equipment path planning method and device in a storage system, computer equipment, a computer readable storage medium and a computer program product. The method comprises the following steps: acquiring map information of a storage system; determining a starting point and an ending point of transportation equipment; and performing global path planning based on the starting point and the ending point by taking a Manhattan distance as a heuristic function, and performing local path planning by taking an Euclidean distance as a heuristic function under the condition of determining that collision exists. By adopting the method, the turning times of the planned path can be reduced.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of storage technology, and in particular to a method, device, computer equipment, computer-readable storage medium and computer program product for transport equipment path planning in a storage system. Background Art

[0002] With the introduction of the emerging compact and intensive warehousing system cubic warehouse, a new generation of efficient and fast warehousing has emerged, which uses the AGV (transportation equipment) on the top to store and move the material boxes. The process is that after the warehousing tasks are distributed, all AGVs will be assigned a starting point and end point according to the tasks, and a collision-free task route will be planned based on this. However, during the process of travel, the turning operation of the AGV on the cubic warehouse will have higher energy loss and time cost than the normal ground AGV. In order to improve the efficiency of the cubic warehouse system, it is necessary to solve it at the source first. If the number of turning actions can be reduced in the AGV planning stage, energy consumption can be greatly reduced, and the operating time can be reduced, and the system efficiency can be improved.

[0003] In the traditional method, the Astar algorithm is used to guide the path of the AGV. Common heuristic functions include Euclidean distance and Manhattan distance. For grid maps, and AGV can only move up, down, left and right, Euclidean distance as a heuristic function will result in too many turning paths, which will present a zigzag route. In theory, the best choice of heuristic function on a grid map is Manhattan distance, which is naturally suitable for the current grid map environment and will generate the least turning path in theory. But in reality, there are many permanent obstacles (pillars) and temporary obstacles (temporary storage bins on the top floor) on the map. If there are obstacles, simply using Manhattan for heuristics will result in many redundant paths in the generated path, resulting in redundant turning operations. Redundant turning operations will lead to low efficiency (frequent turning and maneuvering, and frequent lifting and switching of wheels will result in additional time costs), as well as excess energy consumption (lifting of wheels will result in higher kinetic energy consumption than normal driving). Summary of the invention

[0004] Based on this, it is necessary to provide a method, device, computer equipment, computer-readable storage medium and computer program product for transport equipment path planning in a storage system that can reduce the number of turns in a planned path in response to the above technical problems.

[0005] In a first aspect, the present application provides a method for transport equipment path planning in a storage system, the method comprising:

[0006] Get map information of storage system;

[0007] Determine the starting and ending points of transport equipment;

[0008] Global path planning is performed based on the start point and the end point by using Manhattan distance as a heuristic function, and when it is determined that there is a collision, local path planning is performed by using Euclidean distance as a heuristic function.

[0009] In one embodiment, the global path planning is performed based on the starting point and the end point by using Manhattan distance as a heuristic function, and when it is determined that there is a collision, the local path planning is performed by using Euclidean distance as a heuristic function, including:

[0010] Determine the next candidate planning node based on the starting point and the end point by using Manhattan distance as a heuristic function;

[0011] In the case where it is determined based on the map information that the next node to be selected for planning is not the end point, and the next node to be selected for planning is an obstacle node, determining whether there is a collision based on the current planning node, the previous planning node, and the next node to be selected for planning;

[0012] In the case of determining that there is a collision, determining the next planning node based on the current planning node and the end point by using the Euclidean distance as a heuristic function;

[0013] If it is determined that there is no collision, continue to perform the step of determining the next candidate planning node based on the starting point and the end point by using Manhattan distance as a heuristic function, and determine the next planning node from the next candidate planning node;

[0014] The next planning node is used as the current planning node, and the next candidate planning node is determined based on the current planning node and the end point by continuing to use Manhattan distance as a heuristic function, until the next candidate planning node is determined to be the end point based on the map information.

[0015] In one embodiment, the determining whether there is a collision based on the current planning node, the previous planning node, and the next planning node to be selected includes:

[0016] Constructing a first direction vector based on the current planning node and the previous planning node;

[0017] Constructing a second direction vector based on the previous planning node and the next planning node to be selected;

[0018] Obtaining an angle between the first direction vector and the second direction vector according to a dot product of the first direction vector and the second direction vector;

[0019] When the angle between the first direction vector and the second direction vector is a preset value, it is determined that a collision exists.

[0020] In one embodiment, the heuristic function further includes a cost function, and the cost function includes a turning cost function and / or a collision cost function; the method further includes:

[0021] When there is a turn in the path planned based on the heuristic function, obtaining a turn cost based on the turn cost function;

[0022] In the case where the path planned based on the heuristic function overlaps with other paths, generating a collision cost based on the collision cost function;

[0023] A path extension of the heuristic function is constrained based on the turn cost and the collision cost.

[0024] In one embodiment, when there is a turn in the path planned based on the heuristic function, obtaining the turn cost based on the turn cost function includes:

[0025] Determine the previous planning node of the current planning node and the next planning node to be selected;

[0026] Based on the current planning node, the previous planning node and the next planning node to be selected, determining whether the next planning node to be selected is a turning node;

[0027] When the next planning node to be selected is a turning node, a turning cost is obtained based on the turning cost function.

[0028] In one of the embodiments, when the next to-be-selected planning node is a turning node, obtaining the turning cost based on the turning cost function includes:

[0029] When the next planning node to be selected is a turning node and it is determined that there is no collision based on the current planning node, the previous planning node and the next planning node to be selected, a turning cost is obtained based on the turning cost function.

[0030] In one embodiment, obtaining the turning cost based on the turning cost function includes:

[0031] Obtaining a preset first turn control weight, and obtaining a conversion instantaneous cost based on the first turn control weight, the cost from the current planning node to the starting point, the cost from the current planning node to the end point, the cost from the previous planning node to the starting point, and the cost from the previous planning node to the end point;

[0032] Obtaining a preset second turn control weight, and obtaining a cumulative turn cost based on the second turn control weight and the distance between the current planning node and the previous turning point;

[0033] The turning cost is obtained based on the instantaneous turning cost and the cumulative turning cost.

[0034] In one embodiment, generating the collision cost based on the collision cost function includes:

[0035] Determine the number of overlaps between the path planned by the heuristic function and other paths;

[0036] determining a collision weight corresponding to the map information;

[0037] A collision cost is generated based on the collision weight and the number of overlaps.

[0038] In one embodiment, determining the collision weight corresponding to the map information includes:

[0039] determining a map size based on the map information;

[0040] A collision weight corresponding to the map size is obtained, wherein the larger the map size is, the larger the collision weight is.

[0041] In one embodiment, the method further comprises:

[0042] Obtain each turning node in the initial planning path based on the heuristic function;

[0043] A set of nodes to be optimized is obtained based on the starting point, each of the turning nodes and the end point, and each of the nodes to be optimized in the set of nodes to be optimized is sorted according to the path direction of the initial planned path;

[0044] Determine a current node to be optimized from the set of nodes to be optimized;

[0045] In the case that the current node to be optimized is not a target node in the set of nodes to be optimized, determining a first node to be optimized and a second node to be optimized based on the current node to be optimized, wherein the first node to be optimized is the next node to be optimized of the current node to be optimized, and the second node to be optimized is the next node to be optimized of the first node to be optimized;

[0046] Determine a current extended node based on the current node to be optimized, the first node to be optimized, and the second node to be optimized;

[0047] In the case where there are no obstacles on the extended path formed by the current node to be optimized, the current extended node and the second node to be optimized, replacing the road sections corresponding to the current node to be optimized, the first node to be optimized and the second node to be optimized in the initial planned path with the extended path;

[0048] The current extended node is added to the set of nodes to be optimized, and the first node to be optimized and the second node to be optimized are deleted, and the step of determining the current node to be optimized from the set of nodes to be optimized is continued until the current node to be optimized is the target node in the set of nodes to be optimized.

[0049] In one embodiment, determining the current extended node based on the current node to be optimized, the first node to be optimized, and the second node to be optimized includes:

[0050] When a virtual rectangle is obtained based on the current node to be optimized, the first node to be optimized, and the second node to be optimized, a current expansion node is determined based on corner points of the virtual rectangle.

[0051] In one embodiment, the method further comprises:

[0052] When no virtual rectangle is obtained based on the current node to be optimized, the first node to be optimized and the second node to be optimized, the step of determining the current node to be optimized from the set of nodes to be optimized is continued until the current node to be optimized is the target node in the set of nodes to be optimized.

[0053] In a second aspect, the present application further provides a transport equipment path planning device in a storage system, the device comprising:

[0054] A map information acquisition module, used to acquire map information from a storage system;

[0055] A task determination module is used to determine the starting point and end point of the transportation equipment;

[0056] The path planning module is used to perform global path planning based on the starting point and the end point by using Manhattan distance as a heuristic function, and to perform local path planning by using Euclidean distance as a heuristic function when a collision is determined.

[0057] In a third aspect, the present application further provides a computer device, comprising a memory and a processor, wherein the memory stores a computer program, and the processor implements the steps of the method in any one of the above-mentioned embodiments when executing the computer program.

[0058] In a fourth aspect, the present application further provides a computer-readable storage medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the steps of the method in any one of the above-mentioned embodiments.

[0059] In a fifth aspect, the present application also provides a computer program product, including a computer program, which implements the steps of the method in any one of the above embodiments when executed by a processor.

[0060] The transportation equipment path planning method, device, computer equipment, computer-readable storage medium and computer program product in the above-mentioned storage system obtain map information of the storage system; determine the starting point and end point of the transportation equipment; use Manhattan distance as a heuristic function to perform global path planning based on the starting point and end point, and when it is determined that there is a collision, use Euclidean distance as a heuristic function to perform local path planning. In this way, by using Manhattan distance as a heuristic function for global path planning, fewer turns can be obtained. Since Euclidean distance is defined based on diagonal distance, according to this feature, local detours generally do not occur when encountering obstacles. Therefore, when encountering obstacles, Euclidean distance can be used as a heuristic function to reduce the number of turns of the planned path as a whole. BRIEF DESCRIPTION OF THE DRAWINGS

[0061] In order to more clearly illustrate the technical solutions in the embodiments of the present application or related technologies, the drawings required for use in the embodiments of the present application or related technical descriptions will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without paying creative work.

[0062] Figure 1 A diagram of an application environment of a method for transport equipment path planning in a storage system in one embodiment;

[0063] Figure 2 A schematic diagram of a flow chart of a method for transport equipment path planning in a storage system in one embodiment;

[0064] Figure 3 A schematic diagram of each legend in a map in an embodiment;

[0065] Figure 4 Map information of a reverse out-of-stock status in one embodiment;

[0066] Figure 5 Map information of a positive out-of-stock state in one embodiment;

[0067] Figure 6 Map information of a reverse empty-cargo state of a transport device after picking up cargo in one embodiment;

[0068] Figure 7 Map information of a forward empty state of a transport device after picking up the goods in one embodiment;

[0069] Figure 8 A planned path obtained by performing path planning using Manhattan distance as a heuristic function in one embodiment;

[0070] Fig. 9 A planned path obtained by performing path planning using the Euclidean distance as a heuristic function in one embodiment;

[0071] Fig.10 A flowchart of a path planning step in one embodiment;

[0072] Fig.11 is a schematic diagram of a collision determination process in one embodiment;

[0073] Fig.12 A schematic diagram of path optimization in one embodiment;

[0074] Fig.13 A flowchart of a path optimization step in one embodiment

[0075] Fig.14 It is a structural block diagram of a transport equipment path planning device in a storage system in one embodiment;

[0076] Fig.15 FIG. 4 is a diagram showing the internal structure of a computer device in one embodiment. DETAILED DESCRIPTION

[0077] In order to make the purpose, technical solution and advantages of the present application more clearly understood, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

[0078] The method for transport device path planning in a storage system provided in the embodiment of the present application can be applied to Figure 1 In the application environment shown, the terminal 102 communicates with the transport device 104 through a network. The data storage system can store data that the terminal 104 needs to process. The terminal 102 can control the movement of each transport device 104, for example, the terminal 102 can generate a planned path for each transport device 104, so that the transport device 104 can move based on the planned path.

[0079] The terminal 102 may first obtain the map information of the storage system, determine the starting point and the end point of the transport equipment, perform global path planning based on the starting point and the end point using the Manhattan distance as a heuristic function, and perform local path planning using the Euclidean distance as a heuristic function when a collision is determined. In this way, by using the Manhattan distance as a heuristic function for global path planning, fewer turns may be obtained. Since the Euclidean distance is defined based on the diagonal distance, according to this feature, there will generally be no local detour when encountering an obstacle. Therefore, when encountering an obstacle, the Euclidean distance may be used as a heuristic function to reduce the number of turns of the planned path as a whole.

[0080] The terminal 102 may be, but is not limited to, various personal computers, laptops, smart phones, and tablet computers. The material box may be located in a cubic warehouse or any other storage, and is not specifically limited here. However, the cubic warehouse is used as an example for explanation in this application. The cubic warehouse hereinafter may be understood as a cubic warehouse. The transport device 104 is a device that can move along the track of the cubic warehouse, such as Figure 1 In the embodiment shown, it comprises at least one transport device 104 .

[0081] In an exemplary embodiment, Figure 2 As shown, a method for transport equipment path planning in a storage system is provided, and the method is applied to Figure 1 The terminal in is taken as an example to illustrate, including the following steps 202 to 206. Among them:

[0082] S202: Acquire map information of the storage system.

[0083] The storage system may be a system for storing goods, and the storage system may be a cubic warehouse, so that the map corresponding to the storage system may be a cubic warehouse map, and the cubic warehouse map may be a grid map. The grid map includes grids, and needs to ensure all-round horizontal and vertical directions, similar to a Rubik's Cube. On the grid map, the transport equipment AGV occupies two grids along the longitudinal direction, with the gripper module and the motion module occupying one grid respectively. In other embodiments, the grids occupied by the transport equipment AGV may also be other numbers.

[0084] Among them, Figure 3 As shown, permanent obstacles represent natural obstacles such as pillars in the grid map, while time-limited obstacles represent material boxes that occupy the top layer and are temporarily dug out to store and occupy the walking path. Non-walkable points represent non-walkable points in the map other than obstacles. The number of grids occupied by the transport equipment AGV in different states is also different. In this embodiment, the transport equipment AGV includes 4 states. Under normal circumstances, this transport equipment is divided into forward and reverse vehicles. The arrow represents the position of the gripper module responsible for picking up the goods. The downward direction is the forward direction, and the upward direction is the reverse direction. The other two states represent the grids occupied by the gripper after picking up the material box. In this state, there will be no interaction with the time-limited obstacles.

[0085] Based on the constraint information generated by the map, two types of map information based on safety considerations will be formed, specifically, Figure 4 and Figure 5 As shown, Figure 4 Map information for the reverse out-of-stock status. Figure 5This is the map information of the forward no-stock state. The grid with × indicates the unreachable restricted area, or the sorting station delivery and inlet. For obstacles on the map, according to the natural limitations of the grabber module, the unreachable point is the position that the motion module cannot reach except the corresponding obstacle. For time-limited obstacles, because the grabber module can pass through, the motion module can move to the adjacent area.

[0086] Combination Figure 6 and Figure 7 As shown, Figure 6 and Figure 7 It is the status information of the transport equipment after picking up the goods. When picking up the goods, there will be changes in the interaction with the map, mainly for the interaction between the grab head module and the time-limited obstacle area. When the goods are not grabbed, the grab head module grid can overlap with the yellow material box grid, but when the transport equipment picks up the material box with goods, because the grab head module area has been filled, it cannot pass through the time-limited obstacle area, and a new inaccessible point will be generated.

[0087] S204: Determine the starting point and the end point of the transportation equipment.

[0088] The starting point and the end point of the transport equipment are determined based on the cargo handling task corresponding to the transport equipment, which mainly includes two stages. The first stage is from the current position of the transport equipment to the storage position of the cargo, and the second stage is from the acquired storage position to the target handling position of the cargo. Therefore, in this embodiment, the starting point can be determined based on the stage of the cargo handling task. If it is in the first stage, the starting point is the current position of the transport equipment, and the end point is the storage position of the cargo. If it is in the second stage, the starting point is the storage position of the cargo or the current position of the transport equipment (for example, the cargo has been picked up and is being transported), and the end point is the target handling position of the cargo. In other embodiments, if no stage division is performed, the starting point is the current position of the transport equipment, and the end point can be set based on needs. The above-mentioned starting point and end point settings can be set based on needs, and no specific limitations are made here.

[0089] S206: Perform global path planning based on the start point and the end point by using Manhattan distance as a heuristic function, and perform local path planning by using Euclidean distance as a heuristic function when a collision is determined to exist.

[0090] Specifically, combined Figure 8 and Fig. 9 As shown, Figure 8 The planned path is obtained by using Manhattan distance as the heuristic function for path planning. Fig. 9 The planned path is obtained by using the Euclidean distance as the heuristic function for path planning. Figure 8, Manhattan distance is defined based on the sum of the absolute values ​​of the horizontal and vertical coordinates. Based on this feature, a path with fewer turns can generally be obtained, but it will have the disadvantage of local detours when encountering obstacles. Fig. 9 ,Euclidean distance is defined based on the diagonal distance. According to this feature, there will generally be no local detour when encountering obstacles, but there will be more turns in path planning. Figure 8 and Fig. 9 The difference between the two heuristic functions under the same map is given. Figure 8 As can be seen from the figure, facing the same scenario, when encountering obstacles in the expansion, the Manhattan distance will lead to a higher number of turns, with extra turning margins, while Fig. 9 It can be seen that the Euclidean distance is based on the straight-line distance between two points. Between the same two points, its value must be smaller than the Manhattan distance value. Therefore, when the upper, lower, left, and right movable points of the current expansion point are detected, if there are movable points that are parallel to the displacement of the previous stage, it means that an obstacle is encountered. When this happens, the original Manhattan distance heuristic function is partially replaced with the Euclidean distance.

[0091] This application considers the advantages and disadvantages of the two distances and proposes a method of using Manhattan distance globally and using Euclidean distance when encountering obstacles.

[0092] In one of the optional embodiments, global path planning is performed based on the start point and the end point using Manhattan distance as a heuristic function, and when it is determined that there is a collision, local path planning is performed using Euclidean distance as a heuristic function, including: determining the next candidate planning node based on the start point and the end point using Manhattan distance as a heuristic function; when it is determined based on map information that the next candidate planning node is not the end point, and the next candidate planning node is an obstacle node, determining whether there is a collision based on the current planning node, the previous planning node, and the next candidate planning node; when it is determined that there is a collision, determining the next planning node based on the current planning node and the end point using Euclidean distance as a heuristic function; when it is determined that there is no collision, continuing to execute the step of determining the next candidate planning node based on the start point and the end point using Manhattan distance as a heuristic function, and determining the next planning node from the next candidate planning node; taking the next planning node as the current planning node, and determining the next candidate planning node based on the current planning node and the end point using Manhattan distance as a heuristic function, until the next candidate planning node is determined to be the end point based on the map information.

[0093] Specifically, combined Fig.10 As shown, Fig.10The present invention is a flowchart of a path planning step in an embodiment, wherein a starting point and an end point are obtained, and the next candidate planning node is determined based on the starting point and the end point by using the Manhattan distance as a heuristic function, and then it is determined whether the starting point includes four drivable directions, and one of the next candidate planning nodes corresponds to the end point. If so, the path can be directly generated, otherwise it is determined whether the next candidate planning nodes of the four drivable directions are obstacles. If there are no obstacles, the next candidate planning node is obtained, and then the next candidate planning node is determined based on the current planning node and the end point by using the Manhattan distance as a heuristic function, until the next candidate planning node is determined to be the end point based on the map information; if there is an obstacle, it is determined whether there is a collision based on the current planning node, the previous planning node and the next candidate planning node; if it is determined that there is a collision, the next planning node is determined based on the current planning node and the end point by using the Euclidean distance as a heuristic function, and the next planning node is used as the current planning node, and then the next planning node is determined based on the current planning node and the end point by using the Manhattan distance as a heuristic function, until the next candidate planning node is determined to be the end point based on the map information.

[0094] In one of the optional embodiments, determining whether there is a collision based on the current planning node, the previous planning node, and the next planning node to be selected includes: constructing a first direction vector based on the current planning node and the previous planning node; constructing a second direction vector based on the previous planning node and the next planning node to be selected; obtaining an angle between the first direction vector and the second direction vector according to the dot product of the first direction vector and the second direction vector; and determining that there is a collision when the angle between the first direction vector and the second direction vector is a preset value.

[0095] Combination Fig.11 As shown in the figure, the judgment of whether there is a collision can be obtained based on the dot product calculation, where the current planning node is point B, the next planning node to be selected is C, and the previous planning node is A. If the coordinates of point A are set to (x0, y0), point B is (x1, y1), and point C is (x2, y2). The vector of the previous direction and the current direction can be calculated based on the coordinates, that is, and but as well as The angle value can be obtained by applying the arc cosine function to the dot product

[0096] When the cosine value is 1, that is, the angle is 0°, indicating that vectors AB and BC are horizontal. At this time, the motion trajectory of the transport equipment AGV is in a vertical collision state with the obstacle, which means that the transport equipment AGV has just encountered an obstacle. At this time, the heuristic function should be changed to Euclidean distance for path planning to avoid using Manhattan distance to cause local detours. In addition, in this case, if there is a turn, there is no need to add a turning cost, because this turn is a necessary turn.

[0097] When the cosine value is 0, that is, the angle is 90°, it indicates that vector AB and vector BC are in a vertical state. At this time, the motion trajectory of the transport equipment AGV is parallel to the obstacle, which means that the transport equipment AGV is traveling horizontally along the obstacle and continues to use Manhattan distance for path planning.

[0098] The transportation equipment path planning method in the above storage system obtains the map information of the storage system; determines the starting point and the end point of the transportation equipment; performs global path planning based on the starting point and the end point by using Manhattan distance as a heuristic function, and when it is determined that there is a collision, performs local path planning by using Euclidean distance as a heuristic function. In this way, by using Manhattan distance as a heuristic function for global path planning, fewer turns can be obtained. Since Euclidean distance is defined based on diagonal distance, according to this feature, local detours generally do not occur when encountering obstacles. Therefore, when encountering obstacles, Euclidean distance can be used as a heuristic function to reduce the number of turns of the planned path as a whole.

[0099] In one of the optional embodiments, the heuristic function also includes a cost function, which includes a turning cost function and / or a collision cost function; the method also includes: when there is a turn in the path planned based on the heuristic function, obtaining a turning cost based on the turning cost function; when there is an overlap between the path planned based on the heuristic function and other paths, generating a collision cost based on the collision cost function; and extending the path of the heuristic function based on the turning cost and collision cost constraints.

[0100] The cost function in this embodiment includes a turning cost function and / or a collision cost function. Optionally, the heuristic function may include only a turning cost function, or only a collision cost function, or both a turning cost function and a collision cost function, which are not specifically limited here. The turning cost function may include an instantaneous turning cost and / or a cumulative turning cost.

[0101] In this way, when there is a turn, the instantaneous turning cost and the cumulative turning cost need to be considered; in the second case, when the paths overlap and there is a risk of collision, the cumulative number of collisions is added as the cost to the expansion point to constrain the expansion of the path point.

[0102] In one of the optional embodiments, when there is a turn in the path planned based on the heuristic function, the turning cost is obtained based on the turning cost function, including: determining the previous planning node and the next planning node to be selected of the current planning node; based on the current planning node, the previous planning node and the next planning node to be selected, determining whether the next planning node to be selected is a turning node; when the next planning node to be selected is a turning node, obtaining the turning cost based on the turning cost function.

[0103] In one of the optional embodiments, when the next planning node to be selected is a turning node, the turning cost is obtained based on a turning cost function, including: when the next planning node to be selected is a turning node, and it is determined that there is no collision based on the current planning node, the previous planning node and the next planning node to be selected, the turning cost is obtained based on the turning cost function.

[0104] Among them, when the path is extended by the heuristic function, based on the current planning node, the previous planning node and the next planning node to be selected, it is determined whether the next planning node to be selected is a turning node, and it is also necessary to determine whether there is a collision. If there is a collision, the heuristic function is changed as above. If there is no collision and it is a turning node, the turning cost needs to be calculated. The turning cost needs to be calculated in both types of heuristic functions mentioned above, so that the direction of the point set to be selected for expansion is limited in advance by adding the turning cost, and the turning cost will be adaptively adjusted according to the length of the path and the number of turns.

[0105] Optionally, the method for determining whether it is a turning point may include: taking the current planning node as an example, assuming that the current planning node is point p1, the previous planning node of p1 and its parent node are set to p0, and the next planning node to be expanded is p2, then for the points existing on the grid map, if you want to determine whether the exploration point is a turning node, you can directly compare the coordinate transformation, that is, judgment condition 1: p0.x=p1.x=p2.x does not hold and judgment condition 2: p0.y=p1.y=p2.y does not hold, then you can judge that the next planning node is a turning node. If any one of the above two judgment conditions is met, the next planning node is not a turning node.

[0106] Among them, the turning cost consists of two parts, one is the instantaneous cost of turning at the current node, and the other is the cumulative cost of turning. The instantaneous cost of turning only considers the turning cost in the local space of the current point, while the cumulative cost of turning considers the cost formed by continuous turning in the global state to avoid the formation of a jagged path.

[0107] In one of the optional embodiments, the turning cost is obtained based on the turning cost function, including: obtaining a preset first turning control weight, and obtaining the instantaneous cost of conversion based on the first turning control weight, the cost from the current planning node to the starting point, the cost from the current planning node to the end point, the cost from the previous planning node to the starting point, and the cost from the previous planning node to the end point; obtaining a preset second turning control weight, and obtaining the cumulative cost of turning based on the second turning control weight and the distance between the current planning node and the previous turning point; and obtaining the turning cost based on the instantaneous cost of turning and the cumulative cost of turning.

[0108] Among them, the instantaneous cost of turning is calculated by the cost value between the two points. Assuming that the turning point is p1 and the original path direction point is p0, the calculation formula is ω·|(p0.g+p0.h)-(p1.g+p1.h)|. By calculating the difference in the cost between the two points, the turning cost is controlled by the first turning control weight ω. According to experiments, ω=2 is a more reasonable value for the first turning control weight. However, if the path calculation strategy is more aggressive, the value of ω can be appropriately increased. Among them, p0.g is the cost from the current planning node to the starting point, p0.h is the cost from the current planning node to the end point, p1.g is the cost from the previous planning node to the starting point, and p1.h is the cost from the previous planning node to the end point.

[0109] For the cumulative cost of turning, this cost is used to avoid the connection between turning costs too quickly, resulting in a jagged path. This cost is limited by the distance between turning nodes. This cost needs to record each turning node. Assuming that the previous turning point is pt1 and the current turning point is p2, the formula is This formula describes the cost by taking the inverse of the distance between two points. The closer the distance is, the smaller the denominator is, and the greater the cost is. If the distance is farther, the larger the denominator is, the smaller the cost is. The second turn control weight η is obtained from experiments and can be controlled. The coordinates of the current planning node are (pt1.x, pt1.y), and the coordinates of the previous turning point are (p2.x, p2.y).

[0110] In one of the optional embodiments, generating a collision cost based on a collision cost function includes: determining the number of overlaps between a path planned by the heuristic function and other paths; determining a collision weight corresponding to map information; and generating a collision cost based on the collision weight and the number of overlaps.

[0111] The collision cost is also used as a soft constraint to constrain the node expansion direction. Each node has a collision count. If this extension point has an overlapping area with other paths, the number of overlaps is increased by 1. During normal expansion, the number of overlaps is also added to the total cost value as a cost. Assuming the number of overlaps is n, the collision cost is Where ξ is the collision weight.

[0112] In one of the optional embodiments, determining the collision weight corresponding to the map information includes: determining the map size based on the map information; and obtaining the collision weight corresponding to the map size, wherein the larger the map size, the greater the collision weight.

[0113] Among them, the collision weight ξ is related to the map size. If the map is large, the collision range is sparse, the number of collisions is small, and the weight ξ can be appropriately enlarged. If the map is small, the collision range is dense, the number of collisions is large, and the weight ξ is appropriately reduced.

[0114] In the above embodiment, in order to reduce the turning and maneuvering operations of the transportation equipment, we return to the planning to discuss how to reduce the turning angles, so two turning costs are introduced. At the same time, in order to improve efficiency, the collision cost is considered in advance in the underlying planning as a soft constraint to limit the planned path selection.

[0115] In one of the optional embodiments, the above method also includes: obtaining each turning node in the initial planning path obtained based on the heuristic function; obtaining a set of nodes to be optimized based on the starting point, each turning node and the end point, and sorting each node to be optimized in the set of nodes to be optimized according to the path direction of the initial planning path; determining the current node to be optimized from the set of nodes to be optimized; when the current node to be optimized is not the target node in the set of nodes to be optimized, determining the first node to be optimized and the second node to be optimized based on the current node to be optimized, wherein the first node to be optimized is the next node to be optimized of the current node to be optimized, and the second node to be optimized is the next node to be optimized of the first node to be optimized. Node to be optimized; determine the current extended node based on the current node to be optimized, the first node to be optimized and the second node to be optimized; when there are no obstacles on the extended path formed by the current node to be optimized, the current extended node and the second node to be optimized, replace the road sections corresponding to the current node to be optimized, the first node to be optimized and the second node to be optimized in the initial planned path with the extended path; add the current extended node to the set of nodes to be optimized, delete the first node to be optimized and the second node to be optimized, and continue to execute the step of determining the current node to be optimized from the set of nodes to be optimized until the current node to be optimized is the target node in the set of nodes to be optimized.

[0116] In one of the optional embodiments, the current extended node is determined based on the current node to be optimized, the first node to be optimized and the second node to be optimized, including: when a virtual rectangle is obtained based on the current node to be optimized, the first node to be optimized and the second node to be optimized, the current extended node is determined based on the corner points of the virtual rectangle.

[0117] In one of the optional embodiments, the method further includes: when no virtual rectangle is obtained based on the current node to be optimized, the first node to be optimized and the second node to be optimized, continuing to execute the step of determining the current node to be optimized from the set of nodes to be optimized until the current node to be optimized is the target node in the set of nodes to be optimized.

[0118] Combination Fig.12 and Fig.13 As shown, Fig.12 is a schematic diagram of path optimization in one embodiment, Fig.13 This is a flow chart of the path optimization step in an embodiment. In this embodiment, after obtaining the initial planned path based on the heuristic function, the initial planned path is optimized. Because the heuristic function is used, the natural path will move along the obstacles. Even if there is no collision along the original direction, this step is to correct and adjust the path with such a situation. Fig.12 In the example above, when the algorithm finds the end point, a complete path is formed, and the path completely follows the boundary of the obstacle. Fig.12 As shown, it is entirely possible to travel to the end point along a virtual path of the same length, so it is necessary to optimize the route of the initial planned path.

[0119] Specifically, each turning node in the initial planning path is obtained, as shown in the figure above, and each turning node is numbered from 0 (including the starting point and the end point). The specific method is to traverse from the starting point, starting from P0, and then select the three nodes including P1 and P2 in turn. Through these three points, the information of another corner point of the virtual rectangle can be obtained. With this corner point as the reference point, traverse whether there are obstacles on the path from P0 through this reference point to P2. If there are no obstacles, it indicates that the path extension is successful. If the extension is successful, the new extension point is recorded as P2', and then the calculation is performed based on the new P2'. Specifically, P2', P3, and P4 are obtained, a virtual rectangle is constructed, and another corner point information is obtained. It is also determined whether there are obstacles on the path from P2 through this reference point to P4. If there are obstacles, the extension fails and the next current node to be optimized is obtained. When no virtual rectangle is obtained based on the current node to be optimized, the first node to be optimized and the second node to be optimized, the step of determining the current node to be optimized from the set of nodes to be optimized is continued until the current node to be optimized is the target node in the set of nodes to be optimized.

[0120] Repeat the above steps until the end point is reached, that is, the target point is reached, that is, when the current node to be optimized is the second to last point or the first to last point (end point) in the set of nodes to be optimized, the update is completed.

[0121] In the above embodiment, by introducing the path optimization step, turns and unnecessary path introduction are reduced.

[0122] It should be understood that, although the steps in the flowcharts involved in the above embodiments are displayed in sequence according to the indication of the arrows, these steps are not necessarily executed in sequence according to the order indicated by the arrows. Unless there is a clear explanation in this article, the execution of these steps is not strictly limited in order, and these steps can be executed in other orders. Moreover, at least a part of the steps in the flowcharts involved in the above embodiments may include multiple steps or multiple stages, and these steps or stages are not necessarily executed at the same time, but can be executed at different times, and the execution order of these steps or stages is not necessarily carried out in sequence, but can be executed in turn or alternately with other steps or at least a part of the steps or stages in other steps.

[0123] Based on the same inventive concept, the embodiment of the present application also provides a storage system transportation equipment path planning device for implementing the above-mentioned storage system transportation equipment path planning method. The implementation scheme for solving the problem provided by the device is similar to the implementation scheme recorded in the above-mentioned method, so the specific limitations in the embodiments of one or more storage system transportation equipment path planning devices provided below can refer to the above-mentioned limitations on the storage system transportation equipment path planning method, and will not be repeated here.

[0124] In an exemplary embodiment, Fig.14 As shown, a transport equipment path planning device in a storage system is provided, comprising: a map information acquisition module 1401, a task determination module 1402 and a path planning module 1403, wherein:

[0125] A map information acquisition module 1401 is used to acquire map information of a storage system;

[0126] The task determination module 1402 is used to determine the starting point and the end point of the transportation equipment;

[0127] The path planning module 1403 is used to perform global path planning based on the start point and the end point by using the Manhattan distance as a heuristic function, and to perform local path planning by using the Euclidean distance as a heuristic function when a collision is determined.

[0128] In one of the optional embodiments, the above-mentioned path planning module 1403 is specifically used to determine the next candidate planning node based on the starting point and the end point by using the Manhattan distance as a heuristic function; when it is determined based on the map information that the next candidate planning node is not the end point, and the next candidate planning node is an obstacle node, determine whether there is a collision based on the current planning node, the previous planning node and the next candidate planning node; when it is determined that there is a collision, determine the next planning node based on the current planning node and the end point by using the Euclidean distance as a heuristic function; when it is determined that there is no collision, continue to execute the step of determining the next candidate planning node based on the starting point and the end point by using the Manhattan distance as a heuristic function, and determine the next planning node from the next candidate planning node; take the next planning node as the current planning node, and continue to determine the next candidate planning node based on the current planning node and the end point by using the Manhattan distance as a heuristic function, until the next candidate planning node is determined as the end point based on the map information.

[0129] In one of the optional embodiments, the above-mentioned path planning module 1403 is specifically used to construct a first direction vector based on the current planning node and the previous planning node; construct a second direction vector based on the previous planning node and the next selected planning node; obtain the angle between the first direction vector and the second direction vector according to the dot product of the first direction vector and the second direction vector; when the angle between the first direction vector and the second direction vector is a preset value, determine that there is a collision.

[0130] In one optional embodiment, the heuristic function further includes a cost function, and the cost function includes a turning cost function and / or a collision cost function; the above device further includes:

[0131] The cost calculation module is used to obtain the turning cost based on the turning cost function when there is a turn in the path planned based on the heuristic function; generate the collision cost based on the collision cost function when there is an overlap between the path planned based on the heuristic function and other paths; and extend the path based on the turning cost and collision cost constraints of the heuristic function.

[0132] In one of the optional embodiments, the above-mentioned cost calculation module is specifically used to determine the previous planning node and the next planning node to be selected of the current planning node; based on the current planning node, the previous planning node and the next planning node to be selected, determine whether the next planning node to be selected is a turning node; when the next planning node to be selected is a turning node, obtain the turning cost based on the turning cost function.

[0133] In one of the optional embodiments, the cost calculation module is specifically used to obtain the turning cost based on the turning cost function when the next planning node to be selected is a turning node and it is determined that there is no collision based on the current planning node, the previous planning node and the next planning node to be selected.

[0134] In one of the optional embodiments, the cost calculation module is specifically used to obtain a pre-set first turn control weight, and obtain the instantaneous cost of the conversion based on the first turn control weight, the cost from the current planning node to the starting point, the cost from the current planning node to the end point, the cost from the previous planning node to the starting point, and the cost from the previous planning node to the end point; obtain a pre-set second turn control weight, and obtain the cumulative cost of the turn based on the second turn control weight and the distance between the current planning node and the previous turning point; and obtain the turning cost based on the instantaneous cost of the turn and the cumulative cost of the turn.

[0135] In one of the optional embodiments, the cost calculation module is specifically used to determine the number of overlaps between the path planned by the heuristic function and other paths; determine the collision weight corresponding to the map information; and generate the collision cost based on the collision weight and the number of overlaps.

[0136] In one of the optional embodiments, the cost calculation module is specifically used to determine the map size based on the map information; and obtain the collision weight corresponding to the map size, wherein the larger the map size, the greater the collision weight.

[0137] In one of the optional embodiments, the above-mentioned device also includes: a path optimization module, which is used to obtain each turning node in the initial planned path obtained based on the heuristic function; obtain a set of nodes to be optimized based on the starting point, each turning node and the end point, and each node to be optimized in the set of nodes to be optimized is sorted according to the path direction of the initial planned path; determine the current node to be optimized from the set of nodes to be optimized; when the current node to be optimized is not the target node in the set of nodes to be optimized, determine the first node to be optimized and the second node to be optimized based on the current node to be optimized, wherein the first node to be optimized is the next node to be optimized of the current node to be optimized, and the second node to be optimized is the next node to be optimized of the first node to be optimized The next node to be optimized of the node; based on the current node to be optimized, the first node to be optimized and the second node to be optimized, determine the current extended node; when there are no obstacles on the extended path formed by the current node to be optimized, the current extended node and the second node to be optimized, replace the road sections corresponding to the current node to be optimized, the first node to be optimized and the second node to be optimized in the initial planned path with the extended path; add the current extended node to the set of nodes to be optimized, delete the first node to be optimized and the second node to be optimized, and continue to execute the step of determining the current node to be optimized from the set of nodes to be optimized until the current node to be optimized is the target node in the set of nodes to be optimized.

[0138] In one of the optional embodiments, the path optimization module is specifically used to determine the current expansion node based on the corner points of the virtual rectangle when a virtual rectangle is obtained based on the current node to be optimized, the first node to be optimized and the second node to be optimized.

[0139] In one of the optional embodiments, the above-mentioned path optimization module is specifically used to continue executing the step of determining the current node to be optimized from the set of nodes to be optimized when no virtual rectangle is obtained based on the current node to be optimized, the first node to be optimized and the second node to be optimized, until the current node to be optimized is the target node in the set of nodes to be optimized.

[0140] Each module in the transportation equipment path planning device in the above storage system can be implemented in whole or in part by software, hardware, or a combination thereof. Each module can be embedded in or independent of a processor in a computer device in the form of hardware, or can be stored in a memory in a computer device in the form of software, so that the processor can call and execute operations corresponding to each module.

[0141] In an exemplary embodiment, a computer device is provided. The computer device may be a terminal, and its internal structure diagram may be as shown in FIG. Fig.15 As shown. The computer device includes a processor, a memory, an input / output interface, a communication interface, a display unit and an input device. The processor, the memory and the input / output interface are connected via a system bus, and the communication interface, the display unit and the input device are connected to the system bus via the input / output interface. The processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The input / output interface of the computer device is used to exchange information between the processor and an external device. The communication interface of the computer device is used to communicate with an external terminal in a wired or wireless manner, and the wireless manner can be implemented through WIFI, a mobile cellular network, near field communication (NFC) or other technologies. When the computer program is executed by the processor, a method for transport equipment path planning in a storage system is implemented. The display unit of the computer device is used to form a visually visible picture, which can be a display screen, a projection device or a virtual reality imaging device. The display screen can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer device can be a touch layer covering the display screen, or a button, trackball or touchpad set on the computer device shell, or an external keyboard, touchpad or mouse.

[0142] Those skilled in the art will understand that Fig.15The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.

[0143] In one embodiment, a computer device is further provided, including a memory and a processor, wherein a computer program is stored in the memory, and the processor implements the steps in the above method embodiments when executing the computer program.

[0144] In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the steps in the above-mentioned method embodiments are implemented.

[0145] In one embodiment, a computer program product is provided, including a computer program, which implements the steps in the above method embodiments when executed by a processor.

[0146] Those of ordinary skill in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to the memory, database or other medium used in the embodiments provided in the present application can include at least one of non-volatile memory and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. As an illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM). The database involved in each embodiment provided in this application may include at least one of a relational database and a non-relational database. Non-relational databases may include distributed databases based on blockchains, etc., but are not limited to this. The processor involved in each embodiment provided in this application may be a general-purpose processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic device, a data processing logic device based on quantum computing, an artificial intelligence (AI) processor, etc., but are not limited to this.

[0147] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this application.

[0148] The above-described embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the present application. It should be pointed out that, for a person of ordinary skill in the art, several variations and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the attached claims.

Claims

1. A method for transport equipment path planning in a storage system, characterized in that: The method comprises: Get map information of storage system; Determine the starting and ending points of transport equipment; Global path planning is performed based on the start point and the end point by using Manhattan distance as a heuristic function, and when it is determined that there is a collision, local path planning is performed by using Euclidean distance as a heuristic function.

2. The method according to claim 1, characterized in that The global path planning is performed based on the starting point and the end point by using Manhattan distance as a heuristic function, and when it is determined that there is a collision, the local path planning is performed by using Euclidean distance as a heuristic function, including: Determine the next candidate planning node based on the starting point and the end point by using Manhattan distance as a heuristic function; In the case where it is determined based on the map information that the next node to be selected for planning is not the end point, and the next node to be selected for planning is an obstacle node, determining whether there is a collision based on the current planning node, the previous planning node, and the next node to be selected for planning; In the case of determining that there is a collision, determining the next planning node based on the current planning node and the end point by using the Euclidean distance as a heuristic function; If it is determined that there is no collision, continue to perform the step of determining the next candidate planning node based on the starting point and the end point by using Manhattan distance as a heuristic function, and determine the next planning node from the next candidate planning node; The next planning node is used as the current planning node, and the next candidate planning node is determined based on the current planning node and the end point by continuing to use Manhattan distance as a heuristic function, until the next candidate planning node is determined to be the end point based on the map information.

3. The method according to claim 2, characterized in that The determining whether there is a collision based on the current planning node, the previous planning node, and the next planning node to be selected includes: Constructing a first direction vector based on the current planning node and the previous planning node; Constructing a second direction vector based on the previous planning node and the next planning node to be selected; Obtaining an angle between the first direction vector and the second direction vector according to a dot product of the first direction vector and the second direction vector; When the angle between the first direction vector and the second direction vector is a preset value, it is determined that a collision exists.

4. The method according to any one of claims 1 to 3, characterized in that: The heuristic function further includes a cost function, and the cost function includes a turning cost function and / or a collision cost function; the method further includes: When there is a turn in the path planned based on the heuristic function, obtaining a turn cost based on the turn cost function; In the case where the path planned based on the heuristic function overlaps with other paths, generating a collision cost based on the collision cost function; A path extension of the heuristic function is constrained based on the turn cost and the collision cost.

5. The method according to claim 4, characterized in that The step of obtaining a turning cost based on the turning cost function when the path planned based on the heuristic function has a turning includes: Determine the previous planning node of the current planning node and the next planning node to be selected; Based on the current planning node, the previous planning node and the next planning node to be selected, determining whether the next planning node to be selected is a turning node; When the next planning node to be selected is a turning node, a turning cost is obtained based on the turning cost function.

6. The method according to claim 5, characterized in that When the next to-be-selected planning node is a turning node, obtaining the turning cost based on the turning cost function includes: When the next planning node to be selected is a turning node and it is determined that there is no collision based on the current planning node, the previous planning node and the next planning node to be selected, a turning cost is obtained based on the turning cost function.

7. The method according to claim 5, characterized in that The obtaining the turning cost based on the turning cost function includes: Obtaining a preset first turn control weight, and obtaining a conversion instantaneous cost based on the first turn control weight, the cost from the current planning node to the starting point, the cost from the current planning node to the end point, the cost from the previous planning node to the starting point, and the cost from the previous planning node to the end point; Obtaining a preset second turn control weight, and obtaining a cumulative turn cost based on the second turn control weight and the distance between the current planning node and the previous turning point; The turning cost is obtained based on the instantaneous turning cost and the cumulative turning cost.

8. The method according to claim 4, characterized in that The generating a collision cost based on the collision cost function comprises: Determine the number of overlaps between the path planned by the heuristic function and other paths; determining a collision weight corresponding to the map information; A collision cost is generated based on the collision weight and the number of overlaps.

9. The method according to claim 8, characterized in that The determining of the collision weight corresponding to the map information includes: determining a map size based on the map information; A collision weight corresponding to the map size is obtained, wherein the larger the map size is, the larger the collision weight is.

10. The method according to any one of claims 1 to 3, characterized in that: The method further comprises: Obtain each turning node in the initial planning path based on the heuristic function; A set of nodes to be optimized is obtained based on the starting point, each of the turning nodes and the end point, and each of the nodes to be optimized in the set of nodes to be optimized is sorted according to the path direction of the initial planned path; Determine a current node to be optimized from the set of nodes to be optimized; In the case that the current node to be optimized is not a target node in the set of nodes to be optimized, determining a first node to be optimized and a second node to be optimized based on the current node to be optimized, wherein the first node to be optimized is the next node to be optimized of the current node to be optimized, and the second node to be optimized is the next node to be optimized of the first node to be optimized; Determine a current extended node based on the current node to be optimized, the first node to be optimized, and the second node to be optimized; In the case where there are no obstacles on the extended path formed by the current node to be optimized, the current extended node and the second node to be optimized, replacing the road sections corresponding to the current node to be optimized, the first node to be optimized and the second node to be optimized in the initial planned path with the extended path; The current extended node is added to the set of nodes to be optimized, and the first node to be optimized and the second node to be optimized are deleted, and the step of determining the current node to be optimized from the set of nodes to be optimized is continued until the current node to be optimized is the target node in the set of nodes to be optimized.

11. The method according to claim 10, characterized in that The determining the current extended node based on the current node to be optimized, the first node to be optimized, and the second node to be optimized includes: When a virtual rectangle is obtained based on the current node to be optimized, the first node to be optimized, and the second node to be optimized, a current expansion node is determined based on corner points of the virtual rectangle.

12. The method according to claim 10, characterized in that The method further comprises: When no virtual rectangle is obtained based on the current node to be optimized, the first node to be optimized and the second node to be optimized, the step of determining the current node to be optimized from the set of nodes to be optimized is continued until the current node to be optimized is the target node in the set of nodes to be optimized.

13. A transport equipment path planning device in a storage system, characterized in that: The device comprises: A map information acquisition module, used to acquire map information from a storage system; A task determination module is used to determine the starting point and end point of the transportation equipment; The path planning module is used to perform global path planning based on the starting point and the end point by using Manhattan distance as a heuristic function, and to perform local path planning by using Euclidean distance as a heuristic function when a collision is determined.

14. A computer device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 12 are implemented.

15. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 12 are implemented.

16. A computer program product comprising a computer program, characterized in that When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 12 are implemented.

Citation Information

Patent Citations

  • Unmanned aerial vehicle independent pathfinding obstacle avoiding method and system

    CN108444482A

  • Path planning method and device, electronic equipment and readable storage medium

    CN115540866A

  • Robot dynamic obstacle avoidance method based on improved A* algorithm and dynamic window method

    CN116734877A

  • Mobile robot path planning method based on improved A-star algorithm

    CN117367449A

  • Improved A-star algorithm based on heuristic function optimization and third-order Bezier curve optimization

    CN117804481A