Workshop logistics path planning method, system, equipment, medium and program product
By rapidly expanding the random tree algorithm and dynamic path heuristic search algorithm, dynamically adjusting the target sampling rate and step size, the independent path planning of workshop logistics AGV in a dynamic environment is realized, and the rigid path planning and inconvenient obstacle handling in traditional methods are solved. The problem of this paper improves the efficiency and space utilization of the logistics system.
Patent Information
- Application Number
- CN202411172855.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-26
- Publication Date
- 2024-12-03
AI Technical Summary
The traditional AGV path planning method of workshop logistics cannot effectively plan paths in a dynamic environment, resulting in low space utilization, low efficiency, difficulty in dealing with obstacle changes, and inability to achieve real-time route adjustment.
The fast-scaling random tree algorithm (RRT) and dynamic path heuristic search algorithm are adopted to dynamically adjust the target sampling rate and step size, and feasible paths are generated and expanded into feasible areas to realize the autonomous path planning of AGV in a dynamic environment.
It improves the efficiency and space utilization of workshop logistics path planning, enhances production efficiency, and can quickly re-plan the path when encountering obstacles, avoiding the limitations of traditional grid paths.
Smart Images

Figure CN119063731A_ABST
Abstract
Description
Technical Field
[0001] The embodiments of the present application relate to the field of path planning technology, and in particular, to a workshop logistics path planning method, system, equipment, medium and program product. Background Art
[0002] Traditional workshop logistics automated guided vehicle (AGV) path planning usually uses the A* heuristic search algorithm (A-star Search Algorithm, A* algorithm). However, the A* algorithm can usually only follow fixed grid lines, has low space utilization, and cannot be applied in dynamic environments.
[0003] As the demand for personalized customization in workshops continues to increase, the requirements for logistics efficiency are also constantly improving. When planning the path, AGV must not only consider the conflict with other AGVs, but also consider pedestrians in the workshop. Therefore, the path planning problem of AGV cannot be limited to fixed grid lines. Therefore, the solution to the path planning problem of AGV in workshop logistics needs to be transformed from the original AGV path planning based on the pre-set A* to the current multi-AGV that can autonomously plan the path to resolve the conflict between AGVs and find the optimal path. When encountering obstacles, the path can be replanned.
[0004] In the face of the above-mentioned workshop AGV logistics, which can be applied to autonomous path planning in dynamic environments to solve the problem of AGV conflicts, a feasible research plan needs to be formed. The traditional solution for solving the problem of conflicts between AGVs in workshop AGV logistics scheduling is planned in advance and cannot be changed. In addition, the path can only be planned within the grid line, which limits the efficiency of AGV. Therefore, when there are changes in orders or production disturbances in the workshop, it is difficult to respond in time, resulting in frequent occurrence of "plans cannot keep up with changes". When the AGV encounters obstacles such as pedestrians while driving, it cannot plan a new route in real time, which greatly affects the efficiency of the workshop logistics system.
[0005] In general, although there are a lot of studies on the problem of AGV path planning in workshop logistics, there are often the following shortcomings:
[0006] (1) The driving area of the AGV in the logistics workshop is merged from the original grid into a rectangular area as a grid route. The AGV is constrained by "rules and regulations" when planning the path, and cannot give full play to the utilization rate of the logistics space;
[0007] (2) When changes occur in workshop logistics demand, traditional AGVs have poor re-routing capabilities;
[0008] (3) The traditional workshop AGV path planning algorithm can only be used in static environments. When there are moving obstacles in the workshop, the original path planning algorithm cannot be used. It cannot be used in environments with dynamic obstacles. Summary of the invention
[0009] The embodiments of the present application provide a workshop logistics path planning method, system, device, medium and program product to solve the problem that the existing workshop logistics planning is rigid and cannot re-plan the route according to obstacles.
[0010] In order to solve the above technical problems, this application is implemented as follows:
[0011] In a first aspect, an embodiment of the present application provides a workshop logistics path planning method, including:
[0012] Determine the obstacle information in the current workshop environment;
[0013] Determining a target sampling rate of a rapidly expanding random tree algorithm according to the obstacle information;
[0014] Based on the fast expanding random tree algorithm, iterative sampling is performed to generate multiple path nodes;
[0015] Determining a feasible path based on the multiple path nodes;
[0016] Expanding the feasible path into a feasible region;
[0017] Starting from the path target point, within the feasible area, path planning is performed based on a dynamic path heuristic search algorithm to generate a path planning result;
[0018] In each sampling process, the path nodes are generated based on the following steps:
[0019] Based on the target sampling rate, determining the random point position of each sampling;
[0020] Based on the position of the random point, determining the new node and the nearest point closest to the random point;
[0021] Adjust the step size of this sampling based on the distance from the line connecting the new node and the nearest point to the path target point;
[0022] Based on the adjusted step size, a new node for this sampling is regenerated as the path node generated for this sampling.
[0023] Optionally, determining a target sampling rate of a fast expanding random tree algorithm according to the obstacle information includes:
[0024] Connect the starting point and the target point to obtain a first line segment;
[0025] Determine the ratio of the overlapped length of the obstacle and the first line segment to the length of the first line segment;
[0026] The target sampling rate is determined based on the ratio.
[0027] Optionally, determining the random point position of each sampling based on the target sampling rate includes:
[0028] Randomly generate a random number in the interval (0,1);
[0029] If the random number is greater than or equal to the target sampling rate, the position of the path target point is used as the position of the random point;
[0030] If the random number is less than the target sampling rate, the position of the random point is randomly generated.
[0031] Optionally, determining the new node and the nearest point closest to the random point based on the position of the random point includes:
[0032] Based on the fast expanding random tree algorithm, taking the node closest to the random point as the closest point;
[0033] The target step length is moved from the nearest point toward the random point to determine the new node, wherein the target step length is the step length adjusted after the last sampling.
[0034] Optionally, the determining of the new node and the nearest point closest to the random point based on the position of the random point further includes:
[0035] If the new node is inside the obstacle, discard the new node and re-determine the new node;
[0036] If the new node is not inside the obstacle, connect the new node and the nearest point.
[0037] Optionally, adjust the step size of this sampling based on the following formula:
[0038]
[0039] Among them, step′ is the step length before adjustment; step is the step length after adjustment; d i is the distance from the line connecting the new node and the nearest point to the target point of the path.
[0040] In a second aspect, an embodiment of the present application provides a workshop logistics path planning system, including:
[0041] Map module, used to determine obstacle information in the current workshop environment;
[0042] A sampling rate module, used to determine a target sampling rate of a fast expanding random tree algorithm according to the obstacle information;
[0043] A sampling module, used for performing iterative sampling based on the fast expanding random tree algorithm to generate multiple path nodes;
[0044] A path module, used for determining a feasible path based on the plurality of path nodes;
[0045] A region module, used for expanding the feasible path into a feasible region;
[0046] An output module is used to start from the path target point and perform path planning in the feasible area based on a dynamic path heuristic search algorithm to generate a path planning result;
[0047] In each sampling process, the path nodes are generated based on the following steps:
[0048] Based on the target sampling rate, determining the random point position of each sampling;
[0049] Based on the position of the random point, determining the new node and the nearest point closest to the random point;
[0050] Adjust the step size of this sampling based on the distance from the line connecting the new node and the nearest point to the path target point;
[0051] Based on the adjusted step size, a new node for this sampling is regenerated as the path node generated for this sampling.
[0052] In a third aspect, an embodiment of the present application provides an electronic device, comprising: a processor, a memory, and a program stored on the memory and executable on the processor, wherein when the program is executed by the processor, the steps of the workshop logistics path planning method described in the first aspect above are implemented.
[0053] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, the steps of the workshop logistics path planning method described in the first aspect above are implemented.
[0054] In a fifth aspect, a computer program product is provided, comprising computer instructions, which, when executed by a processor, implement the steps of the workshop logistics path planning method as described in the first aspect above.
[0055] The present application can dynamically adjust the target sampling rate based on obstacle information, and can adjust the step size of each sampling. By automatically adjusting the target sampling rate and step size, the purpose of improving the RRT algorithm is achieved, so that when encountering different obstacles, the advantage of the RRT algorithm for fast path search can be utilized to achieve the purpose of fast path replanning. Furthermore, the feasible path obtained by planning the improved RRT algorithm based on the present application is expanded into a feasible area, and the feasible area is used as the basis for new path planning using the D* algorithm. On the basis of the above effects, the optimal solution within the feasible area can also be obtained, breaking away from the shackles of traditional grid-type paths, and directly using the overall environmental area as the route range for path planning, giving full play to the utilization rate of logistics space, and on the basis of improving the efficiency of workshop logistics path planning, it can also improve transportation efficiency, thereby enhancing the production efficiency of the workshop. BRIEF DESCRIPTION OF THE DRAWINGS
[0056] Various other advantages and benefits will become apparent to those of ordinary skill in the art by reading the detailed description of the preferred embodiments below. The accompanying drawings are only for the purpose of illustrating the preferred embodiments and are not to be considered as limiting the present application. Also, the same reference symbols are used throughout the accompanying drawings to represent the same components. In the accompanying drawings:
[0057] Figure 1 It is a flow chart of a workshop logistics path planning method provided by an embodiment of the present application;
[0058] Figure 2 This is a planning method effect diagram provided by an embodiment of the present application;
[0059] Figure 3 It is a structural schematic diagram of a workshop logistics path planning system provided by an embodiment of the present application;
[0060] Figure 4 It is a structural schematic diagram of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION
[0061] The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.
[0062] Please refer to Figure 1 , the embodiment of the present application provides a workshop logistics path planning method, including:
[0063] Step 11: Determine obstacle information in the current environment of the workshop;
[0064] Step 12: Determine a target sampling rate of a Rapidly-exploring Random Tree (RRT) algorithm based on the obstacle information;
[0065] Step 13: Based on the fast expanding random tree algorithm, iterative sampling is performed to generate multiple path nodes;
[0066] Optionally, in the embodiment of the present application, the comprehensiveness and depth of the search are increased through multiple iterations, so as to find a feasible path from the starting point to the path target point.
[0067] Step 14: Determine a feasible path based on the multiple path nodes;
[0068] Step 15: Expand the feasible path into a feasible area;
[0069] Optionally, the feasible path is expanded to the surrounding area to form a feasible area path; the expansion can be performed by expanding the path so that a certain range around the path is also regarded as a feasible area, and the specific method is not limited in this application.
[0070] Step 16: Starting from the path target point, within the feasible area, path planning is performed based on a dynamic path heuristic search algorithm to generate a path planning result;
[0071] In each sampling process, the path nodes are generated based on the following steps:
[0072] Based on the target sampling rate, determining the random point position of each sampling;
[0073] Based on the position of the random point, determining the new node and the nearest point closest to the random point;
[0074] Adjust the step size of this sampling based on the distance from the line connecting the new node and the nearest point to the path target point;
[0075] Based on the adjusted step size, a new node for this sampling is regenerated as the path node generated for this sampling.
[0076] In the present application, obstacle information in the current environment of the workshop is determined; based on the obstacle information, a target sampling rate of a rapidly expanding random tree algorithm is determined; based on the rapidly expanding random tree algorithm, iterative sampling is performed to generate multiple path nodes; based on the multiple path nodes, a feasible path is determined; the feasible path is expanded into a feasible area; starting from the path target point, path planning is performed based on a dynamic path heuristic search algorithm within the feasible area to generate a path planning result; wherein, in each sampling process, the path node is generated based on the following steps: based on the target sampling rate, the position of the random point of each sampling is determined; based on the position of the random point, a new node and the nearest point closest to the random point are determined; based on the distance from the new node and the nearest point to the path target point, the step size of this sampling is adjusted; based on the adjusted step size, a new node of this sampling is regenerated as the path node generated by this sampling. The present application can dynamically adjust the target sampling rate based on obstacle information, and can adjust the step size of each sampling. By automatically adjusting the target sampling rate and step size, the purpose of improving the RRT algorithm is achieved, so that when encountering different obstacles, the advantage of the RRT algorithm for fast path search can be utilized to achieve the purpose of fast path replanning. Furthermore, the feasible path obtained by planning the improved RRT algorithm based on the present application is expanded into a feasible area, and the feasible area is used as the basis for new path planning using the D* algorithm. On the basis of the above effects, the optimal solution within the feasible area can also be obtained, breaking away from the shackles of traditional grid-type paths, and directly using the overall environmental area as the route range for path planning, giving full play to the utilization rate of logistics space, and on the basis of improving the efficiency of workshop logistics path planning, it can also improve transportation efficiency, thereby enhancing the production efficiency of the workshop.
[0077] Furthermore, each step in the above embodiment can be executed by each independent AGV, that is, for each individual AGV, its driving area is merged from the original grid into a rectangular area, and the AGV can be more "free" in path planning and is not constrained by "rules and regulations". Each AGV is an "intelligent agent". Each intelligent agent can independently plan the route to avoid conflicts between AGVs. When the logistics demand in the workshop changes, each intelligent agent can independently plan the route at any time to find the best route. When encountering obstacles, each intelligent agent can also re-plan the route, so that each intelligent agent can find the best route while resolving path conflicts.
[0078] Optionally, determining a target sampling rate of a fast expanding random tree algorithm according to the obstacle information includes:
[0079] Connect the starting point and the target point to obtain a first line segment;
[0080] Determine the ratio of the length of the obstacle overlapping the first line segment to the first line segment;
[0081] The target sampling rate is determined based on the ratio.
[0082] Optionally, set the starting point X init and the target point X goal The ratio of the length obs of the obstacle overlapping the first line segment to the length of the first line segment is: obs / L. When the obstacle changes, the ratio can be re-determined according to the above formula. Further, the sampling rate S of the target node of the adaptive environment g It can be determined according to the following formula:
[0083] S g =(1-obs / L).
[0084] In an embodiment of the present application, the target sampling rate of the RRT algorithm is adaptively set according to the position and size of obstacles in the sampling environment, and then the random point position of each sampling is determined based on the above target sampling rate.
[0085] Optionally, determining the random point position of each sampling based on the target sampling rate includes:
[0086] Randomly generate a random number in the interval (0,1);
[0087] If the random number is greater than or equal to the target sampling rate, the position of the path target point is used as the position of the random point;
[0088] If the random number is less than the target sampling rate, the position of the random point is randomly generated.
[0089] Optionally, before generating a new node, you need to generate a new random point P new ; Random point P new The sampling positions satisfy the following relationship:
[0090]
[0091] Among them, S is a random number generated randomly in the interval (0,1); S g is the sampling rate of the node points; P goal is the path target point; P rand are randomly generated points.
[0092] Optionally, based on the above-mentioned dynamically adjustable target sampling rate, the determined random point position still selects the path target point as the random point with a certain probability. The above-mentioned embodiment can improve the path planning accuracy and obstacle avoidance ability of the algorithm in complex environments, accelerate the search process, thereby achieving more efficient and robust path planning, and maintain a comprehensive exploration of the search space through moderate random sampling, which helps to avoid falling into local optimality and ensure that a better feasible path is found.
[0093] Optionally, determining the new node and the nearest point closest to the random point based on the position of the random point includes:
[0094] Based on the fast expanding random tree algorithm, taking the node closest to the random point as the closest point;
[0095] The target step length is moved from the nearest point toward the random point to determine the new node, wherein the target step length is the step length adjusted after the last sampling.
[0096] Optionally, through the embodiment of the present application, the node closest to the new sampling point among the existing nodes is selected to provide a basis for the next expansion direction. And further, the search space is gradually covered by progressive extension to construct a path. And the target step size of the new node is determined to be the step size adjusted after the last sampling. Through the embodiment of the present application, it is possible to dynamically adapt to environmental changes, improve the efficiency and accuracy of path search, avoid collisions that may be caused by large step size, and improve the flexibility and stability of path planning.
[0097] Optionally, the determining of the new node and the nearest point closest to the random point based on the position of the random point further includes:
[0098] If the new node is inside the obstacle, discard the new node and re-determine the new node;
[0099] If the new node is not inside the obstacle, connect the new node and the nearest point.
[0100] Optionally, to ensure that the generated path is feasible and to avoid generating illegal paths that pass through obstacles, the embodiments of the present application discard nodes inside the obstacles and re-determine new nodes to ensure that each node generated during the path expansion process is valid and safe, avoid collisions, and improve the robustness and feasibility of path planning.
[0101] Optionally, adjust the step size of this sampling based on the following formula:
[0102]
[0103] Among them, step′ is the step length before adjustment; step is the step length after adjustment; di is the distance from the line connecting the new node and the nearest point to the target point of the path.
[0104] Optionally, in each sampling process, the generated new node X_new is connected to the random point X_nearest, and the generated straight line is L i , L i The linear formula is AX+BY+C=0, calculate L i and the target point X goal The formula for the distance is:
[0105]
[0106] Among them, A, B and C are constants.
[0107] From the above step size adjustment formula, we can know that d i For X goal To the straight line L i The smaller the distance, the closer the new expansion direction of the improved RRT algorithm is to the target point. For example, when d = 0, X init , X_nearest, X goal The three points are in a straight line, indicating that the RRT expansion direction is completely towards the target node. i The smaller the value, the closer the expansion direction is to the target point, the larger the step size is, and the fewer the number of iterations is. This reduces the number of invalid iterations.
[0108] After the feasible path is generated according to the above embodiment, the feasible path is expanded from a line to a "belt" to form a feasible region V.
[0109] Optionally, starting from the path target point, within the feasible area V, performing path planning based on a dynamic path heuristic search algorithm to generate a path planning result includes:
[0110] Use the D* algorithm to plan the path in the feasible region V, and treat the feasible region V as the map of the D* algorithm path planning. Specifically:
[0111] Initialization phase: Set the starting point, target point and map information, add the target point to the open list, set its cost to zero, and set the cost of the starting point to infinity.
[0112] Main loop stage: Select the node with the lowest cost from the open set as the current node and remove it.
[0113] Node expansion phase: Update the neighbor nodes of the current node, including calculating the cost and priority of the neighbor nodes. If the cost of a neighbor node is reduced by the current node, these nodes are added back to the open set.
[0114] Detection and change processing phase: If a new obstacle is detected or an existing obstacle is removed, the cost value of the affected area is updated accordingly.
[0115] Repair path phase: Make local adjustments in the affected area, redefine the feasible path from the starting point to the target point, and add the affected nodes to the open set for processing if necessary.
[0116] Path backtracking and generation phase: When the end point (the cost change of the starting point is completed) is added to the closed set, the path is generated by backtracking the parent node record link from the starting point to the end point.
[0117] Real-time tracking and updating phase: Track the generated path and continuously monitor environmental changes. When environmental changes are detected, the process of updating the affected area and node costs is repeated.
[0118] Through the above steps, efficient dynamic path planning can be further achieved based on the feasible area generated by the above RRT.
[0119] Furthermore, the diversity and functions in the above steps are explained:
[0120] The nodes in the N table are the nodes that are being traversed. The nodes that have not been traversed are placed in the CLOSED table, and the nodes that have been traversed are placed in the NEW table.
[0121] The cost function h(G,X) is used to represent the path cost from point X to point G. The function with the smallest h(G,X) in the OPEN list is represented by the key function K(G,X), and the relationship is K(G,X)=min(h(G,X)).
[0122] The key function K(G,X) divides the nodes in the OPEN table into two categories, namely RAISE nodes and LOWER nodes. RAISE nodes indicate that the propagation cost of nodes in the environment has increased, that is, obstacles have appeared, and LOWER nodes indicate that the propagation cost of nodes in the environment has decreased, that is, the original obstacles of the node have been removed. The robot can pass through the node. The judgment conditions for RAISE nodes and LOWER nodes are as follows:
[0123]
[0124] The nodes in the OPEN list are sorted according to the key function K(G,X), where K min is the minimum value in the OPEN list, when the path cost is less than or equal to K min When is the optimal path, K old This is the key function removed from the last OPEN list.
[0125] In the D* algorithm, the PROCESS-STATE function is responsible for finding the optimal path, and the MODIFY-COST algorithm is responsible for changing the cost function. That is, when a moving obstacle appears in the environment, the MODIFY-COST algorithm function can update the path cost of the nodes in the environment in real time, making it easier for the PROCESS-STATE function to find the optimal path more accurately.
[0126] Please refer to Figure 2 It is the path planning result obtained based on the above embodiment of the present application. It can be seen that the workshop logistics system path planning method based on the fusion of the improved RRT algorithm and the D* algorithm in the above embodiment is of great significance to the improvement of the efficiency of the workshop logistics system:
[0127] (1) The AGV can autonomously plan its path in response to changes in workshop logistics needs, expand the AGV's driving area, and improve the utilization of the workshop's logistics space.
[0128] (2) Through the autonomous path planning algorithm of each agent, the problem of path conflicts between agents can be resolved.
[0129] (3) The various embodiments of the present application can be applied to scenarios with dynamic obstacles. When moving obstacles appear in the workshop, each intelligent agent can re-plan a new route according to the situation.
[0130] Through the above embodiments, it is possible to improve the transportation efficiency while improving the efficiency of workshop logistics path planning, thereby enhancing the production efficiency of the workshop.
[0131] Please refer to Figure 3 The embodiment of the present application further provides a workshop logistics path planning system 20, including:
[0132] Map module 21, used to determine obstacle information in the current environment of the workshop;
[0133] A sampling rate module 22, used to determine a target sampling rate of a fast expanding random tree algorithm according to the obstacle information;
[0134] A sampling module 23, used for performing iterative sampling based on the fast expanding random tree algorithm to generate multiple path nodes;
[0135] A path module 24, configured to determine a feasible path based on the plurality of path nodes;
[0136] An area module 25, used to expand the feasible path into a feasible area;
[0137] An output module 26 is used to perform path planning based on a dynamic path heuristic search algorithm in the feasible area starting from the path target point and generate a path planning result;
[0138] In each sampling process, the path nodes are generated based on the following steps:
[0139] Based on the target sampling rate, determining the random point position of each sampling;
[0140] Based on the position of the random point, determining the new node and the nearest point closest to the random point;
[0141] Adjust the step size of this sampling based on the distance from the line connecting the new node and the nearest point to the path target point;
[0142] Based on the adjusted step size, a new node for this sampling is regenerated as the path node generated for this sampling.
[0143] In the embodiment of the present application, optionally, the sampling rate module 22 includes:
[0144] Connect the starting point and the target point to obtain a first line segment;
[0145] Determine the ratio of the overlapped length of the obstacle and the first line segment to the length of the first line segment;
[0146] The target sampling rate is determined based on the ratio.
[0147] In the embodiment of the present application, optionally, determining the random point position of each sampling based on the target sampling rate includes:
[0148] Randomly generate a random number in the interval (0,1);
[0149] If the random number is greater than or equal to the target sampling rate, the position of the path target point is used as the position of the random point;
[0150] If the random number is less than the target sampling rate, the position of the random point is randomly generated.
[0151] In the embodiment of the present application, optionally, determining the new node and the nearest point closest to the random point based on the position of the random point includes:
[0152] Based on the fast expanding random tree algorithm, taking the node closest to the random point as the closest point;
[0153] The target step length is moved from the nearest point toward the random point to determine the new node, wherein the target step length is the step length adjusted after the last sampling.
[0154] In the embodiment of the present application, optionally, the determining of the new node and the nearest point closest to the random point based on the position of the random point further includes:
[0155] If the new node is inside the obstacle, discard the new node and re-determine the new node;
[0156] If the new node is not inside the obstacle, connect the new node and the nearest point.
[0157] In the embodiment of the present application, optionally, the step size of this sampling is adjusted based on the following formula:
[0158]
[0159] Among them, step′ is the step length before adjustment; step is the step length after adjustment; d i is the distance from the line connecting the new node and the nearest point to the target point of the path.
[0160] The workshop logistics path planning system 20 provided in the embodiment of the present application can implement each process implemented by the method embodiment of the figure and achieve the same technical effect. To avoid repetition, it will not be repeated here.
[0161] The present application embodiment provides an electronic device 30, see Figure 4 As shown, Figure 4 This is a principle block diagram of an electronic device 30 of an embodiment of the present application, including a processor 31, a memory 32, and a program or instruction stored in the memory 32 and executable on the processor 31. When the program or instruction is executed by the processor, the steps in any workshop logistics path planning method of the present application are implemented.
[0162] An embodiment of the present application provides a readable storage medium, on which programs or instructions are stored. When the programs or instructions are executed by a processor, the various processes of an embodiment of a workshop logistics path planning method such as any of the above-mentioned items are implemented, and the same technical effect can be achieved. To avoid repetition, they will not be repeated here.
[0163] Computer readable media include permanent and non-permanent, removable and non-removable media, and can be implemented by any method or technology to store information. Information can be computer readable instructions, data structures, program modules or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, compact disk read-only memory (CD-ROM), digital versatile disk (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices or any other non-transmission media that can be used to store information that can be accessed by a computing device. As defined herein, computer readable media does not include temporary computer readable media (transitory media), such as modulated data signals and carrier waves.
[0164] The present application also provides a computer program product, including computer instructions, which, when executed by a processor, implement the above Figure 1 The various processes of any of the workshop logistics path planning method embodiments shown can achieve the same technical effect and will not be repeated here to avoid repetition.
[0165] It should be noted that, in this article, the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, an element defined by the sentence "comprises a ..." does not exclude the existence of other identical elements in the process, method, article or device including the element.
[0166] The serial numbers of the above-mentioned embodiments of the present application are for description only and do not represent the advantages or disadvantages of the embodiments.
[0167] Through the description of the above implementation methods, those skilled in the art can clearly understand that the above-mentioned embodiment methods can be implemented by means of software plus a necessary general hardware platform, and of course by hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art, can be embodied in the form of a software product, which is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk), and includes a number of instructions for enabling a service classification device (which can be a mobile phone, computer, server, air conditioner, or network device, etc.) to execute the methods described in each embodiment of the present application.
[0168] The above is only a preferred implementation of the present application. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principles of the present application. These improvements and modifications should also be regarded as the scope of protection of the present application.
Claims
1. A workshop logistics path planning method, characterized in that: include: Determine the obstacle information in the current workshop environment; Determining a target sampling rate of a rapidly expanding random tree algorithm according to the obstacle information; Based on the fast expanding random tree algorithm, iterative sampling is performed to generate multiple path nodes; Determining a feasible path based on the multiple path nodes; Expanding the feasible path into a feasible region; Starting from the path target point, within the feasible area, path planning is performed based on a dynamic path heuristic search algorithm to generate a path planning result; In each sampling process, the path nodes are generated based on the following steps: Based on the target sampling rate, determining the random point position of each sampling; Based on the position of the random point, determining the new node and the nearest point closest to the random point; Adjust the step size of this sampling based on the distance from the line connecting the new node and the nearest point to the path target point; Based on the adjusted step size, a new node for this sampling is regenerated as the path node generated for this sampling.
2. The method according to claim 1, characterized in that: Determining a target sampling rate of a fast expanding random tree algorithm according to the obstacle information includes: Connect the starting point and the target point to obtain a first line segment; Determine the ratio of the overlapped length of the obstacle and the first line segment to the length of the first line segment; The target sampling rate is determined based on the ratio.
3. The method according to claim 1, characterized in that The step of determining the random point position for each sampling based on the target sampling rate includes: Randomly generate a random number in the interval (0,1); If the random number is greater than or equal to the target sampling rate, the position of the path target point is used as the position of the random point; If the random number is less than the target sampling rate, the position of the random point is randomly generated.
4. The method according to claim 1, characterized in that: The step of determining the new node and the nearest point closest to the random point based on the position of the random point comprises: Based on the fast expanding random tree algorithm, taking the node closest to the random point as the closest point; The target step length is moved from the nearest point toward the random point to determine the new node, wherein the target step length is the step length adjusted after the last sampling.
5. The method according to claim 4, characterized in that The step of determining the new node and the nearest point closest to the random point based on the position of the random point further comprises: If the new node is inside the obstacle, discard the new node and re-determine the new node; If the new node is not inside the obstacle, connect the new node and the nearest point.
6. The method according to claim 1, characterized in that Based on the following formula, adjust the step size of this sampling: Among them, step ′ is the step length before adjustment; step is the step length after adjustment; d i is the distance from the line connecting the new node and the nearest point to the target point of the path.
7. A workshop logistics path planning system, characterized in that: include: Map module, used to determine obstacle information in the current workshop environment; A sampling rate module, used to determine a target sampling rate of a fast expanding random tree algorithm according to the obstacle information; A sampling module, used for performing iterative sampling based on the fast expanding random tree algorithm to generate multiple path nodes; A path module, used for determining a feasible path based on the plurality of path nodes; A region module, used for expanding the feasible path into a feasible region; An output module is used to start from the path target point and perform path planning in the feasible area based on a dynamic path heuristic search algorithm to generate a path planning result; In each sampling process, the path nodes are generated based on the following steps: Based on the target sampling rate, determining the random point position of each sampling; Based on the position of the random point, determining the new node and the nearest point closest to the random point; Adjust the step size of this sampling based on the distance from the line connecting the new node and the nearest point to the path target point; Based on the adjusted step size, a new node for this sampling is regenerated as the path node generated for this sampling.
8. An electronic device, characterized in that: include: A processor, a memory, and a program stored in the memory and executable on the processor, wherein the program, when executed by the processor, implements the steps of the workshop logistics path planning method as described in any one of claims 1 to 6.
9. A computer-readable storage medium, characterized in that: A computer program is stored on a computer-readable storage medium, and when the computer program is executed by a processor, the steps of the workshop logistics path planning method as described in any one of claims 1 to 6 are implemented.
10. A computer program product, characterized in that It comprises computer instructions, which, when executed by a processor, implement the steps of the workshop logistics path planning method as described in any one of claims 1 to 6.
Citation Information
Cited By
Method for managing in-warehouse and out-warehouse data of protective clothing warehouse
CN119313005A
