Warehouse scheduling method and device, equipment, medium and product

Abstract

The invention discloses a warehouse scheduling method and device, equipment, a medium and a product, and relates to the technical field of warehouse management, the method is applied to a warehouse management system, and the method comprises the steps: receiving a carrying request, and carrying out the path planning through a pre-constructed warehouse area map according to the carrying request, and obtaining a transportation task; a scheduling forklift is matched based on the transportation task, the transportation task is sent to the scheduling forklift, the scheduling forklift carries out warehouse scheduling based on the transportation task, a scheduling report is generated when scheduling is completed, and the scheduling report is sent to the warehouse management system; and outputting a scheduling result based on the scheduling report, thereby solving the problems that task cooperation with the forklift cannot be realized, and the overall operation efficiency is affected in a large-scale and high-frequency carrying scene, and improving the warehouse scheduling efficiency.

Description

Technical Field

[0001] This application relates to the field of warehouse management technology, and in particular to a warehouse scheduling method, apparatus, equipment, medium and product. Background Technology

[0002] In the fields of warehousing and logistics and industrial handling, traditional cargo handling operations mainly rely on manually operated forklifts. This method involves operators manually controlling the forklifts to move, lift, and load / unload, thereby transferring goods within warehouses, workshops, and other settings. It is currently a relatively mature material handling solution and has been widely used in various production and warehousing locations.

[0003] However, traditional manual forklift operation has many limitations and cannot meet the high efficiency, safety and flexibility requirements of modern warehousing and logistics. First, the cost of warehousing environment transformation is high, and some scenarios require the installation of auxiliary facilities such as magnetic navigation tracks, which cannot flexibly adapt to dynamic changes in warehouse layout. Second, there are significant safety risks. During manual operation, collisions between forklifts and personnel, equipment or goods are prone to occur due to blind spots, operational errors or personnel fatigue. Finally, there are efficiency bottlenecks. Limited by the single-machine independent operation mode, it is impossible to achieve collaborative path planning and task allocation among multiple forklifts. In large-scale, high-frequency handling scenarios, the overall operation efficiency is greatly affected.

[0004] The above content is only used to help understand the technical solution of this application and does not represent an admission that the above content is prior art. Summary of the Invention

[0005] The main purpose of this application is to provide a warehouse scheduling method, apparatus, equipment, medium, and product, which aims to solve the technical problem that the overall operation efficiency is affected in large-scale, high-frequency handling scenarios due to the inability to coordinate tasks with forklifts.

[0006] To achieve the above objectives, this application proposes a warehouse scheduling method, which is applied to a warehouse management system, and the warehouse scheduling method includes: Receive a handling request, and based on the handling request, perform route planning using a pre-built warehouse area map to obtain a transportation task; Based on the transportation task, a forklift is matched and dispatched, and the transportation task is sent to the dispatched forklift. The dispatched forklift performs warehouse scheduling based on the transportation task. When the scheduling is completed, a scheduling report is generated and sent to the warehouse management system. The scheduling results are output based on the scheduling report.

[0007] In one embodiment, before the step of performing route planning using a pre-built warehouse map based on the handling request to obtain the transportation task, the method further includes: The warehouse map is received, and based on the warehouse map, a three-dimensional panoramic scan of the warehouse is performed by a laser scanning robot to obtain a digital map, which includes shelf coordinates, aisle information and load-bearing areas. Based on the rack coordinates, aisle information, and load-bearing area, an environmental assessment is conducted using warehouse environmental indicators to obtain a warehouse environmental report. Based on the aforementioned reservoir area environmental report, environmental optimization strategies, restricted driving areas, and charging areas were determined. The layout of the warehouse is optimized by using the aforementioned environmental optimization strategy, driving restricted areas, and charging areas to obtain an optimized warehouse. According to the preset map update time, the laser scanning robot performs a three-dimensional panoramic scan of the optimized warehouse to obtain a warehouse area map.

[0008] In one embodiment, the step of obtaining the transportation task by performing route planning using a pre-built warehouse map based on the transportation request includes: The task information is obtained by parsing the transport request, and the task information includes the task type, the number of tasks, and the task priority; The work area is determined based on the task type, and the forklift type is determined based on the number of tasks and task priority. Based on the work area and forklift type, a path planning algorithm is used to calculate the work path on the warehouse map. Transportation tasks are generated based on the work area, forklift type, and work path.

[0009] In one embodiment, after the step of matching and dispatching a forklift based on the transportation task and sending the transportation task to the dispatched forklift, the method further includes: Receive the estimated working time sent by the dispatched forklift; The estimated time is determined based on the working time specified in the handling request; When the estimated duration exceeds the specified working duration, a backup forklift is matched to calculate the working duration and obtain the matching result. Based on the matching result, a scheduling instruction is generated and sent to the scheduling forklift. The scheduling forklift parses the scheduling instruction to obtain the final working time, final transport quantity, and final transport weight, and generates the final transportation task based on the final working time, final transport quantity, and final transport weight.

[0010] Furthermore, to achieve the above objectives, this application also proposes a warehouse scheduling method, which is applied to scheduling forklifts, and the warehouse scheduling method includes: The system receives transportation tasks, which are initiated by the warehouse management system. The system receives handling requests and performs route planning based on the handling requests using a pre-built warehouse map to obtain transportation tasks. Based on the transportation tasks, the system matches and dispatches forklifts and sends the transportation tasks to the dispatched forklifts. Warehouse scheduling is performed based on the transportation task, and a scheduling report is generated upon completion of the scheduling. The scheduling report is sent to the warehouse management system, which then outputs the scheduling result based on the scheduling report.

[0011] In one embodiment, energy consumption is calculated based on the work path, quantity, and weight of the transport task to obtain the estimated power consumption. The estimated power consumption is analyzed by the battery management program of the dispatch forklift to obtain the number of charging times for the transportation task. Based on the number of charging cycles and the duration of the transportation tasks, the estimated working time is obtained. The estimated working time is sent to the warehouse management system, which then determines whether the estimated working time meets the scheduling requirements. Receive the scheduling instructions from the warehouse management system, and parse the scheduling instructions to obtain the final working time, final quantity handled, and final weight handled; The final transportation task is generated based on the final working time, the final quantity handled, and the final weight handled.

[0012] Furthermore, to achieve the above objectives, this application also proposes a warehouse scheduling device, which is applied to a warehouse management system, and the warehouse scheduling device includes: The receiving module is used to receive a handling request and, based on the handling request, perform route planning using a pre-built warehouse map to obtain a transportation task. The scheduling module is used to match and schedule forklifts based on the transportation task, and send the transportation task to the scheduled forklifts. The scheduled forklifts then perform warehouse scheduling based on the transportation task. Upon completion of the scheduling, a scheduling report is generated and sent to the warehouse management system. The output module is used to output the scheduling result based on the scheduling report.

[0013] In addition, to achieve the above objectives, this application also proposes a warehouse scheduling device, the device comprising: a memory, a processor, and a computer program stored in the memory and executable on the processor, the computer program being configured to implement the steps of the warehouse scheduling method as described above.

[0014] In addition, to achieve the above objectives, this application also proposes a storage medium, which is a computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, it implements the steps of the warehouse scheduling method described above.

[0015] In addition, to achieve the above objectives, this application also provides a computer program product, which includes a computer program that, when executed by a processor, implements the steps of the warehouse scheduling method described above.

[0016] One or more technical solutions proposed in this application have at least the following technical effects: This application proposes a warehouse scheduling method, apparatus, equipment, medium, and product. The method is applied to a warehouse management system. It receives a handling request, performs route planning based on the request using a pre-built warehouse map, and obtains a transportation task. A forklift is matched and dispatched based on the transportation task, and the forklift performs warehouse scheduling based on the task. Upon completion of scheduling, a scheduling report is generated and sent to the warehouse management system. A scheduling result is output based on the scheduling report. Thus, upon receiving a handling request, route planning is performed based on the request and a pre-built warehouse map to obtain a transportation task. Subsequently, a corresponding forklift is matched and dispatched, achieving task coordination with the forklift. Finally, warehouse scheduling is performed using the forklift, and a scheduling report is returned by the forklift, which is then used to output the scheduling result. This solves the problem of insufficient task coordination with forklifts, which negatively impacts overall operational efficiency in large-scale, high-frequency handling scenarios, thereby improving warehouse scheduling efficiency. Attached Figure Description

[0017] The accompanying drawings, which are incorporated in and form part of this specification, illustrate embodiments consistent with this application and, together with the description, serve to explain the principles of this application.

[0018] To more clearly illustrate the technical solutions in the embodiments of this application or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, for those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0019] Figure 1 This is a flowchart illustrating an embodiment of the warehouse scheduling method of this application. Figure 2 This is a flowchart illustrating Embodiment 2 of the warehouse scheduling method of this application; Figure 3 A simplified flowchart illustrating the warehouse scheduling method provided in Embodiment 2 of this application; Figure 4 This is a schematic diagram of the module structure of the warehouse scheduling device according to an embodiment of this application; Figure 5 This is a schematic diagram of the equipment structure of the hardware operating environment involved in the warehouse scheduling method in this application embodiment.

[0020] The purpose, features, and advantages of this application will be further explained in conjunction with the embodiments and with reference to the accompanying drawings. Detailed Implementation

[0021] It should be understood that the specific embodiments described herein are merely illustrative of the technical solutions of this application and are not intended to limit this application.

[0022] To better understand the technical solution of this application, a detailed description will be provided below in conjunction with the accompanying drawings and specific implementation methods.

[0023] The main solution of this application embodiment is as follows: Receive a warehouse map of the warehouse; based on the warehouse map, perform a 3D panoramic scan of the warehouse using a laser scanning robot to obtain a digital map, which includes shelf coordinates, aisle information, and load-bearing areas; perform an environmental assessment based on the shelf coordinates, aisle information, and load-bearing areas using warehouse environmental indicators to obtain a warehouse environmental report; determine environmental optimization strategies, restricted driving areas, and charging areas based on the warehouse environmental report; optimize the layout of the warehouse using the environmental optimization strategies, restricted driving areas, and charging areas to obtain an optimized warehouse; perform a 3D panoramic scan of the optimized warehouse using the laser scanning robot according to a preset map update time to obtain a warehouse map. Parse the handling request to obtain task information, which includes task type, task quantity, and task priority; determine the work area based on the task type, and determine the forklift type based on the task quantity and task priority; calculate the work path based on the work area and forklift type using a path planning algorithm on the warehouse map; generate a transportation task based on the work area, forklift type, and work path. The system receives the estimated working time sent by the dispatched forklift; judges the estimated working time based on the working time specified in the handling request; when the estimated working time exceeds the specified working time, it matches a backup dispatched forklift to calculate the working time and obtain a matching result; it generates a dispatch instruction based on the matching result and sends the dispatch instruction to the dispatched forklift, which parses the dispatch instruction to obtain the final working time, final handling quantity, and final handling weight, and generates a final transportation task based on the final working time, final handling quantity, and final handling weight. The system also receives transportation tasks, where the warehouse management system receives handling requests, performs path planning based on a pre-built warehouse map to obtain transportation tasks, matches dispatched forklifts based on the transportation tasks, and sends the transportation tasks to the dispatched forklifts; it performs warehouse scheduling based on the transportation tasks, generates a scheduling report upon completion, and sends the scheduling report to the warehouse management system, which outputs scheduling results based on the scheduling report.Energy consumption is calculated based on the work path, quantity, and weight of the transport task to obtain the estimated power consumption. The battery management program of the dispatching forklift analyzes the estimated power consumption to determine the number of charging cycles for the transport task. Based on the number of charging cycles and the transport task's duration, the estimated working time is obtained. The estimated working time is sent to the warehouse management system, which determines whether it meets the scheduling requirements. The system receives scheduling instructions from the warehouse management system, parses them to obtain the final working time, final quantity, and final weight of the transported goods. The final transport task is then generated based on these parameters. This solves the problem of inability to coordinate tasks with forklifts, which negatively impacts overall operational efficiency in large-scale, high-frequency transport scenarios. It enables warehouse scheduling and improves scheduling efficiency. Based on the present invention, addressing the real-world problems of inefficient warehouse scheduling due to the inability to achieve collaborative path planning and task allocation among multiple forklifts, and the risk of collisions between forklifts and personnel, equipment, or goods caused by blind spots, operational errors, or personnel fatigue during manual operation, the present invention proposes a warehouse scheduling method. The effectiveness of this method was verified during warehouse scheduling, and the efficiency of warehouse scheduling was significantly improved.

[0024] In this embodiment, for ease of description, the following description will focus on the warehouse scheduling device as the executing entity.

[0025] Due to the limitations of traditional manually operated forklifts in existing technologies, the efficiency and safety of warehousing logistics and industrial handling still need to be improved. One issue is the cost of modifying the warehousing environment. Some scenarios require the installation of auxiliary facilities such as magnetic navigation tracks, which cannot flexibly adapt to dynamically changing warehouse layouts, leading to a decrease in the adaptability of the operating mode. Another issue is safety risks. During manual operation, collisions between forklifts and personnel, equipment, or goods are prone to occur due to blind spots, operational errors, or personnel fatigue. Without targeted safety measures, operational safety will also decrease significantly. Furthermore, there is the bottleneck of operational efficiency. Precise and efficient handling operations require the coordinated cooperation of multiple devices, but the traditional mode is limited to independent operation of a single machine, making it impossible to achieve collaborative path planning and task allocation among multiple forklifts. In large-scale, high-frequency handling scenarios, this also affects overall operational efficiency. Therefore, in current modern warehousing and logistics scenarios, there are also challenges in mode adaptability. Since different warehousing scenarios have different layout characteristics, handling needs, and operational intensity, if the traditional manually operated forklift operating mode is not optimized for specific scenarios, its efficiency and safety will also decrease.

[0026] This application provides a solution that, upon receiving a handling request, performs route planning based on the request and a pre-built warehouse map to obtain a transportation task; matches and dispatches a forklift based on the transportation task, and sends the transportation task to the dispatched forklift; the dispatched forklift then performs warehouse scheduling based on the transportation task; upon completion of scheduling, a scheduling report is generated and sent to the warehouse management system; and a scheduling result is output based on the scheduling report. Thus, upon receiving a handling request, route planning is performed based on the request and a pre-built warehouse map to obtain a transportation task. Subsequently, a corresponding dispatched forklift is matched with the transportation task, and the transportation task is sent to the dispatched forklift, achieving task coordination with the forklift. Finally, warehouse scheduling is performed by the dispatched forklift, and a scheduling report is returned by the dispatched forklift, from which the scheduling result is output. This solves the problem of insufficient task coordination with forklifts, which affects overall operational efficiency in large-scale, high-frequency handling scenarios, improving warehouse scheduling efficiency and providing users with better service.

[0027] Based on this, the embodiments of this application provide a warehouse scheduling method, referring to... Figure 1 , Figure 1 This is a flowchart illustrating the first embodiment of the warehouse scheduling method of this application.

[0028] In this embodiment, the warehouse scheduling method is applied to a warehouse management system, and the warehouse scheduling method includes steps S01~S03: Step S01: Receive a handling request; based on the handling request, perform route planning using a pre-built warehouse map to obtain a transportation task. Before the method of this embodiment is described, it should be clear that in the fields of warehousing and logistics and industrial handling, traditional cargo handling mainly relies on manually driven forklifts. Operators manually control the driving, lifting, and loading / unloading actions to transfer goods in warehouses, workshops, and other scenarios. This is a mature and widely used material handling solution. However, this model has many limitations and cannot meet the high efficiency, safety, and flexibility requirements of modern warehousing. First, the cost of warehousing environment transformation is high, and some scenarios require the installation of facilities such as magnetic navigation tracks, which cannot adapt to dynamic layout adjustments. Second, there are significant safety risks. Manual operation is prone to collision accidents due to blind spots, errors, or fatigue. Third, there are efficiency bottlenecks. Single-machine independent operation cannot achieve multi-forklift collaborative path planning and task allocation, and efficiency is affected in large-scale, high-frequency handling scenarios.

[0029] To address the aforementioned issues, this embodiment receives handling requests within the warehouse management system. It then uses a pre-built warehouse map to plan routes for these requests, resulting in transportation tasks. The warehouse map contains static data such as the location information of each area, aisle width, obstacle distribution, and shelf layout. Simultaneously, it updates dynamic information in real-time, including the current location and task status of each handling device. During route planning, the system comprehensively considers factors such as the shortest path, obstacle avoidance rules, equipment load balancing, and task priority. An algorithm calculates the optimal transportation route to ensure efficient and safe execution of transportation tasks. For example, when multiple handling requests occur simultaneously, the system prioritizes them based on their urgency and the weight and volume of the goods, assigning the most suitable handling equipment to each task to avoid conflicts and waiting times, thereby improving overall warehouse handling efficiency.

[0030] Step S02: Match and dispatch forklifts based on the transportation task, and send the transportation task to the dispatch forklifts. The dispatch forklifts perform warehouse scheduling based on the transportation task. When the scheduling is completed, a scheduling report is generated and sent to the warehouse management system. After a transportation task is generated, forklifts can be matched and the task sent to them. The forklifts then execute the task. Once the task is completed, a dispatch report is generated and sent to the warehouse management system. The dispatch report details the execution time, the starting and ending points of the goods, the forklift number, the route, the task completion status, and any anomalies encountered. Upon receiving the dispatch report, the warehouse management system stores and analyzes this information to optimize and improve the warehouse dispatch process. It also provides managers with accurate decision-making support, helping them better understand the overall warehouse operations.

[0031] Step S03: Output the scheduling result based on the scheduling report.

[0032] Finally, to provide managers with accurate decision-making support, the warehouse management system in this embodiment outputs scheduling results based on scheduling reports. The presentation format of these results can be diversified according to actual needs, such as displaying them as data reports, visualization charts, or dynamic dashboards. Data reports systematically list the specific values ​​of various scheduling indicators, including task completion rate, average transportation time, and forklift utilization rate. Visualization charts, such as bar charts, line charts, and pie charts, intuitively present the comparative relationships and trends between data, helping managers quickly identify the advantages and disadvantages in the scheduling process. Dynamic dashboards can update scheduling data in real time, allowing managers to keep abreast of the latest developments in warehouse scheduling. These different forms of scheduling results not only clearly reflect the overall efficiency of warehouse scheduling but also provide managers with comprehensive and accurate reference information for resource allocation adjustments, work process optimization, and emergency plan development, further improving the scientific and efficient nature of warehouse management.

[0033] Specifically, before step S01 above, which involves performing route planning based on a pre-built warehouse map to obtain the transportation task according to the handling request, the method further includes: Step S0101: Receive the warehouse map of the warehouse. Based on the warehouse map, perform a three-dimensional panoramic scan of the warehouse using a laser scanning robot to obtain a digital map. The digital map includes shelf coordinates, aisle information, and load-bearing areas. Step S0102: Based on the shelf coordinates, aisle information, and load-bearing area, conduct an environmental assessment using warehouse environmental indicators to obtain a warehouse environmental report; Step S0103: Determine environmental optimization strategies, restricted driving areas, and charging areas based on the reservoir area environmental report; Step S0104: Optimize the layout of the warehouse using the environmental optimization strategy, driving restricted areas, and charging areas to obtain an optimized warehouse; Step S0105: According to the preset map update time, the laser scanning robot performs a three-dimensional panoramic scan of the optimized warehouse to obtain a warehouse area map.

[0034] First, after receiving the initial warehouse map, a 3D panoramic scan of the warehouse is performed using a laser SLAM scanner (the core component of the laser scanning robot) with a resolution of 0.05m. This generates a digital map that includes the three-dimensional coordinates of the shelves, aisle width (which must meet the standard of ≥2.5m), and ground load-bearing capacity of ≥3 tons, providing accurate spatial data for subsequent evaluation.

[0035] Subsequently, based on the shelf coordinates, aisle information, and load-bearing areas in the digital map, and combined with warehouse environmental indicators (such as aisle traffic efficiency, load-bearing matching degree, and safety distance compliance), an assessment was conducted, and a "Warehouse Environmental Assessment Report" was generated. At the same time, a dynamic obstacle statistics section was added to record the average daily personnel flow frequency in the warehouse (with 8:00-10:00 AM as the peak period) and the location of temporary storage areas (such as the northwest side of Zone B where materials awaiting inspection are stored every Wednesday), forming a "Dynamic Environmental Interference Analysis Table" to improve the assessment dimensions.

[0036] Next, based on the environmental assessment report and dynamic disturbance analysis results, environmental optimization strategies (such as aisle widening suggestions and rack layout adjustment plans) were determined, and forklift driving restricted areas (prioritizing fire lanes, densely populated areas, etc.) and charging area layout were defined (planned according to the standard of one fast charging pile for every five forklifts).

[0037] Then, based on the above-mentioned environmental optimization strategies, driving restricted areas and charging areas planning, the physical layout of the warehouse is adjusted, such as optimizing the shelf spacing to match the aisle width requirements and dividing fixed temporary stacking areas to avoid interfering with passage, ultimately forming an optimized warehouse space layout.

[0038] Finally, a preset map update time is set (which can be flexibly adjusted based on peak periods of dynamic obstacle statistics, temporary stacking cycles, etc.). The optimized warehouse is periodically scanned in 3D by a laser scanning robot, and the static spatial data and dynamic interference information in the warehouse map are updated synchronously to ensure the timeliness and accuracy of the map.

[0039] This achieves the core tasks of physical environment modeling (high-precision scanning and layout optimization) and digital mapping of business processes (dynamic data statistics and report output), providing accurate environmental data for subsequent warehouse scheduling.

[0040] More specifically, step S01 above, which involves performing route planning based on a pre-built warehouse map to obtain the transportation task according to the handling request, includes: Step S011: Parse the transport request to obtain task information, which includes task type, number of tasks, and task priority; Step S012: Determine the work area based on the task type, and determine the forklift type based on the number of tasks and task priority; Step S013: Based on the work area and forklift type, a path planning algorithm is used to calculate the path on the warehouse map to obtain the work path; Step S014: Generate a transportation task based on the work area, forklift type, and work path.

[0041] First, the handling request is parsed to obtain the task type (such as inbound, outbound, and transfer), task quantity, and task priority. In addition, task timeliness requirements (such as emergency outbound requiring completion within 2 hours) and cargo attribute information (such as cargo weight, volume, fragility, and temperature control requirements) are added. Through structured field extraction technology, the fuzzy handling request is transformed into standardized task information containing basic parameters and special requirements, providing comprehensive data support for subsequent steps.

[0042] Then, after determining the core work area based on the task type, the forklift type is determined by combining static parameters such as the aisle width and load-bearing limit of the area in the warehouse map. At the same time, the forklift type is determined by comprehensively considering the task quantity (e.g., 10 pallets or 2 pallets per trip), task priority (urgent / normal), and cargo attributes (e.g., heavy cargo requires a forklift with a load capacity of ≥5 tons, and fragile goods require a forklift with a buffer device). Forklift load matching verification (ensuring that the forklift's rated load is ≥1.2 times the total weight of the cargo safety factor) and equipment status screening (prioritizing forklifts with a battery level ≥70% and no fault warnings) are added to improve matching accuracy.

[0043] Then, based on the work area boundary and forklift type (e.g., narrow aisle forklifts can adapt to 1.8m aisles, while ordinary forklifts require ≥2.5m aisles), the A* path planning algorithm, which integrates dynamic obstacle information, is used to calculate the path. The algorithm embeds real-time updated data from the "Dynamic Environmental Interference Analysis Table," such as avoiding passages during the peak personnel flow period from 8:00 to 10:00 AM, detouring around temporary storage areas, and planning alternative paths (which can be seamlessly switched when the main path is abnormal). The algorithm also calculates the path time and estimated energy consumption to obtain a work path with triple guarantees of optimality, safety, and stability.

[0044] Finally, based on the work area (including specific shelf numbers and loading / unloading point coordinates), the matched forklift numbers, and the optimized work path, a structured transportation task is generated, which includes the task execution order (such as sorting in sequence according to the path when there are multiple loading / unloading points), key node time windows (such as arriving in densely populated areas during off-peak hours), and special operation prompts (such as handling fragile items with care and monitoring temperature-controlled goods throughout the process). At the same time, path energy consumption prediction data is attached to provide a reference for subsequent forklift operations and power management.

[0045] These steps have enabled the upgrading of transportation tasks from basic planning to precise adaptation, improving the flexibility and reliability of warehouse scheduling.

[0046] Further, after step S02 above, which involves matching and scheduling forklifts based on the transportation task and sending the transportation task to the scheduled forklifts, the method further includes: Step S0201: Receive the estimated working time sent by the dispatched forklift; Step S0202: Determine the estimated duration based on the working duration specified in the handling request; Step S0203: When the estimated duration exceeds the specified working duration, a backup dispatch forklift is matched to calculate the working duration and obtain the matching result. Step S0204: Generate a scheduling instruction based on the matching result, send the scheduling instruction to the scheduling forklift, and have the scheduling forklift parse the scheduling instruction to obtain the final working time, final transport quantity, and final transport weight, and generate the final transportation task based on the final working time, final transport quantity, and final transport weight.

[0047] When receiving the estimated working time sent by the dispatched forklift, the warehouse dispatch system simultaneously obtains the time composition details (including travel time, loading and unloading time, and dynamic waiting time, among which dynamic waiting time is related to the peak personnel period and temporary storage area occupancy in the "Dynamic Environmental Interference Analysis Table"), and performs a reasonable verification of the estimated time. If the time of a certain period deviates from the average of similar historical tasks by ±20%, a secondary calculation request is triggered, and the forklift side resubmits the corrected estimated time based on real-time environmental data to ensure the accuracy of the basic data.

[0048] Subsequently, based on the working time specified in the transportation request, a three-level judgment threshold is introduced: the first-level threshold is 90% of the specified time (warning line), the second-level threshold is the specified time (pass line), and the third-level threshold is 110% of the specified time (emergency line). If the estimated time is less than or equal to the first-level threshold, the task is directly confirmed. If it is between the first-level and second-level thresholds, a "dynamic traffic alert" is added. If it exceeds the second-level threshold (i.e., the estimated time is greater than the specified time), it enters the backup scheduling process. If it exceeds the third-level threshold, the high-priority task scheduling channel is triggered first to ensure the timeliness of emergency tasks.

[0049] Similarly, when matching backup forklifts, a three-dimensional weighted algorithm is used. Dimension 1 is the straight-line distance between the forklift and the work area (weight 40%), dimension 2 is the current battery level and remaining working time of the forklift (weight 30%), and dimension 3 is the time completion rate of the forklift's historical similar tasks (weight 30%). The top 3 backup forklifts are selected. At the same time, a task splitting logic is added. If a single backup forklift still cannot meet the time requirement, the original transportation task is split into 2-3 sub-tasks according to the correlation of the goods batches. These sub-tasks are assigned to the main forklift and 1-2 backup forklifts respectively. The time of each sub-task and the time consumption for coordination are calculated to obtain the matching result of "single replacement" or "multiple coordination".

[0050] Finally, when generating scheduling instructions based on the matching results, in addition to the final working time, final quantity handled, and final weight handled, additional collaborative operation rules (such as the operation sequence when multiple forklifts are involved, the avoidance interval between loading and unloading points, and the task connection time nodes) and timeliness monitoring trigger conditions (such as automatically pushing an early warning to the warehouse management system when a subtask times out by 10 minutes). The scheduling instructions adopt a standardized JSON format to ensure parsing efficiency on the forklift side, and are simultaneously synchronized to the system task dashboard to achieve visual tracking of the scheduling process.

[0051] This embodiment, through the above-described scheme, specifically receives a handling request, performs route planning based on the request using a pre-built warehouse map to obtain a transportation task, matches and sends the transportation task to the dispatched forklift, and the dispatched forklift performs warehouse scheduling based on the transportation task. Upon completion of scheduling, a scheduling report is generated and sent to the warehouse management system, and a scheduling result is output based on the scheduling report. Thus, upon receiving a handling request, route planning is performed based on the request and a pre-built warehouse map to obtain a transportation task. Subsequently, a corresponding dispatched forklift is matched and the transportation task is sent to the dispatched forklift, achieving task coordination with the forklift. Finally, warehouse scheduling is performed by the dispatched forklift, and a scheduling report is returned by the dispatched forklift, which is then used to output the scheduling result. This solves the problem of insufficient task coordination with forklifts, which affects overall operational efficiency in large-scale, high-frequency handling scenarios, thereby improving the efficiency of warehouse scheduling.

[0052] Based on the first embodiment of this application, in the second embodiment of this application, the content that is the same as or similar to the first embodiment described above can be referred to the above description, and will not be repeated hereafter. Based on this, please refer to... Figure 2 The warehouse scheduling method is applied to scheduling forklifts, and the warehouse scheduling method includes steps S04~S06: Step S04: Receive transportation task. The transportation task is obtained by the warehouse management system receiving the handling request, performing route planning based on the handling request using a pre-built warehouse map, matching and dispatching forklifts based on the transportation task, and sending the transportation task to the dispatched forklifts. Step S05: Perform warehouse scheduling according to the transportation task, and generate a scheduling report when the scheduling is completed; Step S06: The scheduling report is sent to the warehouse management system, which then outputs the scheduling result based on the scheduling report.

[0053] After the dispatch forklift receives the transportation task issued by the warehouse management system, it first performs structured parsing of the task through the forklift's onboard terminal, extracting the work area coordinates, forklift type matching check code, work path nodes (including passageways and loading / unloading points), and special operating requirements (such as operation specifications for fragile and heavy goods). At the same time, it initiates a task integrity check. If there are missing key parameters (such as unclear loading / unloading point coordinates) or mismatches with the forklift hardware configuration (such as insufficient forklift load), it immediately sends a "task correction request" to the warehouse management system along with specific problem items. After the check passes, the work path is imported into the forklift navigation module, and the path nodes are recalibrated using real-time laser SLAM scanning data to ensure that the path is consistent with the current warehouse environment.

[0054] Then, when executing warehouse scheduling based on transportation tasks, a real-time operation monitoring mechanism is introduced. Sensors on the forklifts collect data in real time on driving speed, loading and unloading time, remaining battery power, and dynamics of surrounding obstacles (such as sudden personnel crossing or temporary cargo stacking). When a deviation from the preset path of ±0.3m or a battery power of less than 20% is detected, an audible and visual warning is automatically triggered and the operation is suspended. The abnormal information is simultaneously pushed to the warehouse management system. After scheduling is completed, a multi-dimensional scheduling report is generated, which includes "basic execution data" (task completion time, actual handling quantity / weight), "process monitoring data" (abnormal event records and handling results, energy consumption curve), and "environmental interaction data" (frequency of personnel movement in the work area, path passage efficiency). The report also needs to indicate the task completion quality rating (based on loading and unloading accuracy and timeliness compliance rate).

[0055] Finally, the scheduling report is sent to the warehouse management system using an encryption protocol (such as SSL / TLS) to ensure data transmission security. After receiving the report, the warehouse management system outputs basic scheduling results (task completion / incomplete, time consumption statistics), and adds report data linkage analysis. It associates the energy consumption data in the report with the path planning algorithm to optimize the energy consumption prediction model of subsequent paths, updates abnormal event records to the "Dynamic Environmental Interference Analysis Table" to provide a basis for dynamic updates of the warehouse map, and adjusts the priority matching weight of the corresponding forklifts according to the task completion quality rating (such as prioritizing matching high-priority tasks with A-level forklifts), forming a closed loop from operation to feedback to optimization.

[0056] The above solutions can enhance the collaboration between forklifts and warehouse management systems, thereby improving the overall intelligence level of warehouse scheduling.

[0057] Specifically, before step S05 above, which involves performing warehouse scheduling based on the transportation task and generating a scheduling report upon completion of the scheduling, the method includes: Step S0501: Based on the work path, quantity and weight of the transport task, energy consumption is calculated to obtain the estimated power consumption. Step S0502: The estimated power consumption is analyzed by the battery management program of the dispatch forklift to obtain the number of charging times for the transportation task. Step S0503: Based on the number of charging cycles and the transportation task, perform a duration analysis to obtain the estimated working time. Step S0504: The estimated working time is sent to the warehouse management system, which then determines whether the estimated working time meets the scheduling requirements. Step S0505: Receive the scheduling instruction from the warehouse management system, and parse the scheduling instruction to obtain the final working time, final handling quantity, and final handling weight; Step S0506: Generate the final transportation task based on the final working time, final transport quantity, and final transport weight.

[0058] Based on the work path, quantity, and weight of the transport task, a four-factor weighted energy consumption calculation method is introduced. In addition to the basic parameters, three dynamic parameters are added: forklift load rate (cargo weight / forklift rated load), path slope coefficient (extracted from the undulation data of the passage in the warehouse map), and passage congestion correction factor (related to the peak-hour traffic efficiency in the "Dynamic Environmental Interference Analysis Table"). The weights of each parameter are as follows: transport weight 40%, load rate 25%, path slope 15%, and congestion correction 20%. The estimated power consumption is calculated through a preset energy consumption coefficient matrix (different coefficients correspond to different forklift models), and an "energy consumption distribution curve" is output, marking high-energy-consuming sections (such as steep slopes and congestion points) in the path.

[0059] Subsequently, the battery management program receives the estimated power consumption and combines it with the forklift's current remaining power (real-time data collection), the charging efficiency of the fast charging station (e.g., charging to 80% in 15 minutes), and the queuing probability in the charging area (based on historical data statistics) to analyze the number of charging sessions. It introduces a fragmented charging strategy. If the estimated power consumption is close to the remaining power but not completely depleted, it determines whether 5%-10% of the power can be replenished at the nearest fast charging station during task breaks (e.g., loading and unloading waiting periods), thereby reducing the number of full charging sessions. If a full charge is required, it simultaneously plans the charging time (avoiding peak hours in the charging area). Finally, it outputs a charging plan that includes the number of charging sessions, the duration of each charging session, and the recommended charging time.

[0060] Furthermore, the duration analysis in this embodiment no longer simply adds the number of charging attempts and the basic task duration. Instead, it establishes a coupled model of energy consumption, charging, and path. It adds the estimated operation time corresponding to the power consumption, the total charging time in the charging plan, and the dynamic path time (such as the increase in time due to reduced travel speed during peak hours) to the calculation. At the same time, it reserves 10% of the elastic time (to cope with sudden charging queuing or path interference). Finally, it obtains the estimated working time, which includes details of operation time, charging time, and elastic time, and marks the proportion of each time period. After sending the estimated working time and detailed data to the warehouse management system, it receives the duration verification results returned by the system. If the scheduling requirements are met, it simultaneously obtains the energy consumption optimization suggestions issued by the system (such as adjusting some paths to avoid high-energy-consuming sections). If the requirements are not met, it receives the duration compression target and optimization direction (such as whether it is allowed to split tasks or adjust charging time periods) from the system, providing a basis for subsequent instruction parsing.

[0061] Then, after receiving the scheduling instructions from the warehouse management system, in addition to parsing the final working time, handling quantity and weight, a parameter limit check is added to verify whether the final handling weight exceeds 90% of the forklift's rated load (with safety redundancy) and whether the final working time is less than the forklift's remaining working time (including after charging). If any parameter exceeds the limit, a safety adaptation warning is immediately sent to the system and parameter adjustment suggestions are proposed. After the check passes, the final parameters are pre-matched with the forklift's hardware control module to ensure that the execution instructions can be responded to accurately.

[0062] Finally, when generating the final transportation task, energy consumption control nodes are added to the basic parameters, marking the road sections where energy consumption needs to be reduced (such as deceleration prompts on steep slopes), the task connection points for recommended charging periods (such as completing a loading and unloading task before charging), and embedding real-time energy consumption monitoring thresholds (such as triggering an early warning when the energy consumption of a certain road section exceeds the estimated 15%), so that the final task is both executable and energy consumption controllable.

[0063] This embodiment, through the above-described scheme, specifically involves receiving transportation tasks. The transportation task is initiated by the warehouse management system, which receives a handling request. Based on the handling request, a route is planned using a pre-built warehouse map to obtain the transportation task. A dispatch forklift is then matched and sent to the dispatch forklift. Warehouse scheduling is performed based on the transportation task, and a scheduling report is generated upon completion. This scheduling report is then sent to the warehouse management system, which outputs the scheduling result based on the report. Thus, upon receiving a handling request, route planning is performed based on the request and a pre-built warehouse map to obtain the transportation task. Subsequently, a corresponding dispatch forklift is matched and sent to the dispatch forklift, achieving task coordination with the forklift. Finally, warehouse scheduling is performed using the dispatch forklift, and a scheduling report is returned by the dispatch forklift, which is then used to output the scheduling result. This solves the problem of insufficient task coordination with forklifts, which negatively impacts overall operational efficiency in large-scale, high-frequency handling scenarios, thereby improving the efficiency of warehouse scheduling.

[0064] For example, to help understand the implementation flow of the warehouse scheduling method obtained by combining this embodiment with the above embodiment one, please refer to... Figure 3 , Figure 3 A simplified flowchart of a warehouse scheduling method is provided, specifically: In this embodiment, the warehouse management system performs actions such as receiving handling requests, planning routes, generating transportation tasks, verifying estimated durations, issuing scheduling instructions, and outputting scheduling results. Meanwhile, the forklift dispatching system performs actions such as receiving transportation tasks, conducting energy consumption time analysis, providing feedback on estimated working time, parsing scheduling instructions, executing warehouse scheduling, generating multi-dimensional scheduling reports, and uploading scheduling reports. At the same time, the input and output data of each action are clearly defined (e.g., transportation tasks include working paths / priorities, and scheduling reports include completion times / abnormal records).

[0065] Furthermore, this embodiment arranges the interaction sequence according to the timeline of request, processing, feedback, execution, and closure. First, it triggers the task initialization process of the warehouse management system, then realizes two-way data interaction through task issuance and estimated feedback, introduces analysis on whether the estimated duration meets the requirements, realizes dynamic scheduling, and finally completes the overall steps with report upload, result output, and data linkage, incorporating details such as dynamic environment analysis and energy consumption calculation.

[0066] It is important to understand that the rule parameters for each message interaction in this embodiment include message format rules (such as using JSON format to encapsulate structured data such as work area coordinates and path nodes for transportation tasks, and adding extended fields such as energy consumption curves and exception codes to scheduling reports), exception handling rules (such as triggering the WMS retry mechanism when the forklift fails to receive the task on time, and enabling local caching and breakpoint resume when the report upload fails), and collaborative verification rules (such as verifying the online status of the forklift before the WMS issues instructions, and verifying the task parameters and hardware compatibility before the forklift executes the task).

[0067] It should be noted that the above examples are only for understanding this application and do not constitute a limitation on the warehouse scheduling method of this application. Any simple modifications based on this technical concept are within the protection scope of this application.

[0068] This application also provides a warehouse scheduling device, please refer to... Figure 4 The warehouse scheduling device is applied to the warehouse management system, and the warehouse scheduling device includes: The receiving module 10 is used to receive a handling request and, based on the handling request, perform route planning using a pre-built warehouse area map to obtain a transportation task. The scheduling module 20 is used to match and schedule forklifts based on the transportation task, send the transportation task to the scheduled forklifts, and have the scheduled forklifts perform warehouse scheduling based on the transportation task. When the scheduling is completed, a scheduling report is generated and sent to the warehouse management system. Output module 30 is used to output scheduling results based on the scheduling report.

[0069] The warehouse scheduling device provided in this application, employing the warehouse scheduling method in the above embodiments, can solve the technical problem that the inability to coordinate tasks with forklifts affects overall operational efficiency in large-scale, high-frequency handling scenarios. Compared with the prior art, the beneficial effects of the warehouse scheduling device provided in this application are the same as those of the xxx method provided in the above embodiments, and other technical features in the warehouse scheduling device are the same as those disclosed in the methods of the above embodiments, and will not be repeated here.

[0070] This application provides a warehouse scheduling device, which includes: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, which are executed by the at least one processor to enable the at least one processor to perform the warehouse scheduling method in the above embodiment 1.

[0071] The following is for reference. Figure 5The diagram illustrates a structural schematic suitable for implementing the warehouse scheduling device in the embodiments of this application. The warehouse scheduling device in the embodiments of this application may include, but is not limited to, mobile terminals such as mobile phones, laptops, digital broadcast receivers, PDAs (Personal Digital Assistants), PADs (Portable Application Description), PMPs (Portable Media Players), vehicle terminals (e.g., vehicle navigation terminals), and fixed terminals such as digital TVs and desktop computers. Figure 5 The warehouse scheduling equipment shown is merely an example and should not impose any limitations on the functionality and scope of use of the embodiments of this application.

[0072] like Figure 5 As shown, the warehouse scheduling equipment may include a processing unit 1001 (e.g., a central processing unit, a graphics processing unit, etc.), which can perform various appropriate actions and processes according to a program stored in a read-only memory 1002 or a program loaded from a storage device 1003 into a random access memory 1004. The random access memory 1004 also stores various programs and data required for the operation of the warehouse scheduling equipment. The processing unit 1001, the read-only memory 1002, and the random access memory 1004 are interconnected via a bus 1005. An input / output interface 1006 is also connected to the bus. Typically, the following systems can be connected to the input / output interface 1006: input devices 1007 including, for example, a touch screen, touchpad, keyboard, mouse, image sensor, microphone, accelerometer, gyroscope, etc.; output devices 1008 including, for example, a liquid crystal display (LCD), speaker, vibrator, etc.; storage devices 1003 including, for example, magnetic tape, hard disk, etc.; and communication devices 1009. Communication device 1009 allows the warehouse scheduling equipment to communicate wirelessly or wiredly with other equipment to exchange data. Although warehouse scheduling equipment with various systems is shown in the figure, it should be understood that implementation or possession of all the systems shown is not required. More or fewer systems may be implemented alternatively.

[0073] Specifically, according to the embodiments disclosed in this application, the processes described above with reference to the flowcharts can be implemented as computer software programs. For example, embodiments disclosed in this application include a computer program product comprising a computer program carried on a computer-readable medium, the computer program containing program code for performing the methods shown in the flowcharts. In such embodiments, the computer program can be downloaded and installed from a network via a communication device, or installed from storage device 1003, or installed from read-only memory 1002. When the computer program is executed by processing device 1001, it performs the functions defined in the methods of the embodiments disclosed in this application.

[0074] The warehouse scheduling equipment provided in this application, employing the warehouse scheduling method described in the above embodiments, can solve the technical problem that the inability to coordinate tasks with forklifts affects overall operational efficiency in large-scale, high-frequency handling scenarios. Compared with the prior art, the beneficial effects of the warehouse scheduling equipment provided in this application are the same as those of the warehouse scheduling method provided in the above embodiments, and other technical features of this warehouse scheduling equipment are the same as those disclosed in the previous embodiment method, and will not be repeated here.

[0075] It should be understood that the various parts disclosed in this application can be implemented using hardware, software, firmware, or a combination thereof. In the description of the above embodiments, specific features, structures, materials, or characteristics can be combined in any suitable manner in one or more embodiments or examples.

[0076] The above description is merely a specific embodiment of this application, but the scope of protection of this application is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in this application should be included within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

[0077] This application provides a computer-readable storage medium having computer-readable program instructions (i.e., a computer program) stored thereon, the computer-readable program instructions being used to execute the warehouse scheduling method in the above embodiments.

[0078] The computer-readable storage medium provided in this application may be, for example, a USB flash drive, but is not limited to, electrical, magnetic, optical, electromagnetic, infrared, or semiconductor systems or devices, or any combination thereof. More specific examples of computer-readable storage media may include, but are not limited to: electrical connections having one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination thereof. In this embodiment, the computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system or device. The program code contained on the computer-readable storage medium may be transmitted using any suitable medium, including but not limited to: wires, optical cables, RF (Radio Frequency), etc., or any suitable combination thereof.

[0079] The aforementioned computer-readable storage medium may be included in the warehouse scheduling equipment; or it may exist independently and not be assembled into the warehouse scheduling equipment.

[0080] The aforementioned computer-readable storage medium carries one or more programs. When these programs are executed by the warehouse scheduling equipment, the warehouse scheduling equipment: receives a handling request; performs route planning based on the handling request using a pre-built warehouse area map to obtain a transportation task; matches and schedules forklifts based on the transportation task and sends the transportation task to the scheduled forklift; the scheduled forklift performs warehouse scheduling based on the transportation task; generates a scheduling report upon completion of scheduling and sends the scheduling report to the warehouse management system; and outputs scheduling results based on the scheduling report.

[0081] Computer program code for performing the operations of this application can be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages ​​such as Java, Smalltalk, and C++, and conventional procedural programming languages ​​such as the "C" language or similar programming languages. The program code can be executed entirely on the user's computer, partially on the user's computer, as a standalone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving remote computers, the remote computer can be connected to the user's computer via any type of network—including a Local Area Network (LAN) or a Wide Area Network (WAN)—or can be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0082] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of this application. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of code containing one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions indicated in the blocks may occur in a different order than those indicated in the drawings. For example, two consecutively indicated blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in the block diagrams and / or flowcharts, and combinations of blocks in the block diagrams and / or flowcharts, can be implemented using a dedicated hardware-based system that performs the specified function or operation, or using a combination of dedicated hardware and computer instructions.

[0083] The modules described in the embodiments of this application can be implemented in software or hardware. The names of the modules do not necessarily limit the functionality of the unit itself.

[0084] The readable storage medium provided in this application is a computer-readable storage medium that stores computer-readable program instructions (i.e., a computer program) for executing the above-described warehouse scheduling method. This solves the technical problem that the inability to coordinate tasks with forklifts affects overall operational efficiency in large-scale, high-frequency handling scenarios. Compared with the prior art, the beneficial effects of the computer-readable storage medium provided in this application are the same as those of the warehouse scheduling method provided in the above embodiments, and will not be elaborated upon here.

[0085] This application also provides a computer program product, including a computer program that, when executed by a processor, implements the steps of the warehouse scheduling method described above.

[0086] The computer program product provided in this application can solve the technical problem that the inability to coordinate tasks with forklifts affects overall operational efficiency in large-scale, high-frequency handling scenarios. Compared with the prior art, the beneficial effects of the computer program product provided in this application are the same as those of the warehouse scheduling method provided in the above embodiments, and will not be repeated here.

[0087] The above description is only a part of the embodiments of this application and does not limit the patent scope of this application. All equivalent structural transformations made under the technical concept of this application and using the contents of the specification and drawings of this application, or direct / indirect applications in other related technical fields, are included in the patent protection scope of this application.

Claims

1. A warehouse scheduling method, characterized in that, The warehouse scheduling method is applied to a warehouse management system, and the warehouse scheduling method includes: Receive a handling request, and based on the handling request, perform route planning using a pre-built warehouse area map to obtain a transportation task; Based on the transportation task, a forklift is matched and dispatched, and the transportation task is sent to the dispatched forklift. The dispatched forklift performs warehouse scheduling based on the transportation task. When the scheduling is completed, a scheduling report is generated and sent to the warehouse management system. The scheduling results are output based on the scheduling report.

2. The warehouse scheduling method as described in claim 1, characterized in that, Before the step of performing route planning using a pre-built warehouse map based on the handling request to obtain the transportation task, the method further includes: The warehouse map is received, and based on the warehouse map, a three-dimensional panoramic scan of the warehouse is performed by a laser scanning robot to obtain a digital map, which includes shelf coordinates, aisle information and load-bearing areas. Based on the rack coordinates, aisle information, and load-bearing area, an environmental assessment is conducted using warehouse environmental indicators to obtain a warehouse environmental report. Based on the aforementioned reservoir area environmental report, environmental optimization strategies, restricted driving areas, and charging areas were determined. The layout of the warehouse is optimized by using the aforementioned environmental optimization strategy, driving restricted areas, and charging areas to obtain an optimized warehouse. According to the preset map update time, the laser scanning robot performs a three-dimensional panoramic scan of the optimized warehouse to obtain a warehouse area map.

3. The warehouse scheduling method as described in claim 1, characterized in that, The step of obtaining the transportation task by performing route planning using a pre-built warehouse map based on the transportation request includes: The task information is obtained by parsing the transport request, and the task information includes the task type, the number of tasks, and the task priority; The work area is determined based on the task type, and the forklift type is determined based on the number of tasks and task priority. Based on the work area and forklift type, a path planning algorithm is used to calculate the work path on the warehouse map. Transportation tasks are generated based on the work area, forklift type, and work path.

4. The warehouse scheduling method as described in claim 1, characterized in that, After the step of matching and scheduling a forklift based on the transportation task and sending the transportation task to the scheduled forklift, the method further includes: Receive the estimated working time sent by the dispatched forklift; The estimated time is determined based on the working time specified in the handling request; When the estimated duration exceeds the specified working duration, a backup forklift is matched to calculate the working duration and obtain the matching result. Based on the matching result, a scheduling instruction is generated and sent to the scheduling forklift. The scheduling forklift parses the scheduling instruction to obtain the final working time, final transport quantity, and final transport weight, and generates the final transportation task based on the final working time, final transport quantity, and final transport weight.

5. A warehouse scheduling method, characterized in that, The warehouse scheduling method is applied to scheduling forklifts, and the warehouse scheduling method includes: The system receives transportation tasks, which are initiated by the warehouse management system. The system receives handling requests and performs route planning based on the handling requests using a pre-built warehouse map to obtain transportation tasks. Based on the transportation tasks, the system matches and dispatches forklifts and sends the transportation tasks to the dispatched forklifts. Warehouse scheduling is performed based on the transportation task, and a scheduling report is generated upon completion of the scheduling. The scheduling report is sent to the warehouse management system, which then outputs the scheduling result based on the scheduling report.

6. The warehouse scheduling method as described in claim 5, characterized in that, Before the step of performing warehouse scheduling based on the transportation task and generating a scheduling report upon completion of scheduling, the method includes: Energy consumption is calculated based on the work path, quantity, and weight of the transport task to obtain the estimated power consumption. The estimated power consumption is analyzed by the battery management program of the dispatch forklift to obtain the number of charging times for the transportation task. Based on the number of charging cycles and the duration of the transportation tasks, the estimated working time is obtained. The estimated working time is sent to the warehouse management system, which then determines whether the estimated working time meets the scheduling requirements. Receive the scheduling instructions from the warehouse management system, and parse the scheduling instructions to obtain the final working time, final quantity handled, and final weight handled; The final transportation task is generated based on the final working time, the final quantity handled, and the final weight handled.

7. A warehouse scheduling device, characterized in that, The warehouse scheduling device is applied to the warehouse management system, and the warehouse scheduling device includes: The receiving module is used to receive a handling request and, based on the handling request, perform route planning using a pre-built warehouse map to obtain a transportation task. The scheduling module is used to match and schedule forklifts based on the transportation task, and send the transportation task to the scheduled forklifts. The scheduled forklifts then perform warehouse scheduling based on the transportation task. Upon completion of the scheduling, a scheduling report is generated and sent to the warehouse management system. The output module is used to output the scheduling result based on the scheduling report.

8. A warehouse scheduling device, characterized in that, The device includes: a memory, a processor, and a computer program stored in the memory and executable on the processor, the computer program being configured to implement the steps of the warehouse scheduling method as described in any one of claims 1 to 6.

9. A storage medium, characterized in that, The storage medium is a computer-readable storage medium, and a computer program is stored on the storage medium. When the computer program is executed by a processor, it implements the steps of the warehouse scheduling method as described in any one of claims 1 to 6.

10. A computer program product, characterized in that, The computer program product includes a computer program that, when executed by a processor, implements the steps of the warehouse scheduling method as described in any one of claims 1 to 6.

Images