Goods sorting path planning method and system for goods sorting robot

By setting up a pickup window and distribution window, the preliminary path planning is generated, and the sensor monitoring and optimization path is used, and the task is executed in combination with the distributed coordination mechanism, the scheduling bottleneck problem caused by centralized scheduling methods is solved, and the efficiency of picking robot tasks is improved. System reliability.

CN119065377AInactive Publication Date: 2024-12-03SHENZHEN SHANDING CAVEMAN TECH CO LTD

Patent Information

Application Number
CN202411193324.1
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-28
Publication Date
2024-12-03
Estimated Expiration
Not applicable · inactive patent

AI Technical Summary

Technical Problem

In the prior art, centralized scheduling methods are prone to scheduling bottlenecks when facing a large number of orders or complex tasks, resulting in the central control system being unable to quickly and effectively adjust task allocation, affecting task execution efficiency and system reliability, and may even lead to paralysis of robot clusters. .

Method used

The preliminary path plan is generated by setting up a pickup window and distribution window, and the route and environmental changes are updated in real time according to sensor monitoring, and the optimization allocation tasks are performed through a distributed coordination mechanism to avoid scheduling bottlenecks and improve task execution efficiency and system reliability.

Benefits of technology

It effectively avoids scheduling bottlenecks when facing a large number of orders or complex tasks, improves task execution efficiency and overall system reliability, and ensures that the robot cluster completes tasks efficiently and flexibly.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119065377A_ABST
    Figure CN119065377A_ABST
Patent Text Reader

Abstract

The invention provides a goods sorting path planning method and system for a goods picking robot, and relates to the technical field of path planning, and the method comprises the steps: generating a preliminary path plan according to a goods taking window and a distribution window; task allocation is carried out on the robot cluster according to the preliminary path planning, and a preliminary allocation task is generated; monitoring to obtain a real-time updated route and environment change in the warehouse, and obtaining an optimized path plan; adjusting the preliminary distribution task to obtain an optimized distribution task; and executing the optimal allocation task. According to the method and the device, the technical problem that task allocation cannot be quickly and effectively adjusted and the task execution efficiency and the overall reliability of the system are affected due to the fact that a centralized scheduling mode is prone to scheduling bottleneck when facing a large number of orders or complex tasks in the prior art can be solved, the technical target of distributed coordinated scheduling is achieved, and the task execution efficiency and the overall reliability of the system are improved. The technical effects of effectively avoiding the scheduling bottleneck and improving the task execution efficiency and the overall reliability of the system in the face of a large number of orders or complex tasks are achieved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of path planning technology, and in particular to a cargo sorting path planning method and system for a picking robot. Background Art

[0002] In modern warehousing and logistics management, automation systems have gradually become a key means to improve efficiency, especially in the process of goods sorting and distribution. The use of picking robots has become the mainstream choice of many large warehouses. Although the automation system has improved the operational efficiency of the warehouse to a certain extent, there are still some significant defects in practical applications, which restrict the flexibility of the automation system and its ability to cope with complex situations.

[0003] At present, the existing technology usually adopts a centralized scheduling method for task allocation, that is, the central control system assigns tasks to each robot according to pre-set rules. However, the centralized task allocation method is prone to scheduling bottlenecks when faced with a large number of orders or complex tasks. When the order volume surges or the complexity of the task increases, the central control system may not be able to quickly and effectively adjust the task allocation, resulting in delays in task execution. In addition, the centralized scheduling method has extremely high requirements for the reliability of the system. Once the central system fails, the entire robot cluster may be paralyzed and unable to continue to perform tasks.

[0004] To sum up, there are technical problems in the prior art that the centralized scheduling method is prone to scheduling bottlenecks when facing a large number of orders or complex tasks, which makes the central control system unable to quickly and effectively adjust task allocation, further affecting the efficiency of task execution and the overall reliability of the system, and may even cause the paralysis of the robot cluster. Summary of the invention

[0005] The purpose of this application is to provide a cargo sorting path planning method and system for a picking robot, so as to solve the technical problem in the prior art that the centralized scheduling method is prone to scheduling bottlenecks when facing a large number of orders or complex tasks, resulting in the central control system being unable to quickly and effectively adjust task allocation, further affecting the efficiency of task execution and the overall reliability of the system, and may even cause the paralysis of the robot cluster.

[0006] In view of the above problems, the present application provides a cargo sorting path planning method and system for a picking robot.

[0007] In the first aspect, the present application provides a cargo sorting path planning method for a picking robot, which is implemented through a cargo sorting path planning system for a picking robot, including: setting a pickup window and a delivery window, and generating a preliminary path planning based on the pickup window and the delivery window; assigning tasks to a robot cluster based on the preliminary path planning to generate preliminary assigned tasks; obtaining real-time updated routes and environmental changes in the warehouse based on sensor monitoring to obtain an optimized path planning; adjusting the preliminary assigned tasks based on the optimized path planning to obtain optimized assigned tasks; and executing the optimized assigned tasks through a distributed coordination mechanism.

[0008] In the second aspect, the present application also provides a cargo sorting path planning system for a picking robot, which is used to execute the cargo sorting path planning method for a picking robot as described in the first aspect, including: a preliminary path planning generation module, the preliminary path planning generation module is used to set a pickup window and a delivery window, and generate a preliminary path planning according to the pickup window and the delivery window; a preliminary assignment task generation module, the preliminary assignment task generation module is used to assign tasks to a robot cluster based on the preliminary path planning, and generate preliminary assignment tasks; an optimized path planning acquisition module, the optimized path planning acquisition module is used to obtain real-time updated routes and environmental changes in the warehouse based on sensor monitoring, and obtain an optimized path planning; an optimized assignment task acquisition module, the optimized assignment task acquisition module is used to adjust the preliminary assignment tasks according to the optimized path planning, and obtain optimized assignment tasks; a task execution module, the task execution module is used to execute the optimized assignment tasks through a distributed coordination mechanism.

[0009] One or more technical solutions provided in this application have at least the following technical effects or advantages: By setting a pickup window and a delivery window, a preliminary path planning is generated according to the pickup window and the delivery window; the preliminary path planning is used to assign tasks to the robot cluster to generate preliminary assigned tasks; the real-time updated route and environmental changes in the warehouse are obtained according to sensor monitoring to obtain an optimized path planning; the preliminary assigned tasks are adjusted according to the optimized path planning to obtain an optimized assigned task; the optimized assigned tasks are executed through a distributed coordination mechanism to achieve the technical goal of distributed coordinated scheduling, so as to effectively avoid scheduling bottlenecks when facing a large number of orders or complex tasks, and improve the task execution efficiency and the overall reliability of the system.

[0010] The above description is only an overview of the technical solution of the present application. In order to more clearly understand the technical means of the present application, it can be implemented according to the contents of the specification, and in order to make the above and other purposes, features and advantages of the present application more obvious and easy to understand, the specific implementation methods of the present application are specifically cited below. It should be understood that the content described in this section is not intended to identify the key or important features of the embodiments of the present application, nor is it intended to limit the scope of the present application. Other features of the present application will become easy to understand through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

[0011] In order to more clearly illustrate the technical solutions in the present application or the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings in the following description are only exemplary, and for ordinary technicians in this field, other drawings can be obtained based on the provided drawings without paying any creative work.

[0012] Figure 1 This is a flow chart of a method for cargo sorting path planning for a picking robot in this application; Figure 2 This is a schematic diagram of the structure of the cargo sorting path planning system used for the picking robot in this application.

[0013] Description of reference numerals: A preliminary path planning generation module 11, a preliminary task allocation generation module 12, an optimized path planning acquisition module 13, an optimized task allocation acquisition module 14, and a task execution module 15. DETAILED DESCRIPTION

[0014] This application provides a cargo sorting path planning method and system for picking robots, which solves the technical problem in the prior art that the centralized scheduling method is prone to scheduling bottlenecks when facing a large number of orders or complex tasks, resulting in the central control system being unable to quickly and effectively adjust task allocation, further affecting the efficiency of task execution and the overall reliability of the system, and may even cause the paralysis of the robot cluster. The technical goal of achieving distributed coordinated scheduling is achieved, and the scheduling bottleneck is effectively avoided when facing a large number of orders or complex tasks, and the technical effect of improving task execution efficiency and overall system reliability is achieved.

[0015] Below, the technical solutions in the present application will be clearly and completely described with reference to the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present application, rather than all of the embodiments of the present application. It should be understood that the present application is not limited to the example embodiments described herein. Based on the embodiments of the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present application. It should also be noted that, for the convenience of description, only the parts related to the present application are shown in the accompanying drawings, rather than all of them.

[0016] For example, please refer to the attached Figure 1 The present application provides a cargo sorting path planning method for a picking robot, which is applied to a cargo sorting path planning system of a picking robot, and specifically includes the following steps: Step 1: Set a pickup window and a delivery window, and generate a preliminary route plan based on the pickup window and the delivery window.

[0017] Specifically, in warehouse management, pick-up windows and dispatch windows are set to reasonably allocate tasks for robots in different time periods. The pick-up window refers to the time period when robots concentrate on picking up goods within a specified time, while the dispatch window refers to the time period when the goods are delivered to the designated location after the pick-up is completed. By pre-setting the time window, the actions of the robot group can be better coordinated to avoid conflicts and delays in task execution. Subsequently, preliminary path planning is generated based on the time windows of the pick-up window and the dispatch window to ensure that the robot can efficiently complete the pick-up and dispatch tasks within the specified time, thereby improving the overall efficiency of warehouse operations.

[0018] Step 2: Assign tasks to the robot cluster using the preliminary path planning to generate preliminary assigned tasks.

[0019] Specifically, after generating the preliminary path plan, the robot cluster is assigned tasks according to the preliminary path plan, and each task is reasonably assigned to different robots to ensure that each robot can complete the specified pickup and delivery operations at the appropriate time and place. The preliminary assignment tasks are generated considering the current location, availability, and time window in the path planning of the robot. The preliminary assignment of tasks ensures the collaborative work of the robot cluster, optimizes the overall task execution efficiency, and lays the foundation for subsequent operations.

[0020] Step 3: Obtain real-time updates of routes and changes in the warehouse environment based on sensor monitoring to obtain optimized path planning.

[0021] Specifically, sensors can detect the movement of shelves, the appearance of temporary obstacles, and other environmental changes, and the monitored data is continuously input into the system so that path planning can be adjusted in a timely manner. By combining real-time monitoring of updated routes and environmental changes within the warehouse, existing routes can be updated to ensure that the planned path can avoid new obstacles and adapt to the current warehouse environment. Ultimately, real-time adjustments and optimizations make the generated optimized path planning more in line with actual operational needs, improving the efficiency and safety of robot task execution within the warehouse.

[0022] Step 4: Adjust the preliminary assigned tasks according to the optimized path planning to obtain optimized assigned tasks.

[0023] Specifically, the preliminary assigned tasks are adjusted according to the optimized path planning, and the results of the optimized path planning are referred to to evaluate whether the preliminary assigned tasks need to be modified to ensure that the task assignment matches the latest optimized path, thereby improving the efficiency of task execution. The optimized path planning may change the original optimal route, so the preliminary assigned tasks also need to be adjusted accordingly so that the robots can perform tasks along the new path. Adjustments may include reallocating the order of tasks, modifying the collaborative arrangements between robots, or redefining the specific tasks of each robot. The optimized assigned tasks are finally generated through adjustments to ensure that the robot cluster can efficiently complete all tasks under the optimal path.

[0024] Step 5: Execute the optimization allocation task through a distributed coordination mechanism.

[0025] Specifically, the optimized tasks are assigned to each robot, and a distributed coordination mechanism is used to manage and coordinate the execution of the optimized assigned tasks. The distributed coordination mechanism allows each robot to independently determine the specific execution steps, and share information and collaborate with other robots to ensure the synchronization and overall efficiency of task execution. The distributed coordination mechanism can effectively avoid resource conflicts and path congestion, and allows robots to make dynamic adjustments based on real-time conditions to ensure that each robot can complete the task along the optimal path. Through the distributed coordination mechanism, the robot cluster can efficiently and flexibly execute the optimized assigned tasks, improving the overall operational efficiency and the accuracy of task completion.

[0026] The method is applied to achieve the technical goal of distributed coordinated scheduling, which can effectively avoid scheduling bottlenecks when facing a large number of orders or complex tasks, and improve the task execution efficiency and the overall reliability of the system. The system can achieve the technical goal of distributed coordinated scheduling, which can effectively avoid scheduling bottlenecks when facing a large number of orders or complex tasks, and improve the task execution efficiency and the overall reliability of the system.

[0027] Furthermore, the present application also includes: The dispatch window is set based on real-time order data, and the pickup window connected in front of the dispatch window is configured; the warehouse layout and cargo information are called, and path planning is performed according to the pickup window and the dispatch window to generate an initial path planning; the initial path planning is corrected by a path verification unit to obtain the preliminary path planning.

[0028] Specifically, in actual warehouse operations, the arrival time and distribution of orders are uncertain, so it is necessary to set a dispatch window based on real-time order data in order to arrange the pickup operation reasonably. The dispatch window refers to the time period for order dispatch. By analyzing the arrival time, quantity and priority of the order, the best dispatch time can be determined. Based on the dispatch window, the pickup window is configured to ensure that the pickup operation can be completed within the appropriate time period, thereby optimizing the operation process of the entire warehouse. The pickup window is a time period in front of the dispatch window, which is used to ensure that the picking robot can quickly complete the pickup task after receiving the order, reducing the delay in order processing.

[0029] In order to effectively complete order sorting, the layout information of the warehouse and the location information of the goods, including the location of the shelves, the width of the aisles, the placement of the goods, etc., can be called to formulate a reasonable route for the picking robot. The goal of path planning is to complete the picking task in the shortest time while avoiding collisions with other robots or obstacles. Based on the pre-set pickup window and dispatch window, the initial path planning is generated to ensure that the picking robot can efficiently complete the picking task within the specified time period.

[0030] After the initial path plan is generated, the plan needs to be verified and corrected by the path verification unit. The function of the path verification unit is to evaluate the feasibility and safety of the initial path, ensure that the task of the picking robot can be completed, and ensure that the picking robot will not encounter an impassable path or path conflict when performing the task. During the verification process, the actual pickup and delivery time of the picking robot will be detected to be within the theoretical pickup and delivery time. At the same time, temporary obstacles in the warehouse, the travel paths of other robots, or unforeseen problems caused by dynamic changes in the warehouse layout will be detected. By correcting the initial path plan, a more optimized preliminary path plan is generated to ensure that the picking robot can successfully complete the task in actual operation.

[0031] By setting the dispatch window and the pickup window, the pickup time can be optimized according to the real-time order data, and then the path planning is carried out according to the warehouse layout and cargo information, and the initial path is generated. The initial path planning is further corrected by the path verification unit, and finally the optimized preliminary path planning is obtained, ensuring that the picking robot can perform tasks efficiently and safely in a complex warehouse environment.

[0032] Furthermore, the present application also includes: Call the historical path planning of the robot cluster, extract the longest pickup-dispatch window record and the shortest pickup-dispatch window record in the historical path planning; remove outliers according to the longest pickup-dispatch window record and the shortest pickup-dispatch window record, and generate a credible window record; obtain intervals based on the credible window record, generate a pickup-dispatch window threshold, and build it into the path verification unit.

[0033] Specifically, in warehouse operations, robot clusters usually accumulate a large amount of path planning data, recording the time windows for robots to perform pickup and delivery tasks under different conditions. By calling historical path planning, the longest and shortest pickup-delivery window records can be extracted, and the time required for the robot cluster to complete the task under the best and worst conditions can be identified, thereby providing a reference for subsequent analysis and optimization, and further reflecting the influencing factors of warehouse environment, order complexity, robot performance, etc., which is the key basis for subsequent data processing.

[0034] After extracting the longest and shortest pick-up-dispatch window records, they are analyzed to identify and remove outliers. Outliers may be caused by a variety of factors, such as temporary equipment failures, abnormal order fluctuations, or sudden warehouse layout adjustments. Abnormal data, if not removed, may mislead subsequent path planning. Therefore, by comparing and analyzing the longest and shortest window records, outliers that are significantly different from the majority of records can be screened out and removed, thereby generating a more reliable set of window records that can more accurately reflect the performance of the robot under normal operating conditions.

[0035] Through further analysis of the trusted window records, a reasonable pickup-dispatch time window interval can be determined. The upper and lower limits of the interval are determined by the shortest and longest trusted window records in the historical data, representing the reasonable time range for the robot to complete the task under normal operating conditions. The generated pickup-dispatch window threshold will be used as an important parameter for path planning to ensure that the robot can complete the task efficiently while avoiding exceeding the expected time range. Finally, the pickup-dispatch window threshold will be built into the path verification unit to monitor and adjust the time planning during the robot task execution in real time, ensuring the stability and reliability of path planning.

[0036] By optimizing the current path planning through outlier elimination and interval acquisition, the generated pickup-dispatch window threshold will help the robot cluster complete the task more accurately and ensure the efficiency and stability of warehouse operations.

[0037] Furthermore, the present application also includes: The sum of the pickup window and the delivery window corresponding to the initial path planning is calculated to obtain the initial pickup-delivery window; whether the path verification unit is satisfied according to the initial pickup-delivery window is determined to obtain a satisfaction judgment result; if the satisfaction judgment result is satisfied, the initial path planning is retained and added to the preliminary path planning; if the satisfaction judgment result is not satisfied, the initial path planning is broken up and reassembled until the satisfaction judgment result is satisfied, and the initial path planning is obtained and added to the preliminary path planning.

[0038] Specifically, during the path planning process, an initial path plan is first generated, which includes the pickup and delivery tasks of each robot within a specified time period. In order to further analyze the rationality of the plan, each pickup window is summed with the corresponding delivery window to determine the total time required for the entire path planning or the overall time window for the pickup and delivery tasks. The initial pickup-delivery window is the basic data for path verification, which can reflect whether the overall time arrangement of the current path planning is reasonable.

[0039] After obtaining the initial pickup-dispatch window, the time length of the initial pickup-dispatch window is used to determine whether the preset conditions in the path verification unit are met. The path verification unit usually contains multiple time thresholds and rules to determine whether a path planning is completed within a reasonable time range. By comparing the initial pickup-dispatch window and the time standard in the verification unit, it is determined whether the current path planning is reasonable. This reasonableness judgment result directly affects the retention or adjustment of the initial path planning.

[0040] After completing the path verification, take corresponding actions based on the judgment results. If the judgment results show that the initial path planning meets the requirements of the verification unit, then the initial path planning will be directly retained and added to the preliminary path planning as one of the task plans to be finally executed. However, if the judgment results show that the initial path planning does not meet the requirements, the initial path planning is broken up and reassembled, the order of picking and dispatching in the path is readjusted, or the task allocation between robots is recalculated until the generated path planning can pass the inspection of the path verification unit. Through the iterative process of breaking up and reassembling, it is ultimately ensured that all path planning meets the requirements and can be executed efficiently.

[0041] By calculating the sum of the pickup and delivery windows, the rationality of the route planning can be judged, and the route can be adjusted and optimized when necessary, ultimately ensuring that all route planning can be executed efficiently and safely within the preset time frame, thereby improving the overall efficiency of warehouse operations.

[0042] Furthermore, the present application also includes: The path length is obtained according to the real-time updated route and the environmental changes in the warehouse, and the energy consumption of the robot is calculated according to the path length; the real-time order data is divided based on importance and urgency to generate order priorities; the order priority is used as a key parameter for path optimization, the path length and the robot energy consumption are used as secondary parameters for path optimization, the preliminary path planning is optimized, and the optimized path planning is obtained.

[0043] Specifically, in the warehouse, path planning needs to be adjusted according to the real-time updated routes and environmental changes. As shelves move or temporary obstacles appear, the original path may need to be modified. Therefore, the path length that the robot needs to travel is recalculated based on the latest path, and the energy consumption required by the robot to perform the task is further evaluated based on the path length, ensuring that the energy consumption calculation is based on the current optimized path and reflects the actual consumption in real-time operation.

[0044] The real-time order data is divided based on importance and urgency to generate order priorities. In warehouse management, the order processing order directly affects the overall efficiency. To this end, the real-time order data is analyzed, and the orders are prioritized based on factors such as customer demand, delivery time, and the importance of the order content for each order, which helps the system better schedule resources in route planning and prioritize the most critical and urgent orders, thereby ensuring the timely completion of important tasks.

[0045] When optimizing the path, order priority is used as the main optimization target to ensure that high-priority orders can be completed in the shortest time. At the same time, path length and robot energy consumption are considered as secondary parameters. On the basis of meeting priority requirements, the path is shortened as much as possible and energy consumption is reduced, thereby optimizing the preliminary path planning and finally generating an optimized path planning that can balance task priority and resource consumption.

[0046] The robot's energy consumption is calculated by adjusting the path length in real time, and the orders are prioritized as the basis for path optimization, ensuring that high-priority tasks are completed in the shortest time possible, while effectively managing energy consumption and path efficiency, thereby improving the efficiency of overall warehouse operations.

[0047] Furthermore, the present application also includes: The optimized path planning is traversed to extract a first path optimization result, and the path fitness of the first path optimization result is calculated; based on the path fitness, a cross-mutation of a path inferior solution in the first path optimization result toward a path superior solution is performed to generate a second path optimization result, and the second path optimization result is added to the optimized path planning.

[0048] Specifically, during the path optimization process, all generated optimized path plans are traversed, and the first path optimization results are extracted one by one. In order to evaluate the quality of the first path optimization result, the path fitness of the first path optimization result, that is, the fitness value, is calculated. Path fitness is a key indicator to measure whether the first path optimization result meets the optimization goal, and is evaluated based on the time window of pickup and delivery.

[0049] After obtaining the path fitness of the first path optimization result, the path pros and cons in the first path optimization result are further analyzed. If there is a poor path solution in the first path optimization result, that is, a poor path selection, it will be adjusted through the crossover mutation operation. Crossover mutation refers to replacing or reorganizing the inferior solution part into a better solution part, thereby improving the fitness of the overall path, and being able to generate a second path optimization result, so that the path planning is closer to the ideal optimal solution.

[0050] The second path optimization result after cross-mutation and fitness improvement will be added to the overall optimized path planning, and then gradually through optimization and iteration, the path planning will be more in line with the final optimization goal, ensuring that the robot can follow the optimal path when performing tasks, thereby improving the overall task execution efficiency and effectiveness.

[0051] Through traversal and fitness calculation, it is possible to identify and optimize inferior solutions in the path, improve the path quality through cross-mutation, and ultimately generate and integrate more optimized path planning to ensure the efficiency and accuracy of warehouse operations.

[0052] Furthermore, the present application also includes: The window length is calculated according to the pickup window and the dispatch window, and the dependent variable of the path fitness is generated according to the window length; the path fitness is obtained according to the dependent variable, and if the path fitness meets the path fitness threshold, a second path optimization result is obtained.

[0053] Specifically, in the process of path optimization, the length of the pickup window and the dispatch window are key time parameters. The window length of the pickup window and the dispatch window reflects the time required for the robot to complete a specific task and directly affects the overall efficiency of the path. By calculating the window length of the pickup window and the dispatch window, the compactness and rationality of the time arrangement in the path planning are determined. The length value of the window length will be used as the dependent variable of the path fitness. The dependent variable is an important factor in the fitness calculation, which determines the effectiveness of the path and the speed of task completion.

[0054] Once the window length is calculated and the dependent variable of the path fitness is generated, the fitness value of the path is calculated based on the dependent variable. Path fitness is an evaluation of the overall performance of path planning, covering factors such as time scheduling, energy consumption, and task priority. If the calculated path fitness value reaches the preset fitness threshold, it means that the first path optimization result meets the optimization requirements. Therefore, the first path optimization result that meets the fitness threshold is used as the second path optimization result, ensuring that the second path optimization result has a higher execution efficiency in actual operation.

[0055] By calculating the window length and converting it into a fitness dependent variable, the quality of the path planning can be evaluated more accurately. By evaluating the fitness and judging whether it meets the threshold, it is ensured that the path optimization result is in line with expectations and the resulting path planning can efficiently complete the task.

[0056] In summary, the cargo sorting path planning method for a picking robot provided in this application has the following technical effects: By setting a pickup window and a delivery window, a preliminary path planning is generated according to the pickup window and the delivery window; the preliminary path planning is used to assign tasks to the robot cluster to generate preliminary assigned tasks; the real-time updated route and environmental changes in the warehouse are obtained according to sensor monitoring to obtain an optimized path planning; the preliminary assigned tasks are adjusted according to the optimized path planning to obtain an optimized assigned task; the optimized assigned tasks are executed through a distributed coordination mechanism to achieve the technical goal of distributed coordinated scheduling, so as to effectively avoid scheduling bottlenecks when facing a large number of orders or complex tasks, and improve the task execution efficiency and the overall reliability of the system.

[0057] Embodiment 2: Based on the cargo sorting path planning method for a picking robot in the aforementioned embodiment, the present application also provides a cargo sorting path planning system for a picking robot, as shown in the attached Figure 2 ,include: A preliminary path planning generation module 11, the preliminary path planning generation module 11 is used to set a pickup window and a delivery window, and generate a preliminary path planning according to the pickup window and the delivery window; a preliminary task allocation generation module 12, the preliminary task allocation generation module 12 is used to allocate tasks to the robot cluster according to the preliminary path planning, and generate preliminary allocation tasks; an optimized path planning acquisition module 13, the optimized path planning acquisition module 13 is used to obtain real-time updated routes and environmental changes in the warehouse according to sensor monitoring, and obtain optimized path planning; an optimized allocation task acquisition module 14, the optimized allocation task acquisition module 14 is used to adjust the preliminary allocation tasks according to the optimized path planning, and obtain optimized allocation tasks; a task execution module 15, the task execution module 15 is used to execute the optimized allocation tasks through a distributed coordination mechanism.

[0058] Furthermore, the preliminary path planning generation module 11 in the cargo sorting path planning system for the picking robot is also used for: The dispatch window is set based on real-time order data, and the pickup window connected in front of the dispatch window is configured; the warehouse layout and cargo information are called, and path planning is performed according to the pickup window and the dispatch window to generate an initial path planning; the initial path planning is corrected by a path verification unit to obtain the preliminary path planning.

[0059] Furthermore, the preliminary path planning generation module 11 in the cargo sorting path planning system for the picking robot is also used for: Call the historical path planning of the robot cluster, extract the longest pickup-dispatch window record and the shortest pickup-dispatch window record in the historical path planning; remove outliers according to the longest pickup-dispatch window record and the shortest pickup-dispatch window record, and generate a credible window record; obtain intervals based on the credible window record, generate a pickup-dispatch window threshold, and build it into the path verification unit.

[0060] Furthermore, the preliminary path planning generation module 11 in the cargo sorting path planning system for the picking robot is also used for: The sum of the pickup window and the delivery window corresponding to the initial path planning is calculated to obtain the initial pickup-delivery window; whether the path verification unit is satisfied according to the initial pickup-delivery window is determined to obtain a satisfaction judgment result; if the satisfaction judgment result is satisfied, the initial path planning is retained and added to the preliminary path planning; if the satisfaction judgment result is not satisfied, the initial path planning is broken up and reassembled until the satisfaction judgment result is satisfied, and the initial path planning is obtained and added to the preliminary path planning.

[0061] Furthermore, the optimized path planning obtaining module 13 in the cargo sorting path planning system for the picking robot is also used for: The path length is obtained according to the real-time updated route and the environmental changes in the warehouse, and the energy consumption of the robot is calculated according to the path length; the real-time order data is divided based on importance and urgency to generate order priorities; the order priority is used as a key parameter for path optimization, the path length and the robot energy consumption are used as secondary parameters for path optimization, the preliminary path planning is optimized, and the optimized path planning is obtained.

[0062] Furthermore, the optimized path planning obtaining module 13 in the cargo sorting path planning system for the picking robot is also used for: The optimized path planning is traversed to extract a first path optimization result, and the path fitness of the first path optimization result is calculated; based on the path fitness, a cross-mutation of a path inferior solution in the first path optimization result toward a path superior solution is performed to generate a second path optimization result, and the second path optimization result is added to the optimized path planning.

[0063] Furthermore, the optimized path planning obtaining module 13 in the cargo sorting path planning system for the picking robot is also used for: The window length is calculated according to the pickup window and the dispatch window, and the dependent variable of the path fitness is generated according to the window length; the path fitness is obtained according to the dependent variable, and if the path fitness meets the path fitness threshold, a second path optimization result is obtained.

[0064] Each embodiment in this specification is described in a progressive manner, and each embodiment focuses on the differences from other embodiments. The cargo sorting path planning method and specific examples for the picking robot in the aforementioned embodiment 1 are also applicable to the cargo sorting path planning system for the picking robot in this embodiment. Through the aforementioned detailed description of the cargo sorting path planning method for the picking robot, those skilled in the art can clearly understand the cargo sorting path planning system for the picking robot in this embodiment, so for the sake of brevity of the specification, it will not be described in detail here. For the system disclosed in the embodiment, since it corresponds to the method disclosed in the embodiment, the description is relatively simple, and the relevant parts can be referred to the method part description.

[0065] The above description of the disclosed embodiments enables those skilled in the art to implement or use the present application. Various modifications to these embodiments will be apparent to those skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of the present application. Therefore, the present application will not be limited to the embodiments shown herein, but will conform to the widest scope consistent with the principles and novel features disclosed herein.

[0066] Obviously, those skilled in the art can make various changes and modifications to the present application without departing from the spirit and scope of the present application. Thus, if these modifications and variations of the present application belong to the scope of the present application and its equivalent technology, the present application is also intended to include these modifications and variations.

Claims

1. A cargo sorting path planning method for a picking robot, characterized in that: include: Setting a pickup window and a delivery window, and generating a preliminary route plan according to the pickup window and the delivery window; Allocate tasks to the robot cluster using the preliminary path planning to generate preliminary assigned tasks; Get real-time updates of routes and changes in warehouse environment based on sensor monitoring to obtain optimized path planning; Adjusting the preliminary assigned tasks according to the optimized path planning to obtain optimized assigned tasks; The optimization allocation task is performed through a distributed coordination mechanism.

2. The cargo sorting path planning method for a picking robot according to claim 1, characterized in that: The step of setting a pickup window and a delivery window, and generating a preliminary route plan according to the pickup window and the delivery window, includes: Setting the dispatch window based on real-time order data, and configuring the pickup window connected in front of the dispatch window; Calling warehouse layout and cargo information, performing path planning according to the pickup window and delivery window, and generating initial path planning; The initial path planning is corrected by a path verification unit to obtain the preliminary path planning.

3. The cargo sorting path planning method for a picking robot according to claim 2, characterized in that: Get the path validation unit, including: Calling the historical path planning of the robot cluster, and extracting the longest pickup-dispatch window record and the shortest pickup-dispatch window record in the historical path planning; Outliers are eliminated according to the longest pickup-dispatch window record and the shortest pickup-dispatch window record to generate a credible window record; Interval acquisition is performed based on the trusted window record, a pickup-dispatch window threshold is generated, and is built into the path verification unit.

4. The cargo sorting path planning method for a picking robot according to claim 2, characterized in that: The correcting the initial path planning by the path verification unit to obtain the preliminary path planning includes: Calculate the sum of the pickup window and the dispatch window corresponding to the initial path planning to obtain an initial pickup-dispatch window; Determine whether the path verification unit is satisfied according to the initial pickup-dispatch window, and obtain a satisfaction determination result; If the result of the satisfying judgment is satisfied, the initial path planning is retained and added to the preliminary path planning. If the result of the satisfying judgment is not satisfied, the initial path planning is broken up and reassembled until the result of the satisfying judgment is satisfied, and the initial path planning is obtained and added to the preliminary path planning.

5. The cargo sorting path planning method for a picking robot according to claim 1, characterized in that: The method of obtaining real-time updated routes and changes in the warehouse environment based on sensor monitoring to obtain optimized path planning includes: Obtaining a path length according to the real-time updated route and changes in the environment in the warehouse, and calculating the robot energy consumption according to the path length; Divide real-time order data based on importance and urgency to generate order priorities; The order priority is used as the key parameter for path optimization, the path length and the robot energy consumption are used as secondary parameters for path optimization, and the preliminary path planning is optimized to obtain the optimized path planning.

6. The cargo sorting path planning method for a picking robot according to claim 5, characterized in that: The obtaining of the optimized path planning comprises: Traversing the optimized path planning to extract a first path optimization result, and calculating the path fitness of the first path optimization result; Based on the path fitness, a crossover mutation is performed to convert the inferior path solution in the first path optimization result into an optimal path solution, a second path optimization result is generated, and the second path optimization result is added to the optimized path planning.

7. The cargo sorting path planning method for a picking robot according to claim 6, characterized in that: The performing cross-mutation of the inferior path solution in the first path optimization result toward the optimal path solution based on the path fitness to generate the second path optimization result includes: Calculating a window length according to the pickup window and the dispatch window, and generating a dependent variable of path fitness according to the window length; The path fitness is obtained according to the dependent variable, and if the path fitness meets a path fitness threshold, a second path optimization result is obtained.

8. A cargo sorting path planning system for a picking robot, characterized in that: The steps for implementing the cargo sorting path planning method for a picking robot according to any one of claims 1 to 7 include: A preliminary path planning generation module, the preliminary path planning generation module is used to set a pickup window and a delivery window, and generate a preliminary path planning according to the pickup window and the delivery window; A preliminary assigned task generation module, the preliminary assigned task generation module is used to assign tasks to the robot cluster according to the preliminary path planning to generate preliminary assigned tasks; An optimized path planning acquisition module, which is used to obtain real-time updated routes and changes in the warehouse environment based on sensor monitoring to obtain optimized path planning; An optimized assigned task obtaining module, wherein the optimized assigned task obtaining module is used to adjust the preliminary assigned tasks according to the optimized path planning to obtain optimized assigned tasks; A task execution module is used to execute the optimization allocation task through a distributed coordination mechanism.

Citation Information

Patent Citations

  • Multi-AGV anti-collision cooperative path planning method

    CN110989570A

  • Goods conveying method and device, electronic equipment and storage medium

    CN113387098A

  • Multi-AGV path evaluation planning method

    CN114047757A

  • Multi-AGV path planning method and device based on dynamic priority express distribution center

    CN115097843A

  • Path planning method and device based on multi-robot collaborative stacking operation

    CN117494919A

Cited By

  • Dynamic scheduling method for palletizing robot

    CN119849883A