Warehousing and material delivery path planning method based on wooden furniture industrial Internet platform

By obtaining target picking tasks and warehouse information, and using path planning algorithm to calculate and update the optimal picking path in real time, the adaptability and efficiency problems of wooden furniture picking path planning in the existing technology are solved, and the fast, accurate and Orderly execution improves the efficiency and accuracy of picking and reduces cargo damage.

CN118643965BActive Publication Date: 2024-11-05SICHUAN ZHILIAN DIGITAL TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411119158.0
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-08-15
Publication Date
2024-11-05
Estimated Expiration
2044-08-15

AI Technical Summary

Technical Problem

The existing wooden furniture industrial Internet platform's warehousing and delivery path planning method cannot be adapted to the execution process of wooden furniture picking tasks, resulting in the inadequate rationality and efficiency of the picking path and the inability to meet the picking requirements of the furniture industry.

Method used

By obtaining target picking tasks, extracting picking information, warehouse association information and picking start location, using path planning algorithm to calculate the optimal picking path, and update the path in real time to ensure that pickers perform picking actions according to the path received by the smart terminal, using inspiration The formula optimization algorithm model calculates the optimal picking path to adapt to the changes in the picking task.

Benefits of technology

It realizes the rapid and accurate execution of the picking path, improves the picking efficiency and accuracy, reduces the cargo damage rate, saves costs, and realizes the management and control of the full picking task of the entire system.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118643965B_ABST
    Figure CN118643965B_ABST
Patent Text Reader

Abstract

The present invention relates to the field of warehouse management technology, and proposes a warehouse delivery path planning method based on a wooden furniture industrial Internet platform. By acquiring a target picking task, extracting picking information, warehouse-related information, and the starting position of picking, the optimal picking path under the current information is planned, and the picking personnel are allowed to perform picking according to the planned path. At the same time, by analyzing the duration of different picking tasks and conditions such as warehouse occupancy, the optimal picking path is updated in real time, allowing the picking personnel to quickly and accurately complete the picking tasks, while achieving the management and control of all picking tasks in the whole system. The existing warehouse delivery path planning method of the wooden furniture industrial Internet platform solves the problem that the picking process is slow and disorderly due to the inability to meet the overall supervision of the picking process, and the picking process is slow and disorderly. The picking task is carried out quickly, accurately, and orderly, freeing up the time of warehouse pickers and improving the efficiency and accuracy of pickers.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of warehouse management, and in particular to a warehouse material delivery path planning method based on a wooden furniture industrial Internet platform. Background Art

[0002] With the continuous breakthroughs of new technologies (Internet technology, Internet of Things technology, big data analysis technology, etc.), consumers pay more and more attention to personalization and customization in furniture selection, the rise of online shopping, and the complex storage environment of the furniture industry, all of these have brought great impacts on the storage operations of wooden furniture manufacturers, especially how to effectively use the pickers in the warehouse to pick goods quickly and accurately. In the warehouse of the furniture industry, facing scattered daily orders, the picking tasks are basically generated by the system after integration based on the production date, delivery date, etc. the day before. Due to the small number of orders, the picking path can obtain better results through the algorithm. However, when encountering large orders such as engineering orders and urgent delivery dates, the picking tasks will be more frequent and subject to more uncertain factors. At this time, the pressure on the algorithm will be greatly increased. Not only does it need to calculate a large amount of data, but it is also necessary to analyze the data and influencing factors that change from time to time to complete the optimal route of the picking path.

[0003] For the optimal route of the picking path, the existing processing methods for furniture warehousing operations mainly include manual picking methods, picking task methods based on system task distribution, and optimal picking path methods based on algorithm analysis. First, the manual picking method refers to manual picking through paper picking orders. Pickers pick according to the tasks on their picking orders. This method requires pickers to be very familiar with the warehouse environment and to have a clear and understanding of the raw materials / finished products in the warehouse. This places very high demands on pickers. Once the warehouse environment changes or the location and inventory of raw materials / finished products change, the execution efficiency of this method will decrease. At the same time, this method cannot control whether the picking path of the picker is the optimal path. Second, the picking task method based on system task distribution is to summarize and analyze the data at the beginning of the picking task, and generate the picking task according to the optimal solution analyzed according to the current situation. At this time, the picker only needs to perform the picking according to the tasks distributed by the system. This method cannot always feedback the changes in the situation of the picking task and factors such as the warehouse inventory, and cannot achieve constant optimization. The picker can only perform the picking according to the route initially planned by the system. Third, based on the initial combination of manual intervention and system task distribution, pickers still perform picking through tasks distributed by the system. However, when the storage location is occupied by other pickers, they can go to other storage locations for picking first. However, going to other storage locations is manually selected by the pickers and decided by the pickers themselves. It can solve the problem of conflicts in some picking storage locations, but it may cause conflicts in other storage locations. This method cannot fully control the picking tasks and lacks globality and management.

[0004] The above three methods have solved the storage and delivery path planning method of the wooden furniture industrial Internet platform to a certain extent, but they cannot manage and monitor the entire storage and picking operation. For wooden furniture warehouse picking operations, other influencing factors will appear in the picking task process, and these influencing factors will have a relatively important impact on the entire picking task. The reason is that the wood used for production and assembly has different sizes and shapes. At the same time, some wood needs to be wear-proof and moisture-proof. These materials need to be stored in specific warehouses, and the picking tasks of these warehouses can only be performed as a single task, otherwise it will have a bad impact on the quality of the wood. Therefore, when the picking task is not managed and controlled globally, the goods may be damaged, resulting in reprocessing and waste. As can be seen from the above, the existing storage and delivery path planning method of the wooden furniture industrial Internet platform cannot meet the picking requirements of the furniture industry. How to use the optimal picking path method analyzed by algorithm is a difficulty that needs to be solved at present.

[0005] Therefore, how to provide a warehouse material delivery path planning method based on the wooden furniture industrial Internet platform so that the picking path can adapt to the execution process of wooden furniture picking tasks and improve the rationality of the picking path and the efficiency of picking is a technical problem that needs to be solved urgently. Summary of the invention

[0006] The present invention provides a warehouse material delivery path planning method based on the wooden furniture industrial Internet platform, aiming to solve the problem that the existing picking path planning method is not adaptable to the process of executing wooden furniture picking tasks, and to improve the rationality of the picking path and the picking efficiency.

[0007] The present invention provides a storage material delivery path planning method based on a wooden furniture industrial Internet platform, comprising:

[0008] S1: Obtain a target picking task; wherein the target picking task includes picking information, warehouse-related information, and a picking starting position;

[0009] S2: Based on the picking information and the warehouse association information, taking the picking start position as the starting point of the picking path, and using a path planning algorithm to calculate the optimal picking path;

[0010] S3: sending the optimal picking path to an intelligent terminal configured for a picker, so that the picker performs each picking action in the optimal picking path of the target picking task according to the optimal picking path received by the intelligent terminal;

[0011] S4: According to the new picking tasks received when performing each picking action, after completing each picking action, the optimal picking path of the target picking task is updated.

[0012] Optionally, the picking information includes a number of goods to be picked, the warehouse-related information includes location information of each warehouse location in the warehouse and information about the stored goods, and the picking starting position is the current position of the target picker in the warehouse.

[0013] Optionally, S2: based on the picking information and the warehouse association information, taking the picking start position as the starting point of the picking path, using a path planning algorithm to calculate the optimal picking path step, specifically including:

[0014] S21: extracting a number of goods to be picked from the picking information, and based on each of the goods to be picked, extracting the location information of the corresponding warehouse from the warehouse association information to generate a picking location set;

[0015] S22: Taking the picking starting position as the starting node of the picking path, taking the location information of each bin in the picking position set as the target node of the picking path, and using a heuristic optimization algorithm model to calculate and obtain the optimal picking path for the target picking task.

[0016] Optionally, S22: taking the picking starting position as the starting node of the picking path, taking the location information of each bin in the picking position set as the target node of the picking path, and using a heuristic optimization algorithm model to calculate the optimal picking path steps for the target picking task, specifically including:

[0017] S221: adding the starting node to the open list, initializing the total cost value of the starting node, and sorting the open list by the cost value;

[0018] The total cost value of the starting node is the sum of the actual cost from the starting node to node n and the estimated cost from node n to the target node, the actual cost is the path length from the starting node to node n, and the estimated cost is the heuristic function value from node n to the target node;

[0019] The total cost value of the starting node is initialized, specifically including: initializing the actual cost of the starting node to 0, and the total cost value of the starting node is the heuristic function value;

[0020] S222: Select a node with the smallest total cost value from the open list as the current node, and determine whether the current node is the target node;

[0021] Among them, if the current node is the target node, the search ends and the path is returned;

[0022] If the current node is not the target node, the current node is removed from the open list and added to the closed list, and then S223 is executed;

[0023] S223: Determine whether the adjacent node of the current node is in the closed list;

[0024] Among them, if the adjacent node is in the closed list, it is skipped;

[0025] If the adjacent node is not in the closed list, the following judgment process is performed: if the adjacent node is not in the open list, it is added to the open list, and the parent node of the adjacent node is set as the current node; if the adjacent node is in the open list, the latest actual cost of reaching the adjacent node through the current node is calculated;

[0026] S224: Determine whether the latest actual cost is less than the original path cost of the adjacent node; if so, update the actual cost of the adjacent node to the latest actual cost, and update the parent node of the adjacent node to the current node; if not, keep the actual cost of the adjacent node unchanged;

[0027] S225: Repeat S222-S224 to determine whether the open list is empty or whether the target node is found;

[0028] Among them, if the open list is empty, the search fails;

[0029] Among them, if the current node finds the target node, the optimal picking path for the target picking task is obtained by backtracking the parent node path.

[0030] Optionally, after the step of S2: based on the picking information and the warehouse association information, taking the picking start position as the starting point of the picking path, and using a path planning algorithm to calculate the optimal picking path, the step further includes:

[0031] S23: Obtain the optimal picking path for each picking task within the target picking cycle, and extract the picking action execution order of the starting node and several target nodes in each optimal picking path and the distance between two adjacent nodes;

[0032] S24: Calculate the picking time point when performing the picking action of each target node of each picking task according to the execution start time of each picking task and the moving speed of each picking personnel performing the picking task;

[0033] S25: Based on the picking time point, the optimal picking path of the picking task to be adjusted within the target picking cycle is adjusted to obtain a corrected optimal picking path.

[0034] Optionally, S25: based on the picking time point, adjusting the optimal picking path of the picking task to be adjusted within the target picking cycle to obtain a corrected optimal picking path step specifically includes:

[0035] S251: extracting a set of picking tasks to be adjusted from all picking tasks of the target period based on the picking time point of the picking action of each target node of each picking task;

[0036] Wherein, each picking task to be adjusted in the picking task set to be adjusted is configured to have the same picking action with the same picking time point as at least one other picking task to be adjusted in the picking task set to be adjusted;

[0037] S252: The first constraint condition is that there does not exist the same picking action with the same picking time point in all the corrected picking tasks, and the second constraint condition is that the difference between the sum of the path distances of all the optimal picking paths after correction and the sum of the path distances of all the optimal picking paths before correction is minimized. The execution order of the picking actions of the picking tasks to be adjusted in the picking task set to be adjusted is adjusted to obtain the corrected optimal picking paths of the picking tasks to be adjusted within the target picking cycle.

[0038] Optionally, S4: according to the new picking task received when executing each picking action, after executing each picking action, the optimal picking path step of the target picking task is updated, specifically including:

[0039] S41: When executing each picking action, if a new picking task is received, determine whether the picking time point of each picking action in the new picking task is the same as the picking time point of the picking action of any picking task in the target picking cycle; if so, execute S42; if not, execute S43;

[0040] S42: Based on the weight level of each picking task and the picking time point, the optimal picking path of the picking task to be updated within the target picking cycle is updated to obtain an updated optimal picking path;

[0041] S43: Execute the new picking task in parallel with other picking tasks in the target picking cycle.

[0042] Optionally, S42: based on the weight level of each picking task and the picking time point, the optimal picking path of the picking task to be updated within the target picking cycle is updated to obtain the updated optimal picking path step, specifically including:

[0043] S421: Obtain the weight levels of the picking tasks being executed and the newly received picking tasks within the target picking cycle, sort all the picking tasks in order of the weight levels, and obtain a picking task priority execution order table;

[0044] S422: Determine whether the first position of the new picking task in the picking task priority execution sequence list is earlier than the picking task with the same picking time point in the target picking cycle in the picking task priority execution sequence list; if so, execute S423; if not, execute S424;

[0045] S423: The third constraint condition is that the updating action of the execution order of the picking actions of the picking tasks arranged later in the picking task priority execution sequence table does not affect the execution order of the picking actions of the picking tasks arranged in front, and the fourth constraint condition is that the newly added path distance of the picking actions caused by each updating action is minimized, and the execution order of the picking actions in the picking tasks with the same picking time points of the picking actions within the target picking cycle and the picking tasks after the picking task priority execution sequence table are updated in sequence;

[0046] S424: The third constraint condition is that the updating action of the execution order of the picking actions of the picking tasks arranged later in the picking task priority execution sequence table does not affect the execution order of the picking actions of the picking tasks arranged in front, and the fourth constraint condition is that the newly added path distance of the picking actions caused by each updating action is minimized. The execution order of the picking actions in the new picking tasks and the picking tasks after the new picking task priority execution sequence table are updated in sequence.

[0047] Optionally, the method further includes:

[0048] S51: merging a number of picking tasks with unique picking actions and the same picking actions in the picking task priority execution sequence table to obtain a merged picking task;

[0049] S52: Generate a virtual container for each picking action in the merged picking task, and bind the virtual container with the corresponding picking action and the corresponding picked goods.

[0050] Optionally, S51: after merging a plurality of picking tasks having unique picking actions and the same picking actions in the picking task priority execution order table to obtain the merged picking task step, the method further includes:

[0051] S53: extracting the distance between the starting node and the target node corresponding to the unique picking action in the optimal picking path of the merged picking task, and calculating the picking time point when the picking action of the target node of the merged picking task is executed according to the execution start time of the merged picking task and the moving speed of the picker who executes the merged picking task;

[0052] S54: setting the largest weight level in each picking task before task merging as the picked task after merging, and putting the picked task after merging into the picking task priority execution order table according to the weight level;

[0053] S55: After completing the merging of picking tasks, based on the position of each picking task in the picking task priority execution sequence table, the fifth constraint condition is that the updating action of the execution sequence of the picking actions of the picking tasks arranged later in the picking task priority execution sequence table does not affect the execution sequence of the picking actions of the picking tasks arranged in front, and the sixth constraint condition is that the newly added path distance of the picking action caused by each updating action is minimized. The execution sequence of the picking actions in the picking tasks with the same picking time points of the picking actions within the target picking cycle and the picking tasks after the picking task priority execution sequence table are updated in sequence.

[0054] The beneficial effects of the present invention are as follows: a storage and delivery path planning method based on the wooden furniture industrial Internet platform is proposed, which obtains the target picking task, extracts the picking information, warehouse-related information and the starting position of picking, and plans the optimal picking path under the current information, allowing the pickers to perform picking according to the planned path. At the same time, through the analysis of the duration of different picking tasks and the conditions such as the storage space occupancy, the optimal picking path is updated in real time, allowing the pickers to complete the picking tasks quickly and accurately, and at the same time, the management and control of all picking tasks in the whole system are achieved. The existing storage and delivery path planning method of the wooden furniture industrial Internet platform cannot meet the supervision of the overall view of the picking process, resulting in slow and disordered picking process, and other problems. The picking task is carried out quickly, accurately and orderly, freeing up the time of warehouse pickers, improving the efficiency and accuracy of pickers, reducing the damage rate of goods in the picking process, and saving costs. BRIEF DESCRIPTION OF THE DRAWINGS

[0055] Figure 1 A flow chart of the warehouse material delivery route planning method based on the wooden furniture industrial Internet platform provided in this embodiment.

[0056] Figure 2 It is a schematic diagram of the adjustment of picking action in the picking task in this embodiment.

[0057] Figure 3 This is a schematic diagram of merging picking tasks in this embodiment. DETAILED DESCRIPTION

[0058] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0059] like Figure 1 As shown, a storage material delivery path planning method based on the wooden furniture industrial Internet platform includes:

[0060] S1: Obtain a target picking task; wherein the target picking task includes picking information, warehouse-related information, and a picking starting position;

[0061] S2: Based on the picking information and the warehouse association information, taking the picking start position as the starting point of the picking path, and using a path planning algorithm to calculate the optimal picking path;

[0062] S3: sending the optimal picking path to an intelligent terminal configured for a picker, so that the picker performs each picking action in the optimal picking path of the target picking task according to the optimal picking path received by the intelligent terminal;

[0063] S4: According to the new picking tasks received when performing each picking action, after completing each picking action, the optimal picking path of the target picking task is updated.

[0064] It should be noted that the existing picking path planning method cannot be adapted to the process of executing wooden furniture picking tasks, which makes the rationality of the picking path and the efficiency of picking less than ideal. In order to solve the above problems, this embodiment obtains the target picking task, extracts the picking information, warehouse-related information and the starting position of picking, so as to plan the optimal picking path under the current information, so that the pickers can perform picking according to the planned path. At the same time, through the analysis of the duration of different picking tasks and the conditions such as the occupancy of the warehouse, the optimal picking path is updated in real time, so that the pickers can complete the picking tasks quickly and accurately, and at the same time, the management and control of all picking tasks in the whole system are achieved. It solves the problem that the storage and delivery path planning method of the existing wooden furniture industrial Internet platform cannot meet the overall supervision of the picking process, resulting in slow and disordered picking process, and realizes the picking task to be carried out quickly, accurately and orderly, frees up the time of warehouse pickers, improves the efficiency and accuracy of pickers, reduces the damage rate of goods in the picking process, and saves costs.

[0065] In practical applications, the picking information includes a number of goods to be picked, the warehouse-related information includes the location information of each warehouse location and the stored goods information, and the picking start position is the current position of the target picker in the warehouse.

[0066] In a preferred embodiment, S2: based on the picking information and the warehouse association information, taking the picking start position as the starting point of the picking path, using a path planning algorithm to calculate the optimal picking path step specifically includes:

[0067] S21: extracting a number of goods to be picked from the picking information, and based on each of the goods to be picked, extracting the location information of the corresponding warehouse from the warehouse association information to generate a picking location set;

[0068] S22: Taking the picking starting position as the starting node of the picking path, taking the location information of each bin in the picking position set as the target node of the picking path, and using a heuristic optimization algorithm model to calculate and obtain the optimal picking path for the target picking task.

[0069] Furthermore, S22: taking the picking starting position as the starting node of the picking path, taking the location information of each bin in the picking position set as the target node of the picking path, and using the heuristic optimization algorithm model to calculate the optimal picking path steps for the target picking task, specifically including:

[0070] S221: adding the starting node to the open list, initializing the total cost value of the starting node, and sorting the open list by the cost value;

[0071] The total cost value of the starting node is the sum of the actual cost from the starting node to node n and the estimated cost from node n to the target node, the actual cost is the path length from the starting node to node n, and the estimated cost is the heuristic function value from node n to the target node;

[0072] The total cost value of the starting node is initialized, specifically including: initializing the actual cost of the starting node to 0, and the total cost value of the starting node is the heuristic function value;

[0073] S222: Select a node with the smallest total cost value from the open list as the current node, and determine whether the current node is the target node;

[0074] Among them, if the current node is the target node, the search ends and the path is returned;

[0075] If the current node is not the target node, the current node is removed from the open list and added to the closed list, and then S223 is executed;

[0076] S223: Determine whether the adjacent node of the current node is in the closed list;

[0077] Among them, if the adjacent node is in the closed list, it is skipped;

[0078] If the adjacent node is not in the closed list, the following judgment process is performed: if the adjacent node is not in the open list, it is added to the open list, and the parent node of the adjacent node is set as the current node; if the adjacent node is in the open list, the latest actual cost of reaching the adjacent node through the current node is calculated;

[0079] S224: Determine whether the latest actual cost is less than the original path cost of the adjacent node; if so, update the actual cost of the adjacent node to the latest actual cost, and update the parent node of the adjacent node to the current node; if not, keep the actual cost of the adjacent node unchanged;

[0080] S225: Repeat S222-S224 to determine whether the open list is empty or whether the target node is found;

[0081] Among them, if the open list is empty, the search fails;

[0082] Among them, if the current node finds the target node, the optimal picking path for the target picking task is obtained by backtracking the parent node path.

[0083] In this embodiment, after obtaining the picking information, warehouse-related information and picking starting position in the target picking task, the location information of each warehouse corresponding to the goods to be picked is first extracted from the warehouse-related information to generate a picking location set, and then the picking starting position is used as the starting node of the picking path, and the location information of each warehouse in the picking location set is used as the target node of the picking path. The heuristic optimization algorithm model is used to calculate the optimal picking path for the target picking task, and the optimal picking path enables the picker to complete the picking task in the shortest time.

[0084] Specifically, when using the heuristic optimization algorithm model to calculate the optimal picking path for the target picking task, first set g(n) to represent the actual cost from the starting node to node n (i.e., the path length from the starting node to node n), h(n) to represent the estimated cost from node n to the target node (i.e., the heuristic function value), and f(n)=g(n)+h(n) to represent the total cost from the starting node through node n to the target node. The specific formula is as follows: [f(n)=g(n)+h(n)]; where: f(n) is the total cost from the starting node through node n to the target node; g(n) is the actual cost from the starting node to node n; h(n) is the heuristic function value from node n to the target node.

[0085] After that, repeat the following steps until the target node is found or the open list is empty: select the node with the smallest substitution value f(n) from the open list as the current node; if the current node is the target node, the search ends and the path is returned; remove the current node from the open list and add it to the closed list; perform the following operations on the adjacent nodes of the current node: if the adjacent node is already in the closed list, skip it; if the adjacent node is not in the open list, add it to the open list and set its parent node to the current node; if the adjacent node is already in the open list, calculate the path cost g_{new} from the current node to the adjacent node; if g_{new} is less than the original path cost g of the adjacent node, update the path cost of the adjacent node to g_{new}, and update its parent node to the current node, otherwise, keep the path cost of the adjacent node unchanged; if the open list is empty and the target node is not found, the search fails; if the target node is found, construct the optimal path by backtracking the parent node path.

[0086] Therefore, this embodiment continuously selects the node with the smallest f(n) for search in order to preliminarily calculate the optimal path from the starting node to the target node, giving priority to ensuring that the path of the current picking order is the shortest and that the cargo information on the storage location can meet the picking task, thereby ensuring that the initial path planning process of a single picking task meets the optimal conditions.

[0087] In a preferred embodiment, after the step of S2: based on the picking information and the warehouse association information, taking the picking start position as the starting point of the picking path, and using a path planning algorithm to calculate the optimal picking path, the method further includes:

[0088] S23: Obtain the optimal picking path for each picking task within the target picking cycle, and extract the picking action execution order of the starting node and several target nodes in each optimal picking path and the distance between two adjacent nodes;

[0089] S24: Calculate the picking time point when performing the picking action of each target node of each picking task according to the execution start time of each picking task and the moving speed of each picking personnel performing the picking task;

[0090] S25: Based on the picking time point, the optimal picking path of the picking task to be adjusted within the target picking cycle is adjusted to obtain a corrected optimal picking path.

[0091] Furthermore, S25: based on the picking time point, the optimal picking path of the picking task to be adjusted within the target picking cycle is adjusted to obtain a corrected optimal picking path step, specifically including:

[0092] S251: extracting a set of picking tasks to be adjusted from all picking tasks of the target period based on the picking time point of the picking action of each target node of each picking task;

[0093] Wherein, each picking task to be adjusted in the picking task set to be adjusted is configured to have the same picking action with the same picking time point as at least one other picking task to be adjusted in the picking task set to be adjusted;

[0094] S252: The first constraint condition is that there does not exist the same picking action with the same picking time point in all the corrected picking tasks, and the second constraint condition is that the difference between the sum of the path distances of all the optimal picking paths after correction and the sum of the path distances of all the optimal picking paths before correction is minimized. The execution order of the picking actions of the picking tasks to be adjusted in the picking task set to be adjusted is adjusted to obtain the corrected optimal picking paths of the picking tasks to be adjusted within the target picking cycle.

[0095] In this embodiment, considering that in the actual execution process, the picking tasks are not executed serially one by one, but are carried out simultaneously with high concurrency, at this time, the algorithm server will plan the picking path for each picking order according to the above-mentioned single path planning method, and then perform secondary optimization on the conflicting storage locations, goods and other conditions on the picking path. After the optimization, the path of the picking order will be adjusted. Specifically, through the optimal picking path, the execution order of the picking actions of the starting node and several target nodes in the optimal picking path and the distance between two adjacent nodes are extracted; according to the execution start time of each picking task, the moving speed of each picking personnel performing the picking task and the distance between the above two adjacent nodes, the picking time point when performing the picking action of each target node of each picking task is calculated; the picking time point is used to evaluate whether there is a conflict in the picking actions of the two picking tasks; and then the first constraint condition is that there does not exist the same picking action with the same picking time point in all the corrected picking tasks; the second constraint condition is that the difference between the sum of the path distances of all the optimal picking paths after correction and the sum of the path distances of all the optimal picking paths before correction is minimized; the execution order of the picking actions of the picking tasks to be adjusted in the picking task set to be adjusted is adjusted, so as to complete the adjustment of the picking actions in the picking tasks under actual conditions.

[0096] For example, Figure 2 As shown, the algorithm server will plan the optimal picking path for each picking task based on the single path planning method, and then perform secondary optimization on the conflicting storage locations, goods and other conditions on the optimal picking path. After optimization, the path of the picking task will be adjusted. For example, picking order 1 needs to execute picking tasks from three storage locations A, B, and C, and picking order 2 also needs to execute picking tasks from three storage locations A, B, and C. Picking order 1 is executed by picker 1, and picking order 2 is executed by picker 2. The time and distance for the pickers to reach each picking location are close to the time for picking at each location. At this time, according to the picking information, the path planning of picking order 1 is ABC, that is, picker 1 needs to pick location A first, then location B, and then location C. The planned path of picking order 2 is CBA. According to this task planning, picking order 1 and picking order 2 will execute picking at location B at the same time, which will cause picking conflicts. At this time, the algorithm server will adjust the picking order tasks according to this conflict situation. The result after adjustment is to ensure that the picking tasks do not conflict and the path added by the pickers is the shortest. The adjustment method is to make the execution path of picking order 1 BAC and the execution path of picking order 2 CBA.

[0097] In a preferred embodiment, S4: according to the new picking task received when executing each picking action, after executing each picking action, the optimal picking path step of the target picking task is updated, specifically including:

[0098] S41: When executing each picking action, if a new picking task is received, determine whether the picking time point of each picking action in the new picking task is the same as the picking time point of the picking action of any picking task in the target picking cycle; if so, execute S42; if not, execute S43;

[0099] S42: Based on the weight level of each picking task and the picking time point, the optimal picking path of the picking task to be updated within the target picking cycle is updated to obtain an updated optimal picking path;

[0100] S43: Execute the new picking task in parallel with other picking tasks in the target picking cycle.

[0101] Furthermore, S42: based on the weight level of each picking task and the picking time point, the optimal picking path of the picking task to be updated within the target picking cycle is updated to obtain the updated optimal picking path step, specifically including:

[0102] S421: Obtain the weight levels of the picking tasks being executed and the newly received picking tasks within the target picking cycle, sort all the picking tasks in order of the weight levels, and obtain a picking task priority execution order table;

[0103] S422: Determine whether the first position of the new picking task in the picking task priority execution sequence list is earlier than the picking task with the same picking time point in the target picking cycle in the picking task priority execution sequence list; if so, execute S423; if not, execute S424;

[0104] S423: The third constraint condition is that the updating action of the execution order of the picking actions of the picking tasks arranged later in the picking task priority execution sequence table does not affect the execution order of the picking actions of the picking tasks arranged in front, and the fourth constraint condition is that the newly added path distance of the picking actions caused by each updating action is minimized, and the execution order of the picking actions in the picking tasks with the same picking time points of the picking actions within the target picking cycle and the picking tasks after the picking task priority execution sequence table are updated in sequence;

[0105] S424: The third constraint condition is that the updating action of the execution order of the picking actions of the picking tasks arranged later in the picking task priority execution sequence table does not affect the execution order of the picking actions of the picking tasks arranged in front, and the fourth constraint condition is that the newly added path distance of the picking actions caused by each updating action is minimized. The execution order of the picking actions in the new picking tasks and the picking tasks after the new picking task priority execution sequence table are updated in sequence.

[0106] In general, the pickers only need to pick the goods according to the optimal path prompted by the system, but in the actual picking process, uncertain factors may interfere with the picking tasks, such as the new picking tasks received. In order to solve the above problems, this embodiment considers each picking action in the new picking tasks received and the weight level of each picking task, and selects the tasks with higher weight rankings between the new picking tasks and the picking tasks being executed according to the weight level rankings, and adjusts the picking actions of the tasks with lower weight rankings (ensuring that the distance of the newly added path is minimized) to avoid conflicts in picking actions. For the conflicts in picking actions of other picking tasks caused by the adjustment, the weight level rankings are continued to be considered, and the picking actions of other picking tasks with lower weight rankings are adjusted (ensuring that the distance of the newly added path is minimized), and this is repeated until the picking actions of all picking tasks do not conflict with each other.

[0107] Specifically, when faced with the above situation, the algorithm server will recalculate and adjust the picking path according to the influence of factors, and synchronize the latest path to the warehouse system, such as Figure 2 As shown. For example, the path initially planned for Picking Order 1 is ABC. After picking at A, it should pick at B, and then pick at C. When Picking Order 1 finishes picking at A, a Picking Order 2 is generated due to an expedited order. The picking path for Picking Order 2 is BCD. At this time, the algorithm server will make adjustments based on the influencing factors, giving priority to the expedited picking orders. At this time, the execution data of Picking Order 1 will be adjusted to ACB. This adjustment process ensures that the distance of the newly added path is minimized. If Picking Order 1 or Picking Order 2 conflicts with other picking orders, they will be reordered and combined based on the weights of the influencing factors to ensure the normal execution of the picking task.

[0108] In a preferred embodiment, the method further comprises:

[0109] S51: merging a number of picking tasks with unique picking actions and the same picking actions in the picking task priority execution sequence table to obtain a merged picking task;

[0110] S52: Generate a virtual container for each picking action in the merged picking task, and bind the virtual container with the corresponding picking action and the corresponding picked goods.

[0111] Optionally, S51: after merging a plurality of picking tasks having unique picking actions and the same picking actions in the picking task priority execution order table to obtain the merged picking task step, the method further includes:

[0112] S53: extracting the distance between the starting node and the target node corresponding to the unique picking action in the optimal picking path of the merged picking task, and calculating the picking time point when the picking action of the target node of the merged picking task is executed according to the execution start time of the merged picking task and the moving speed of the picker who executes the merged picking task;

[0113] S54: setting the largest weight level in each picking task before task merging as the picked task after merging, and putting the picked task after merging into the picking task priority execution order table according to the weight level;

[0114] S55: After completing the merging of picking tasks, based on the position of each picking task in the picking task priority execution sequence table, the fifth constraint condition is that the updating action of the execution sequence of the picking actions of the picking tasks arranged later in the picking task priority execution sequence table does not affect the execution sequence of the picking actions of the picking tasks arranged in front, and the sixth constraint condition is that the newly added path distance of the picking action caused by each updating action is minimized. The execution sequence of the picking actions in the picking tasks with the same picking time points of the picking actions within the target picking cycle and the picking tasks after the picking task priority execution sequence table are updated in sequence.

[0115] In this embodiment, considering that in some cases, the storage location of a part of the picking tasks is a fixed storage location, such as Figure 3 As shown. For example, there are three picking tasks, Picking Order 1, Picking Order 2, Picking Order 3. At this time, the warehouse location of the three picking tasks is warehouse location A. At this time, the algorithm server will analyze and calculate the picking tasks in the same warehouse location, merge the picking tasks in the same warehouse location, and estimate the total execution time of the three picking tasks. At this time, the operator can directly perform warehouse location picking. When the operator chooses this method of picking, the algorithm server will also automatically allocate virtual containers according to the number of picking orders. In this case, 3 virtual containers will be generated, and the picking orders and virtual containers will be bound to facilitate subsequent picking and review. At the same time, considering that the completion time of the picking action of the merged picking tasks will change after the picking tasks are merged, it is necessary to update the picking action and the picking time point of each picking action in the picking task priority execution order table according to the changes in the picking action, so as to achieve the management and control of all picking tasks in the whole system, and re-execute the picking tasks after the update. Specifically, the execution of the picking conflict at the A warehouse needs to be put behind, and the execution path can be updated to BAC or BCA. When the operator goes to the A warehouse to perform the picking tasks of picking order 1, picking order 2, and picking order 3, all three picking tasks need to be completed. During the above picking tasks, the algorithm server will also adjust other picking order paths according to the factors and update them to display on the warehouse system.

[0116] Therefore, by obtaining the target picking task, extracting the picking information, warehouse-related information and the starting position of picking, the optimal picking path under the current information is planned, so that the pickers can perform picking according to the planned path. At the same time, through the analysis of the duration of different picking tasks and the occupancy of warehouse space, the optimal picking path is updated in real time, so that the pickers can complete the picking tasks quickly and accurately, and at the same time, the management and control of all picking tasks in the whole system are achieved. The existing storage delivery path planning method of the wooden furniture industrial Internet platform cannot meet the overall supervision of the picking process, resulting in slow and disordered picking process. The picking task is carried out quickly, accurately and orderly, freeing up the time of warehouse pickers, improving the efficiency and accuracy of pickers, reducing the damage rate of goods in the picking process, and saving costs.

[0117] In the description of the embodiments of the present invention, the terms "first", "second", "third", and "fourth" are used for descriptive purposes only and are not to be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features. Thus, a feature defined as "first", "second", "third", and "fourth" may explicitly or implicitly include one or more of the features. In the description of the present invention, unless otherwise specified, "multiple" means two or more.

[0118] In the description of the embodiments of the present invention, specific features, structures, materials or characteristics may be combined in a suitable manner in any one or more embodiments or examples.

[0119] Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that various changes, modifications, substitutions and variations may be made to the embodiments without departing from the principles and spirit of the present invention, and that the scope of the present invention is defined by the appended claims and their equivalents.

Claims

1. A storage and delivery path planning method based on the wooden furniture industrial Internet platform. It is characterized in that include: S1: Obtain a target picking task; wherein the target picking task includes picking information, warehouse-related information, and a picking starting position; S2: Based on the picking information and the warehouse association information, taking the picking start position as the starting point of the picking path, and using a path planning algorithm to calculate the optimal picking path; S3: sending the optimal picking path to an intelligent terminal configured for a picker, so that the picker performs each picking action in the optimal picking path of the target picking task according to the optimal picking path received by the intelligent terminal; S4: updating the optimal picking path of the target picking task after each picking action is performed according to the new picking task received when each picking action is performed; The picking information includes a number of goods to be picked, the warehouse-related information includes the location information of each warehouse location and the stored goods information, and the picking start position is the current position of the target picker in the warehouse; Among them, S2: based on the picking information and the warehouse association information, taking the picking start position as the starting point of the picking path, using the path planning algorithm to calculate the optimal picking path step, specifically including: S21: extracting a number of goods to be picked from the picking information, and based on each of the goods to be picked, extracting the location information of the corresponding warehouse from the warehouse association information to generate a picking location set; S22: Taking the picking starting position as the starting node of the picking path, taking the location information of each bin in the picking position set as the target node of the picking path, and using a heuristic optimization algorithm model to calculate and obtain the optimal picking path for the target picking task; Among them, S2: based on the picking information and the warehouse association information, taking the picking start position as the starting point of the picking path, using the path planning algorithm to calculate the optimal picking path step, it also includes: S23: Obtain the optimal picking path for each picking task within the target picking cycle, and extract the picking action execution order of the starting node and several target nodes in each optimal picking path and the distance between two adjacent nodes; S24: Calculate the picking time point when performing the picking action of each target node of each picking task according to the execution start time of each picking task and the moving speed of each picking personnel performing the picking task; S25: Based on the picking time point, the optimal picking path of the picking task to be adjusted within the target picking cycle is adjusted to obtain a corrected optimal picking path; Among them, S25: based on the picking time point, adjusting the optimal picking path of the picking task to be adjusted within the target picking cycle to obtain a corrected optimal picking path step specifically includes: S251: extracting a set of picking tasks to be adjusted from all picking tasks of the target period based on the picking time point of the picking action of each target node of each picking task; Wherein, each picking task to be adjusted in the picking task set to be adjusted is configured to have the same picking action with the same picking time point as at least one other picking task to be adjusted in the picking task set to be adjusted; S252: Taking that the first constraint condition is that all the corrected picking tasks do not have the same picking action with the same picking time point, and taking that the difference between the sum of the path distances of all the corrected optimal picking paths and the sum of the path distances of all the optimal picking paths before correction is minimized as the second constraint condition, adjusting the execution order of the picking actions of the picking tasks to be adjusted in the picking task set to be adjusted, and obtaining the corrected optimal picking paths of the picking tasks to be adjusted within the target picking cycle; Among them, S4: according to the new picking task received when executing each picking action, after executing each picking action, the optimal picking path step of the target picking task is updated, specifically including: S41: When executing each picking action, if a new picking task is received, determine whether the picking time point of each picking action in the new picking task is the same as the picking time point of the picking action of any picking task in the target picking cycle; if so, execute S42; if not, execute S43; S42: Based on the weight level of each picking task and the picking time point, the optimal picking path of the picking task to be updated within the target picking cycle is updated to obtain an updated optimal picking path; S43: executing the new picking task in parallel with other picking tasks within the target picking cycle; Among them, S42: based on the weight level of each picking task and the picking time point, the optimal picking path of the picking task to be updated within the target picking cycle is updated to obtain the updated optimal picking path step, specifically including: S421: Obtain the weight levels of the picking tasks being executed and the newly received picking tasks within the target picking cycle, sort all the picking tasks in order of the weight levels, and obtain a picking task priority execution order table; S422: Determine whether the first position of the new picking task in the picking task priority execution sequence list is earlier than the picking task with the same picking time point in the target picking cycle in the picking task priority execution sequence list; if so, execute S423; if not, execute S424; S423: The third constraint condition is that the updating action of the execution order of the picking actions of the picking tasks arranged later in the picking task priority execution sequence table does not affect the execution order of the picking actions of the picking tasks arranged in front, and the fourth constraint condition is that the newly added path distance of the picking actions caused by each updating action is minimized, and the execution order of the picking actions in the picking tasks with the same picking time points of the picking actions within the target picking cycle and the picking tasks after the picking task priority execution sequence table are updated in sequence; S424: The third constraint condition is that the updating action of the execution order of the picking actions of the picking tasks arranged later in the picking task priority execution sequence table does not affect the execution order of the picking actions of the picking tasks arranged in front, and the fourth constraint condition is that the newly added path distance of the picking actions caused by each updating action is minimized. The execution order of the picking actions in the new picking tasks and the picking tasks after the new picking task priority execution sequence table are updated in sequence.

2. According to claim 1, the storage and delivery path planning method based on the wooden furniture industrial Internet platform, It is characterized in that S22: Taking the picking starting position as the starting node of the picking path, taking the location information of each bin in the picking location set as the target node of the picking path, and using the heuristic optimization algorithm model to calculate the optimal picking path steps for the target picking task, specifically including: S221: adding the starting node to the open list, initializing the total cost value of the starting node, and sorting the open list by the cost value; The total cost value of the starting node is the sum of the actual cost from the starting node to node n and the estimated cost from node n to the target node, the actual cost is the path length from the starting node to node n, and the estimated cost is the heuristic function value from node n to the target node; The total cost value of the starting node is initialized, specifically including: initializing the actual cost of the starting node to 0, and the total cost value of the starting node is the heuristic function value; S222: Select a node with the smallest total cost value from the open list as the current node, and determine whether the current node is the target node; Among them, if the current node is the target node, the search ends and the path is returned; If the current node is not the target node, the current node is removed from the open list and added to the closed list, and then S223 is executed; S223: Determine whether the adjacent node of the current node is in the closed list; Among them, if the adjacent node is in the closed list, it is skipped; If the adjacent node is not in the closed list, the following judgment process is performed: if the adjacent node is not in the open list, it is added to the open list, and the parent node of the adjacent node is set as the current node; if the adjacent node is in the open list, the latest actual cost of reaching the adjacent node through the current node is calculated; S224: Determine whether the latest actual cost is less than the original path cost of the adjacent node; if so, update the actual cost of the adjacent node to the latest actual cost, and update the parent node of the adjacent node to the current node; if not, keep the actual cost of the adjacent node unchanged; S225: Repeat S222-S224 to determine whether the open list is empty or whether the target node is found; Among them, if the open list is empty, the search fails; Among them, if the current node finds the target node, the optimal picking path of the target picking task is obtained by backtracking the parent node path.

3. According to claim 1, the storage and delivery path planning method based on the wooden furniture industrial Internet platform, It is characterized in that The method further comprises: S51: merging a number of picking tasks with unique picking actions and the same picking actions in the picking task priority execution sequence table to obtain a merged picking task; S52: Generate a virtual container for each picking action in the merged picking task, and bind the virtual container with the corresponding picking action and the corresponding picked goods.

4. According to claim 3, the storage and delivery path planning method based on the wooden furniture industrial Internet platform, It is characterized in that S51: After merging a plurality of picking tasks having unique picking actions and the same picking actions in the picking task priority execution sequence table to obtain the merged picking task step, the method further includes: S53: extracting the distance between the starting node and the target node corresponding to the unique picking action in the optimal picking path of the merged picking task, and calculating the picking time point when the picking action of the target node of the merged picking task is executed according to the execution start time of the merged picking task and the moving speed of the picker who executes the merged picking task; S54: setting the largest weight level in each picking task before task merging as the picked task after merging, and putting the picked task after merging into the picking task priority execution order table according to the weight level; S55: After completing the merging of picking tasks, based on the position of each picking task in the picking task priority execution sequence table, the fifth constraint condition is that the updating action of the execution sequence of the picking actions of the picking tasks arranged later in the picking task priority execution sequence table does not affect the execution sequence of the picking actions of the picking tasks arranged in front, and the sixth constraint condition is that the newly added path distance of the picking action caused by each updating action is minimized. The execution sequence of the picking actions in the picking tasks with the same picking time points of the picking actions within the target picking cycle and the picking tasks after the picking task priority execution sequence table are updated in sequence.