Crown block dispatching system

By setting up the track network structure of the inner and outer ring tracks in the Tianche scheduling system, as well as the task allocation strategy of the central dispatch server, the problems of low scheduling efficiency and crowded traffic jams in the Tianche scheduling system are solved, and efficient and flexible are achieved scheduling and adaptability to the production environment.

CN119067408AActive Publication Date: 2024-12-03JIHUA LAB

Patent Information

Application Number
CN202411555738.4
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-11-04
Publication Date
2024-12-03
Estimated Expiration
2044-11-04

AI Technical Summary

Technical Problem

The existing Tianche scheduling system is difficult to achieve efficient scheduling in huge wafer fabs, resulting in high idling rate of Tianche and equipment waiting idle rate, and easy to cause traffic jams, which are difficult to implement or lack of reliability in traditional algorithms.

Method used

Using a combination of multiple equipment distribution areas, track networks and central dispatch servers, the track network structure of inner and outer tracks and the task allocation strategy of central dispatch servers can be achieved efficient sky-car scheduling and reduce no-load rate. and wait for idle rates to avoid traffic jams.

Benefits of technology

It improves the scheduling efficiency of Tianche, enhances the flexibility and reliability of the system, significantly improves the overall performance and scheduling efficiency, and can better cope with complex production environments.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119067408A_ABST
    Figure CN119067408A_ABST
Patent Text Reader

Abstract

The invention belongs to the technical field of semiconductor material transmission, and discloses a crown block scheduling system, which comprises a plurality of equipment distribution areas, a rail network, a central scheduling server and a plurality of crown blocks, and realizes efficient crown block scheduling by setting a rail network structure of an inner ring rail and a public rail and a task distribution strategy of the central scheduling server, thereby improving the scheduling efficiency of the crown blocks. The method has the advantages that the crown block dispatching efficiency is improved, the crown block no-load rate and the equipment waiting idle rate are reduced, crown block gathering and traffic jam are avoided, and implementation is easy.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the technical field of semiconductor material transmission, and in particular to an overhead crane dispatching system. Background Art

[0002] In semiconductor material transportation, the main task of the overhead crane is to move the material from the starting position to the target position after receiving the task instruction, so as to complete the material handling. Due to the fixed nature of the overhead crane track and the requirements of the overhead crane working environment, the overhead crane needs to consider factors such as traffic flow, vehicle behavior, and unexpected conditions to avoid collisions and ensure driving safety. Therefore, efficient scheduling of the overhead crane can improve production efficiency, and overhead crane scheduling is an important part of semiconductor production scheduling.

[0003] Traditional overhead crane systems can only move along a preset path, and the cranes that perform different tasks have different paths. Because each crane moves along a preset path, it is impossible to achieve real-time scheduling of the cranes, which will affect the production efficiency of semiconductors when products are switched or multiple different products are produced.

[0004] With the development of technology, in some existing new types of overhead crane systems, each overhead crane can reach more places and can be used in conjunction with real-time scheduling methods. However, most of the current scheduling methods focus on the re-prioritization of tasks, or dynamic planning to deal with congestion. For example, the method proposed by Chinese patent CN116934059B obtains the operation information and task information of each overhead crane running in the overhead crane track network in real time, determines the time scheduling priority of each overhead crane according to the unprocessed time of the scheduling request, and then performs the next step of path planning. Although this type of technical solution optimizes the scheduling and path planning of overhead cranes to a certain extent, it still has the following disadvantages: For large-scale wafer fabs, the scheduling algorithm has a huge overhead and cannot complete the real-time scheduling and planning of hundreds or thousands of vehicles in a short period of time.

[0005] If tasks are still issued after the equipment is idle, the overhead crane will take a long time to travel, resulting in a high overhead crane idle rate or equipment waiting idle rate, which is not conducive to production efficiency.

[0006] Due to the large rail network and the large number of overhead cranes, if the standby paths of idle overhead cranes are not considered, crowding is likely to occur. Not only will shunting at distant locations take a long time, but traffic jams will also occur in the crowded areas, affecting the normal movement of overhead cranes in and out.

[0007] Commonly used heuristic algorithms are extremely difficult to implement, while commonly used deep learning algorithms lack reliability and are difficult to maintain when problems arise.

[0008] In view of the above problems, the existing technology needs to be improved urgently. Summary of the invention

[0009] The purpose of the present application is to provide a vehicle dispatching system that can improve the dispatching efficiency of overhead cranes, reduce the empty load rate of overhead cranes and the idle rate of equipment waiting, avoid traffic jams caused by overhead cranes, and is easy to implement.

[0010] The present application provides an overhead crane dispatching system, comprising a plurality of equipment distribution areas, a track network, a central dispatching server and a plurality of overhead cranes, wherein the overhead cranes are movably arranged on the track network and are communicatively connected to the central dispatching server; The equipment distribution area is used to centrally place processing equipment, and the same equipment distribution area is used to place the same type of processing equipment for the same process, and different equipment distribution areas are used to place processing equipment for different processes; The track network includes a plurality of inner ring tracks connected end to end and a plurality of common tracks located outside the inner ring tracks. Each of the equipment distribution areas is surrounded by one inner ring track. Each of the inner ring tracks includes at least one entrance and at least one exit. The entrance and the exit are connected to the adjacent common track or other adjacent inner ring tracks through connecting tracks. The inner ring tracks are used for idle overhead cranes to patrol and wait for tasks. A temporary storage device is provided next to at least one entrance of each inner ring track. The temporary storage device is used to temporarily store wafer boxes to be sent to the corresponding equipment distribution area. The central dispatch server is used to assign transportation tasks to the overhead crane; The overhead crane is used to perform dynamic path planning according to the assigned transportation tasks and execute the tasks according to the planning results.

[0011] By setting up the track network structure of the inner ring track and the public track, as well as the task allocation strategy of the central dispatching server, efficient overhead crane dispatching is achieved, which has the advantages of improving the overhead crane dispatching efficiency, reducing the overhead crane no-load rate and equipment waiting idle rate, avoiding overhead crane traffic jams and being easy to implement.

[0012] Preferably, the common track comprises an outer ring track connected end to end and surrounding all the inner ring tracks.

[0013] By setting an outer ring track in the track network, the following technical effects can be achieved: First, the outer ring track surrounds all the inner ring tracks to form a complete closed-loop system. This structure allows the overhead crane to quickly switch and transfer between different inner ring tracks, and can reach the target location without complex path planning. Secondly, the setting of the outer ring track provides an efficient main road for the overhead crane. When the overhead crane needs to move a long distance, it can give priority to the outer ring track to avoid the possible congested areas inside, thereby improving the operating speed and efficiency. Furthermore, the head-to-tail connection characteristics of the outer ring track ensure the continuity and flexibility of the system. The overhead crane can continue to operate on the outer ring track without turning around or changing direction at the end, which greatly reduces the idle time and unnecessary movements of the overhead crane and improves the overall efficiency of the system. Finally, the existence of the outer ring track provides the system with more path options. When the inner ring track or some connecting tracks fail or are maintained, the outer ring track can be used as a backup path to ensure the continuous operation of the system and the smooth completion of the task. By setting the head-to-tail connected outer ring track surrounding all the inner ring tracks, this technical solution effectively solves the problem of optimizing the track network structure in the overhead crane dispatching system. It not only improves the operating efficiency of the overhead crane, but also enhances the flexibility and reliability of the entire system, thereby significantly improving the overall performance and dispatching efficiency of the overhead crane dispatching system.

[0014] Preferably, when allocating a transportation task to the overhead crane, the central dispatch server executes: S1. Extracting the tasks to be assigned according to the scheduling task list and determining the starting position and target position of the tasks to be assigned; S2. Obtain the current occupancy status of the starting position and the target position of the task to be assigned; the occupancy status is idle or occupied; S3. If the starting position and the target position of the task to be assigned are both free, the task to be assigned is assigned to the best overhead travelling vehicle that can reach the starting position of the task to be assigned the fastest; S4. If the starting position of the task to be assigned is occupied and the target position of the task to be assigned is idle, the task to be assigned is assigned or put back into the scheduling task list according to the time required to release the starting position; S5. If the starting position of the task to be assigned is idle and the target position of the task to be assigned is occupied, the task to be assigned is assigned or the task to be assigned is decomposed and then the new task is assigned according to the task duration and the time required to unoccupy the target position; the task duration is the time required for the overhead travelling crane to reach the target position from the starting position; S6. If both the starting position and the target position of the task to be assigned are occupied, put the task to be assigned back into the scheduling task list.

[0015] This allocation method helps to improve overall transportation efficiency and can better cope with complex actual production environments.

[0016] Preferably, step S1 comprises: S101. Extracting the tasks to be assigned and the corresponding starting positions and target equipment distribution areas from the scheduling task list in order; S102. According to the location and occupancy status of each processing equipment in the target equipment distribution area, select the location of the processing equipment with the shortest distance and is idle or the location of the processing equipment whose occupancy status will become idle the earliest as the target location; wherein the occupancy status of the target location is the same as the occupancy status of the processing equipment corresponding to the target location.

[0017] Preferably, step S102 includes: If there is an idle processing device in the target device distribution area, then the optimal path from the starting position to the position of each first device is obtained, and the position of the first device corresponding to the shortest optimal path is selected as the target position; the first device is an idle processing device in the target device distribution area; If there is no idle processing equipment in the target equipment distribution area, the time required for each processing equipment in the target equipment distribution area to be deoccupied is obtained, recorded as the first deoccupancy time, and the location of the processing equipment corresponding to the shortest first deoccupancy time is selected as the target location; wherein, the time required for the target location to be deoccupied is the same as the corresponding first deoccupancy time.

[0018] Preferably, the optimal overhead crane is an idle overhead crane located upstream of the starting position of the task to be assigned or a non-idle overhead crane whose target position of the current task is upstream of the starting position of the task to be assigned; The step of assigning the task to be assigned to the best overhead travelling vehicle that can reach the starting position of the task to be assigned the fastest comprises: Calculate the shortest time required for each first overhead crane to travel from the current position to the starting position of the task to be assigned as the arrival time of the corresponding first overhead crane; the first overhead crane is an idle overhead crane located upstream of the starting position of the task to be assigned; Calculate the shortest time required for each second-day vehicle to complete the current task and go to the starting position of the task to be assigned as the arrival time of the corresponding second-day vehicle; the second-day vehicle is a non-idle overhead crane whose target position of the current task is upstream of the starting position of the task to be assigned; The overhead crane corresponding to the shortest arrival time is selected as the best overhead crane, and the to-be-assigned task is assigned to the best overhead crane.

[0019] Preferably, step S4 comprises: S401. Calculate the time required to release the starting position based on the total time of the processing steps corresponding to the processing equipment corresponding to the starting position of the task to be assigned and the time used by the current processing task of the processing equipment corresponding to the starting position of the task to be assigned; S402. If the time required to release the starting position is less than the preset scheduling time, the task to be assigned is assigned to the best overhead travelling vehicle that can reach the starting position of the task to be assigned the fastest; S403. If the time required to release the starting position from occupation is not less than the preset scheduling time, the task to be assigned is put back into the scheduling task list.

[0020] Preferably, step S5 comprises: S501. Calculate the task duration according to the starting position and the target position of the task to be assigned; S502. Calculate the time required to release the target position based on the total time of the processing steps corresponding to the processing equipment corresponding to the target position of the task to be assigned and the time used for the current processing task of the processing equipment corresponding to the target position of the task to be assigned; S503. If the sum of the task duration and the preset scheduling time is not less than the time required to release the target location, the task to be assigned is assigned to the best overhead travelling vehicle that can reach the starting location of the task to be assigned the fastest; S504. If the sum of the task duration and the preset scheduling time is less than the time required to unoccupy the target position, the task to be assigned is decomposed into a first new task and a second new task, and the first new task is assigned to the best overhead crane that can reach the starting position of the first new task the fastest, and the second new task is added to the scheduling task list; the starting position of the first new task is the same as the starting position of the task to be assigned, and the target position of the first new task is a position corresponding to one of the temporary storage devices in the equipment distribution area where the target position of the task to be assigned is located; the starting position of the second new task is the same as the target position of the first new task.

[0021] Preferably, the step of calculating the task duration according to the starting position and the target position of the task to be assigned includes: Obtain the shortest path from the starting position of the task to be assigned to each exit of the equipment distribution area corresponding to the starting position of the task to be assigned, and record it as a first path; Obtain the shortest path from each of the exits of the equipment distribution area corresponding to the starting position of the task to be assigned to each of the entrances of the equipment distribution area corresponding to the target position of the task to be assigned, and record it as a second path; Obtain the shortest path from each entrance of the equipment distribution area corresponding to the target location of the task to be assigned to the target location of the task to be assigned, recorded as a third path; combining the first path, the second path and the third path to obtain at least one continuous total path; The total path with the shortest length is selected as the effective total path, and the time consumed by the overhead travelling vehicle to move along the effective total path is calculated to obtain the task duration.

[0022] Preferably, when the overhead crane performs dynamic path planning according to the assigned transportation task and executes the task according to the planning result, the overhead crane performs: According to the current position and the starting position and the target position of the assigned transport task, plan an execution path from the current position through the starting position of the assigned transport task to the target position of the assigned transport task; The task is executed based on the execution path, and the execution path is dynamically adjusted according to the real-time map data during the execution of the task; the real-time map data includes the position of each overhead crane, the speed of each overhead crane, the track network distribution data, the position and occupancy status of each processing equipment and the position of each temporary storage device.

[0023] Beneficial effects: The application provides an overhead crane dispatching system, which includes multiple equipment distribution areas, a track network, a central dispatching server and multiple overhead cranes. By setting up a track network structure of inner ring tracks and public tracks, as well as a task allocation strategy of the central dispatching server, efficient overhead crane dispatching is achieved. It has the advantages of improving overhead crane dispatching efficiency, reducing overhead crane empty load rate and equipment waiting idle rate, avoiding overhead crane congestion and being easy to implement. BRIEF DESCRIPTION OF THE DRAWINGS

[0024] Figure 1 A distribution diagram of the equipment distribution area and track network of the overhead crane dispatching system provided in an embodiment of the present application.

[0025] Figure 2 This is a device connection diagram of the overhead crane dispatching system provided in an embodiment of the present application.

[0026] Figure 3 The present invention is a flow chart of the central dispatching server allocating transportation tasks to the overhead crane.

[0027] Explanation of reference numerals: 1. Equipment distribution area; 2. Track network; 201. Inner ring track; 202. Public track; 203. Connecting track; 204. Outer ring track; 3. Central dispatching server; 4. Overhead crane; 5. Processing equipment; 6. Temporary storage device; 7. Track information acquisition processor; 8. Map information database. DETAILED DESCRIPTION

[0028] The technical solutions in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are only a part of the embodiments of the present application, rather than all of the embodiments. The components of the embodiments of the present application described and shown in the drawings here can be arranged and designed in various different configurations. Therefore, the following detailed description of the embodiments of the present application provided in the drawings is not intended to limit the scope of the application claimed for protection, but merely represents the selected embodiments of the present application. Based on the embodiments of the present application, all other embodiments obtained by those skilled in the art without making creative work belong to the scope of protection of the present application.

[0029] It should be noted that similar reference numerals and letters represent similar items in the following drawings, so once an item is defined in one drawing, it does not need to be further defined and explained in subsequent drawings. At the same time, in the description of this application, the terms "first", "second", etc. are only used to distinguish the description and cannot be understood as indicating or implying relative importance.

[0030] In large-scale wafer fabs, the overhead crane scheduling system faces severe challenges. As the scale of production continues to expand, traditional scheduling methods are unable to meet the growing demand. The current scheduling algorithm performs poorly when dealing with a large number of overhead cranes, and cannot complete the real-time scheduling and path planning of hundreds or even thousands of overhead cranes in a short period of time. This results in slow system response and inability to assign tasks in a timely manner, affecting overall production efficiency.

[0031] In addition, the existing system only issues tasks after the equipment is idle, causing the overhead crane to run unloaded for a long time or the equipment to wait for a long time, greatly reducing resource utilization. Due to the large and complex rail network and the lack of an effective idle overhead crane management strategy, it is easy for overhead cranes to gather in certain areas. This not only increases the time cost of long-distance scheduling, but also easily causes traffic congestion and affects normal material transportation.

[0032] The currently widely used heuristic algorithms are difficult to implement, while the deep learning algorithms are highly flexible but lack reliability and maintainability. These problems seriously restrict the performance and reliability of the overhead crane dispatching system, and a new dispatching solution is urgently needed to solve these technical problems.

[0033] For this purpose, refer to Figure 1-Figure 2, the present application provides an overhead crane dispatching system, comprising a plurality of equipment distribution areas 1, a track network 2, a central dispatching server 3 and a plurality of overhead cranes 4, the overhead cranes 4 being movably arranged on the track network 2 and being communicatively connected to the central dispatching server 3; The equipment distribution area 1 is used to centrally place the processing equipment 5, and the same equipment distribution area 1 is used to place the same type of processing equipment 5 for the same process, and different equipment distribution areas 1 are used to place processing equipment 5 for different processes (for example Figure 1 Among them, the seven areas A, B, C, D, E, F, and G are all equipment distribution areas 1); The track network 2 includes a plurality of inner ring tracks 201 connected end to end and a plurality of common tracks 202 located outside the inner ring tracks 201. Each equipment distribution area 1 is surrounded by an inner ring track 201 (for example, Figure 1 In the figure, the rectangular tracks at the edges of the seven equipment distribution areas 1 of A, B, C, D, E, F, and G are all inner ring tracks 201, and the tracks between adjacent inner ring tracks 201 and the outermost rectangular tracks are all public tracks 202). Each inner ring track 201 includes at least one entrance and at least one exit, and the entrance and exit are connected to the adjacent public track 202 or other adjacent inner ring tracks 201 through a connecting track 203; the inner ring track 201 is used for an idle overhead crane (i.e., an overhead crane 4 that is not currently assigned a transportation task) to patrol and wait for a task (i.e., when the overhead crane 4 is idle, it does not stop, but patrols in the inner ring track 201 to avoid causing congestion); a temporary storage device 6 is provided next to at least one entrance of each inner ring track 201, and the temporary storage device 6 is used to temporarily store wafer boxes to be sent to the corresponding equipment distribution area 1; The central dispatch server 3 is used to assign transportation tasks to the overhead crane 4; The overhead crane 4 is used to perform dynamic path planning according to the assigned transportation tasks and execute the tasks according to the planning results.

[0034] By setting up the track network 2 structure of the inner ring track 201 and the public track 202, and the task allocation strategy of the central dispatching server 3, efficient overhead crane 4 dispatching is achieved, which has the advantages of improving the dispatching efficiency of the overhead crane 4, reducing the empty load rate of the overhead crane 4 and the equipment waiting idle rate, avoiding the overhead crane 4 from being crowded and jammed, and being easy to implement.

[0035] First, the equipment distribution area 1 is used to centrally place the processing equipment 5, and the same equipment distribution area 1 is used to place the same type of processing equipment 5 performing the same process, and different equipment distribution areas 1 are used to place processing equipment 5 performing different processes. This layout can significantly reduce the transportation distance and time of the overhead crane 4 and improve transportation efficiency.

[0036] Secondly, the design of the track network 2 is one of the core innovations. The inner ring track 201 is designed for idle overhead cranes to patrol and wait for tasks. This design effectively solves the problem of idle overhead crane management and avoids the phenomenon of overhead cranes 4 gathering in hot spots. Idle overhead cranes can be evenly distributed on the inner ring track 201, which will not cause traffic congestion and can quickly respond to transportation needs in surrounding areas.

[0037] In addition, in order to further improve the flexibility and efficiency of the system, a temporary storage device 6 is provided next to at least one entrance of each inner ring track 201. This design allows the material to be temporarily stored near the target area when the target location is occupied, and then the material in the temporary storage device 6 is sent to the target location when the time is right, thereby reducing the equipment waiting time and the empty rate of the overhead crane 4.

[0038] The central dispatch server 3 is responsible for allocating transportation tasks to the overhead crane 4. Centralized task allocation can ensure the optimality of global scheduling and avoid the local optimality problem that may be caused by distributed scheduling. The overhead crane 4 performs dynamic path planning based on the assigned transportation tasks and executes the tasks based on the planning results. Assigning the responsibility of real-time path planning and dynamic adjustment to each overhead crane 4 can reduce the computing burden of the central dispatch server 3 and improve the response speed and scalability of the system.

[0039] In a specific application, the number of equipment distribution areas 1 and inner ring tracks 201 can be adjusted according to the factory scale and production requirements, for example Figure 1 In the embodiment, seven are provided for both. The number of entrances and exits of each inner ring track 201 can be set according to actual needs, and generally 2-4 entrances and exits are set to ensure sufficient traffic capacity. The capacity of the temporary storage device 6 can be designed according to the production rhythm and transportation frequency; wherein, the temporary storage device 6 can be a three-dimensional warehouse (Stocker) or UTS (Under Track Storage), but is not limited thereto.

[0040] There are also multiple options for the layout of the public track 202. For example, a large outer ring track 204 is set up to surround all the inner ring tracks 201; or a grid-shaped public track 202 is used to provide more transportation path options. The task allocation algorithm of the central dispatch server 3 can adopt a priority queue combined with a heuristic rule method. For example, the task priority is calculated based on factors such as the urgency of the task, the current position of the overhead crane 4, and the congestion level of the target location, and then the most suitable overhead crane 4 is selected to perform the task. The dynamic path planning of the overhead crane 4 can use the A* algorithm combined with real-time traffic information, and update the path planning every preset period (for example, 1-2 seconds) to cope with the dynamically changing transportation environment.

[0041] In one possible implementation, see Figure 1The common track 202 includes an outer ring track 204 ( Figure 1 the outermost rectangular track in the ).

[0042] By setting the outer ring track 204 in the track network 2, the following technical effects can be achieved: First, the outer ring track 204 surrounds all the inner ring tracks 201 to form a complete closed-loop system. This structure allows the overhead crane 4 to quickly switch and transfer between different inner ring tracks 201, and can reach the target location without complicated path planning. Secondly, the setting of the outer ring track 204 provides an efficient main road for the overhead crane 4. When the overhead crane 4 needs to move a long distance, the outer ring track 204 can be given priority to avoid the congested areas that may exist inside, thereby improving the operating speed and efficiency. Furthermore, the head-to-tail connection characteristics of the outer ring track 204 ensure the continuity and flexibility of the system. The overhead crane 4 can continue to operate on the outer ring track 204 without turning around or changing direction at the end, which greatly reduces the idle time and unnecessary actions of the overhead crane 4 and improves the overall efficiency of the system. Finally, the existence of the outer ring track 204 provides the system with more path options. When the inner ring track 201 or some connecting tracks 203 fail or are under maintenance, the outer ring track 204 can be used as a backup path to ensure the continuous operation of the system and the smooth completion of the task. By setting up the outer ring track 204 that surrounds all the inner ring tracks 201 and connects the end to the end, this technical solution effectively solves the problem of optimizing the track network 2 structure in the overhead crane dispatching system. It not only improves the operating efficiency of the overhead crane 4, but also enhances the flexibility and reliability of the entire system, thereby significantly improving the overall performance and dispatching efficiency of the overhead crane dispatching system.

[0043] There are many ways to implement the outer ring track 204. In one embodiment, the outer ring track 204 can adopt a single track structure, and the overhead crane 4 runs unidirectionally on the single track. This design is simple and easy to implement, but it may limit the running speed and flexibility of the overhead crane 4. In another embodiment, the outer ring track 204 can adopt a double track structure (wherein two outer ring tracks 204 are connected by a plurality of connecting tracks 203), allowing the overhead crane 4 to run bidirectionally. Although this design increases complexity and cost, it greatly improves the flexibility and efficiency of the system.

[0044] In some embodiments, see Figure 2 The overhead crane dispatching system also includes a track information acquisition processor 7 and a map information database 8. The track information acquisition processor 7, the map information database 8, the central dispatching server 3, the overhead crane 4, the processing equipment 5 and the temporary storage device 6 are interconnected for communication (for example, via a bus communication connection, but not limited thereto).

[0045] Among them, multiple identification points are arranged at intervals on each track segment of the track network 2, and photoelectric switches are arranged at both ends of each track segment; the identification points are used to assist the overhead crane 4 to obtain its own position, and the identification points can be but are not limited to RFID tags, QR codes or bar codes, etc.; the photoelectric switches are electrically connected to the track information acquisition processor 7.

[0046] Among them, it is also possible to set a variety of identification points with different functions, such as landmark points, line points, restriction points, disengagement points, positioning points, early deceleration points and stop deceleration points. Among them, the landmark points are arranged at equal intervals on each section of the straight track segment. The straight line point is used to prompt that the downstream of the corresponding key point of the overhead crane 4 is a straight track segment that is allowed to accelerate to the maximum speed. The restriction point is used to prompt that the corresponding position of the overhead crane 4 is the starting point of the curved track segment. The disengagement point is used to prompt that the corresponding position of the overhead crane 4 is the end point of the curved track segment. The positioning point is used to prompt the overhead crane 4 to perform a precise positioning stop operation to stop at the loading and unloading position. The early deceleration point is used to prompt that the overhead crane 4 is about to enter the curved track segment. The stop deceleration point is used to prompt that the overhead crane 4 is about to reach the positioning point.

[0047] The map information database 8 is used to record real-time map data; the real-time map data includes the position of each overhead crane 4 (determined by the overhead crane 4 according to the identification point and then uploaded), the speed of each overhead crane 4 (which can be measured by the overhead crane 4 through its own sensor and uploaded), the track network distribution data, the position and occupancy status of each processing equipment 5 (idle or occupied) and the position of each temporary storage device 6, and can also include the abnormal status of each track section (abnormal or non-abnormal). When the central dispatch server 3 and the overhead crane 4 perform task allocation and path planning, they can read the real-time map data from the map information database 8 as reference data for task allocation and path planning. Since the independent map information database 8 is used to record and update the real-time map data, the burden of the central dispatch server 3 can be further reduced and the dispatch efficiency can be improved.

[0048] The track information acquisition processor 7 is used to record the entry and exit information of the overhead crane 4 in and out of each track segment in real time according to the photoelectric switches set at both ends of each track segment, and detect whether there is a lost overhead crane in each track segment according to the real-time map data (for example, the difference between the number of times the photoelectric switches at the entrance and exit of the track segment are triggered is calculated as the first number of overhead cranes 4 in the corresponding track segment, and then the number of overhead cranes 4 located in the corresponding track segment is determined according to the position of each overhead crane 4 in the real-time map data and the track network distribution data, and recorded as the second number. When the first number is not equal to the second number, it is determined that there is a lost overhead crane in the corresponding track segment), and when a lost overhead crane is detected, a warning message is sent to the map information database 8, so that the map information database 8 adjusts the abnormal state of the corresponding track segment (i.e., the track segment with the lost overhead crane) to abnormal, so that the central dispatch server 3 and the overhead crane 4 avoid the corresponding track segment when performing task allocation and path planning. Once the overhead crane 4 loses connection in a certain track segment, it will cause congestion in the track segment. When performing path planning, avoiding the corresponding track segment can avoid guiding other overhead cranes to the congested track segment.

[0049] Preferably, when allocating a transportation task to the overhead crane 4, the central dispatch server 3 executes: S1. Extract the tasks to be assigned according to the scheduling task list and determine the starting location and target location of the tasks to be assigned; S2. Obtain the current occupancy status of the starting location and target location of the task to be assigned (the occupancy status is idle or occupied); S3. If both the starting position and the target position of the task to be assigned are free, the task to be assigned is assigned to the best overhead crane that can reach the starting position of the task to be assigned the fastest; S4. If the starting position of the task to be assigned is occupied and the target position of the task to be assigned is free, the task to be assigned is assigned or put back into the scheduling task list according to the time required to release the starting position; S5. If the starting position of the task to be assigned is idle and the target position of the task to be assigned is occupied, the task to be assigned is assigned or the task to be assigned is decomposed and the new task is assigned after the decomposition is obtained according to the task duration and the time required to release the target position; the task duration is the time required for the crane 4 to reach the target position from the starting position; S6. If both the starting position and the target position of the task to be assigned are occupied, put the task to be assigned back into the scheduling task list.

[0050] This allocation method helps improve overall transportation efficiency and can better cope with complex actual production environments. First, this allocation method introduces the concept of "optimal overhead crane", that is, the overhead crane that can reach the task departure location the fastest, which helps improve overall transportation efficiency. Secondly, different allocation strategies are adopted according to the different occupancy conditions of the departure location and the target location, which effectively improves the utilization rate of the overhead crane and the operating efficiency of the entire system. At the same time, through the task decomposition method, more flexible solutions can be found in complex situations, further optimizing system performance.

[0051] Wherein, step S1 comprises: S101. Extract the tasks to be assigned and the corresponding starting positions and target equipment distribution areas from the scheduling task list in order; S102. According to the position and occupancy status of each processing equipment 5 in the target equipment distribution area, the position of the processing equipment 5 with the shortest distance and which is idle, or the position of the processing equipment 5 whose occupancy status will become idle the earliest, is selected as the target position; wherein the occupancy status of the target position is the same as the occupancy status of the processing equipment 5 corresponding to the target position.

[0052] In specific implementations, the scheduling task list can be implemented using a variety of data structures, such as queues, priority queues, or linked lists. The sorting can be based on multiple factors, such as task priority, estimated completion time, or resource requirements. For example, a priority queue can be used to sort tasks from high to low priority, and if the priorities are the same, they can be sorted according to the submission time.

[0053] When extracting tasks to be assigned, the system will simultaneously obtain the starting location and target equipment distribution area information of the task. The starting location is usually the location coordinates of the processing equipment 5 or temporary storage device 6 where the task object (wafer) is currently located. The target equipment distribution area is the equipment distribution area 1 where the processing equipment 5 to be used in the next process of the task object is located.

[0054] When selecting the target location, the system considers two main factors: distance and equipment status. The distance calculation can use the A* algorithm or the Dijkstra algorithm, taking into account the actual layout of the track network and possible obstacles. Equipment status includes idle and occupied. For occupied equipment, its estimated idle time must also be considered.

[0055] For example, in one possible implementation, step S102 includes: If there is an idle processing device 5 in the target device distribution area, the optimal path from the starting position to the position of each first device is obtained, and the position of the first device corresponding to the shortest optimal path is selected as the target position; the first device is the idle processing device 5 in the target device distribution area; If there is no idle processing equipment 5 in the target equipment distribution area, the time required for each processing equipment 5 in the target equipment distribution area to be deoccupied is obtained, recorded as the first deoccupancy time, and the position of the processing equipment 5 corresponding to the shortest first deoccupancy time is selected as the target position; wherein, the time required for the target position to be deoccupied is the same as the corresponding first deoccupancy time.

[0056] The technical solution selects the appropriate target position in two situations to optimize task allocation and execution efficiency: when there is idle processing equipment 5 in the target equipment distribution area, the solution selects the idle equipment with the shortest path as the target position. This can minimize the running time of the overhead crane 4 and improve transportation efficiency. When there is no idle processing equipment 5 in the target equipment distribution area, the solution selects the earliest processing equipment 5 that can be unoccupied as the target position. This can reduce waiting time and improve the overall task processing efficiency. Through the combination of these two strategies, the system can select the optimal target position in different situations, thereby optimizing the overall task allocation and execution efficiency. This dynamic selection mechanism can adapt to complex and changing production environments and improve the flexibility and efficiency of the system. The solution also takes into account the cooperation with other technical solutions, such as communication with the central scheduling server 3, dynamic path planning, etc., which together constitute an efficient overhead crane scheduling system. By accurately selecting the target position and combining the collaborative work of the overall system, the operation efficiency of the production line can be significantly improved, and waiting time and resource waste can be reduced.

[0057] When obtaining the optimal path from the starting position to each first device position, a variety of path planning algorithms can be used. Commonly used algorithms include Dijkstra algorithm, A* algorithm or improved ant colony algorithm. These algorithms can be selected and optimized according to the actual situation of the track network 2. For example, in a complex track network, a hierarchical A* algorithm can be used to improve the efficiency of path calculation.

[0058] Among them, the processing procedures corresponding to each processing equipment 5 are fixed, and the processing time for each type of wafer (hereinafter referred to as the total processing time) is fixed and known. The time required for each processing equipment 5 to be released is actually equal to the difference between the total processing time and the time used for the current processing task. For example, assuming that the total processing time of a processing equipment 5 is T1, and the processing process of the processing equipment 5 on the wafer currently being processed has lasted for T2, then the time required for release is T3=T1-T2.

[0059] Furthermore, the best overhead crane is an idle overhead crane located upstream of the starting position of the task to be assigned or a non-idle overhead crane whose target position of the current task is upstream of the starting position of the task to be assigned (i.e., the overhead crane 4 that has been assigned the transport task); The steps of assigning the task to be assigned to the best overhead crane that can reach the starting position of the task to be assigned the fastest include: Calculate the shortest time required for each first overhead crane from its current position to the starting position of the task to be assigned as the arrival time of the corresponding first overhead crane; the first overhead crane is an idle overhead crane located upstream of the starting position of the task to be assigned; Calculate the shortest time required for each second-day vehicle to complete the current task and reach the starting position of the task to be assigned, as the arrival time of the corresponding second-day vehicle; the second-day vehicle is a non-idle overhead crane whose target position of the current task is upstream of the starting position of the task to be assigned; The crane 4 corresponding to the shortest arrival time is selected as the best crane, and the task to be assigned is assigned to the best crane.

[0060] This technical solution solves the problem of how to quickly and efficiently select the best overhead crane by defining the selection range and specific selection method of the best overhead crane. First, the solution limits the selection range of the best overhead crane to two categories: idle overhead cranes located upstream of the departure position of the task to be assigned, and non-idle overhead cranes whose target position of the current task is upstream of the departure position of the task to be assigned. This can narrow the search range and improve the selection efficiency. Secondly, the solution proposes specific selection steps: 1. For idle overhead cranes, calculate the shortest time from the current position to the departure position of the task to be assigned. 2. For non-idle overhead cranes, calculate the shortest time to complete the current task and go to the departure position of the task to be assigned. 3. Compare all calculated times and select the overhead crane 4 corresponding to the shortest time as the best overhead crane. This selection method takes into account the current state and position of overhead crane 4, and can find the overhead crane that reaches the departure position of the task to be assigned the fastest, thereby minimizing the task waiting time and improving the overall transportation efficiency.

[0061] There are also multiple ways to calculate the time to arrive. For an idle overhead crane, the shortest time to reach the starting position of the task to be assigned can be calculated using a shortest path algorithm (such as the Dijkstra algorithm or the A* algorithm) based on the current position, speed, and track network topology (track network distribution data) of the overhead crane. For a non-idle overhead crane, in addition to considering the above factors, it is also necessary to consider the target position of the current task so that the shortest path planned passes through the target position of the task.

[0062] Preferably, step S4 comprises: S401. Calculate the time required for the departure position to be released from occupation (for example, subtract the two to obtain the time required for the departure position to be released from occupation) based on the total time of the processing steps corresponding to the processing equipment 5 corresponding to the departure position of the task to be assigned and the time used for the current processing task of the processing equipment 5 corresponding to the departure position of the task to be assigned; S402. If the time required to release the occupied departure position is less than the preset scheduling time (i.e., T0 < Ts, where T0 is the time required to release the occupied departure position and Ts is the preset scheduling time, which can be set according to actual needs), then assign the task to be allocated to the best crane that can reach the departure position of the task to be allocated the fastest. S403. If the time required to release the occupied departure position is not less than the preset scheduling time (i.e., T0 ≥ Ts), then put the task to be allocated back into the scheduling task list.

[0063] This technical solution determines whether to allocate tasks by calculating the time required to release the occupied departure position, effectively solving the task allocation problem when the departure position is occupied. Specifically, first calculate the time required to release the occupied departure position based on the total time of the processing operation and the time already used for the current task, which provides a basis for estimating when the departure position will be available. Then compare this time with the preset scheduling time to decide whether to allocate tasks immediately or postpone the processing. If the time required to release the occupancy is short (less than the preset scheduling time), it means that the departure position will be free soon, and it is reasonable to directly allocate the task to the best crane at this time. This can improve the response speed and efficiency of the system. If the time required to release the occupancy is long (not less than the preset scheduling time), put the task back into the list for another attempt at allocation later, avoiding waste of system resources caused by long waiting. This method takes into account both the current state and recent changes, maintaining a certain degree of flexibility while ensuring the efficiency of the system. By introducing the preset scheduling time as a judgment criterion, this solution can dynamically adjust the task allocation strategy according to the actual situation, thereby optimizing the operating efficiency of the entire scheduling system.

[0064] Further, step S5 includes: S501. Calculate the task duration based on the departure position and the target position of the task to be allocated. S502. Calculate the time required to release the occupied target position based on the total time of the processing operation corresponding to the processing equipment 5 corresponding to the target position of the task to be allocated and the time already used for the current processing task of the processing equipment 5 corresponding to the target position of the task to be allocated (for example, subtract the two to get the time required to release the occupied target position). S503. If the sum of the task duration and the preset scheduling time is not less than the time required to release the occupied target position (i.e., Tm + Ts ≥ T4, where Tm is the task duration and T4 is the time required to release the occupied target position), then assign the task to be allocated to the best crane that can reach the departure position of the task to be allocated the fastest. S504. If the sum of the task duration and the preset scheduling time is less than the time required to release the occupancy of the target position (i.e., Tm + Ts < T4), then decompose the task to be assigned into a first new task and a second new task, and assign the first new task to the best overhead crane that can reach the starting position of the first new task fastest, and add the second new task to the scheduling task list; the starting position of the first new task is the same as the starting position of the task to be assigned, and the target position of the first new task is the position corresponding to a temporary storage device 6 in equipment distribution area 1 where the target position of the task to be assigned is located; the starting position of the second new task is the same as the target position of the first new task.

[0065] This technical solution processes the situation where the target position of the task to be assigned is occupied through a series of steps to improve the scheduling efficiency: First, calculate the task duration and the time required to release the occupancy of the target position. The calculation of these two times provides a basis for subsequent decisions. Then, compare the sum of the task duration and the preset scheduling time with the time required to release the occupancy of the target position. This comparison is the key to the decision and is used to determine whether the task needs to be decomposed. If the sum of the task duration and the preset scheduling time is not less than the time required to release the occupancy of the target position, it means that when the overhead crane reaches the target position, the target position may already be idle. At this time, directly assign the task to the best overhead crane, which can improve the scheduling efficiency. If the sum of the task duration and the preset scheduling time is less than the time required to release the occupancy of the target position, it means that when the overhead crane reaches the target position, the target position may still be occupied. At this time, decompose the task into two new tasks: the first new task transports the material to the temporary storage device 6 in the target equipment distribution area, and the second new task transports it from the temporary storage device 6 to the final target position. This decomposition strategy can avoid the overhead crane 4 waiting at the target position and improve the utilization rate of the overhead crane 4.

[0066] Among them, in step S501, the steps of calculating the task duration according to the starting position and the target position of the task to be assigned include: Obtain the shortest path from the starting position of the task to be assigned to each exit of the equipment distribution area 1 corresponding to the starting position of the task to be assigned, and record it as the first path; Obtain the shortest path from each exit of the equipment distribution area 1 corresponding to the starting position of the task to be assigned to each entrance of the equipment distribution area 1 corresponding to the target position of the task to be assigned, and record it as the second path; Obtain the shortest path from each entrance of the equipment distribution area 1 corresponding to the target position of the task to be assigned to the target position of the task to be assigned, and record it as the third path; Combine the first path, the second path and the third path to obtain at least one continuous total path; Select the total path with the shortest length as the effective total path, and calculate the time-consuming for the overhead crane 4 to move along the effective total path to obtain the task duration.

[0067] This technical solution mainly involves calculating the first path, the second path, and the third path, then combining these paths and selecting the shortest total path, and finally calculating the task duration. This method solves the problem of accurately calculating the task duration by breaking down the entire task path into three key parts and then comprehensively considering these parts to determine the optimal path.

[0068] The Dijkstra algorithm, A* algorithm or Floyd-Warshall algorithm may be used to plan the first path, the second path and the third path. The calculation processes of the three paths are independent of each other and can be performed simultaneously, thereby improving the overall calculation speed.

[0069] When combining paths, all possible combinations need to be considered. For example, if the equipment distribution area 1 corresponding to the departure location has 3 exits and the equipment distribution area 1 corresponding to the target location has 2 entrances, then a total of 6 entrance and exit combinations need to be considered, and for each entrance and exit combination, the first path, the second path, and the third path connecting the corresponding entrances and exits are used for permutation and combination. For each combination, the total path length needs to be calculated.

[0070] When selecting the shortest total path, you can use a simple comparison algorithm. But if the number of combinations is large, you can consider using a heap data structure to optimize the process and only keep the shortest few paths.

[0071] Finally, when calculating the mission duration (i.e., the time taken for the crane 4 to move along the effective total path), it is necessary to consider the speed characteristics of the crane 4. The effective total path can be divided into segments, and different speed models can be applied according to the characteristics of each segment (such as straight lines, turns, etc.), so as to obtain a more accurate time estimate.

[0072] Through this precise task duration calculation method, the scheduling system can better evaluate and allocate tasks. For example, when the system needs to allocate tasks between multiple overhead cranes 4, it can more accurately estimate the time required for each overhead crane 4 to complete the task, thereby making better allocation decisions. This not only improves the operating efficiency of the entire system, but also reduces task conflicts or equipment idleness caused by inaccurate time estimates.

[0073] Specifically, when the overhead crane 4 performs dynamic path planning according to the assigned transportation task and executes the task according to the planning result, it executes: According to the current position and the starting position and the target position of the assigned transport task, plan an execution path from the current position through the starting position of the assigned transport task to the target position of the assigned transport task; Execute tasks based on the execution path, and dynamically adjust the execution path according to real-time map data during the execution of the task.

[0074] The crane 4 plans the execution path according to the current position, the starting position of the task and the target position, which enables the crane 4 to select the optimal route according to the specific task requirements and improve the transportation efficiency. In the process of executing the task, the crane 4 will dynamically adjust the execution path according to the real-time map data. The real-time map data contains the real-time status information of each key element in the system, such as the position and speed of the crane, the distribution of the track network, the status of the processing equipment, etc. This dynamic adjustment mechanism enables the crane 4 to respond to changes in the system in a timely manner, such as avoiding congested areas or choosing a better path, thereby improving the flexibility and efficiency of the entire scheduling system. The technical solution realizes the intelligent execution of the crane transportation task by combining static path planning and dynamic adjustment. Static planning ensures the rationality of the initial path, while dynamic adjustment ensures flexibility and adaptability during the execution process. This method can effectively cope with complex and changeable factory environments and improve the overall operation efficiency and reliability of the crane scheduling system. In addition, the solution also takes into account the location information of the temporary storage device 6, which echoes the task decomposition mechanism. When the target position is occupied, the crane 4 can temporarily store the goods in a suitable temporary storage device 6, and then continue to perform other tasks, thereby further improving the operation efficiency of the system. In general, this dynamic path planning and execution method fully utilizes the real-time information in the system, enabling the overhead crane 4 to respond to various situations intelligently and maximizing the efficiency and flexibility of the overhead crane dispatching system.

[0075] In this application, the dynamic path planning and execution process of the overhead crane 4 can be implemented in the following ways: First, in the initial path planning stage, the overhead crane 4 can use a variety of algorithms to generate the optimal execution path. For example, the A* algorithm, the Dijkstra algorithm, or the improved ant colony algorithm can be used to calculate the shortest path from the current position to the task starting position and then to the task target position. In this process, the system will consider the topological structure of the rail network and the current traffic conditions. Among them, when planning the initial path (i.e., planning the execution path from the current position through the starting position of the assigned transport task to the target position of the assigned transport task), the combination of the first path, the second path, and the third path mentioned above can be used for planning.

[0076] Secondly, during the mission execution, the crane 4 will read and analyze the map real-time data in real time. The crane can re-evaluate the feasibility of the current path at regular intervals or when important changes are detected (such as obstacles or congestion ahead).

[0077] Thirdly, the dynamic adjustment mechanism can adopt a rolling optimization method. Overhead Crane 4 can perform local path replanning within a certain range around the current position to cope with short-term changes. At the same time, if long-term impacts are detected (such as long-term congestion in a certain track section), Overhead Crane 4 can also trigger global path replanning.

[0078] Finally, in order to improve the overall efficiency of the system, collaborative planning can be carried out between the Skytrains 4. When multiple Skytrains 4 need to use the same road section or pass through the same intersection, they can coordinate their speeds and paths through communication to avoid potential conflicts and congestion.

[0079] In some implementations, the steps of executing a task based on an execution path and dynamically adjusting the execution path according to real-time map data during the execution of the task include: If the assigned transport task is the first new task, the occupancy status of each processing equipment 5 in the equipment distribution area 1 to which the target location of the first new task belongs is obtained in real time; When an idle processing device 5 appears in the equipment distribution area 1 to which the target position of the first new task belongs, the position corresponding to the idle processing device 5 is set as the new target position, and a change request is sent to the central scheduling server 3 to request that the target position of the first new task be changed to the new target position; When the change permission information fed back by the central dispatch server 3 is received, the target location of the first new task is changed to the new target location, and the path from the current location to the new target location is replanned.

[0080] Therefore, in the process of executing the first new task, if it is found that the processing equipment 5 in the equipment distribution area 1 to which the target location belongs is unoccupied, there is no need to temporarily store the task object to improve the scheduling efficiency. At this time, the corresponding second new task needs to be cancelled. Therefore, the central scheduling server 3 is also used to remove the second new task from the scheduling task list after receiving and agreeing to the change request.

[0081] In this document, relational terms such as first and second, etc. are used merely to distinguish one entity or operation from another entity or operation, but do not necessarily require or imply any such actual relationship or order between these entities or operations.

[0082] The above description is only an embodiment of the present application and is not intended to limit the protection scope of the present application. For those skilled in the art, the present application may have various modifications and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application shall be included in the protection scope of the present application.

Claims

1. A crane dispatching system, characterized in that: It comprises a plurality of equipment distribution areas (1), a track network (2), a central dispatching server (3) and a plurality of overhead cranes (4), wherein the overhead cranes (4) are movably arranged on the track network (2) and are communicatively connected with the central dispatching server (3); The equipment distribution area (1) is used to centrally place processing equipment (5), and the same equipment distribution area (1) is used to place the same type of processing equipment (5) for the same process, and different equipment distribution areas (1) are used to place processing equipment (5) for different processes; The track network (2) comprises a plurality of inner ring tracks (201) connected end to end and a plurality of common tracks (202) located outside the inner ring tracks (201); each of the equipment distribution areas (1) is surrounded by one of the inner ring tracks (201); each of the inner ring tracks (201) comprises at least one entrance and at least one exit; the entrance and the exit are connected to an adjacent common track (202) or other adjacent inner ring tracks (201) via a connecting track (203); the inner ring tracks (201) are used for idle overhead cranes to patrol and wait for tasks; a temporary storage device (6) is provided next to at least one of the entrances of each of the inner ring tracks (201); the temporary storage device (6) is used to temporarily store wafer boxes to be sent to the corresponding equipment distribution area (1); The central dispatching server (3) is used to allocate transportation tasks to the overhead travelling vehicle (4); The overhead crane (4) is used to perform dynamic path planning according to the assigned transportation task, and execute the task according to the planning result.

2. The overhead crane dispatching system according to claim 1, characterized in that: The common track (202) includes an outer ring track (204) connected end to end and surrounding all the inner ring tracks (201).

3. The overhead crane dispatching system according to claim 1, characterized in that: When allocating a transport task to the overhead travelling vehicle (4), the central dispatching server (3) executes: S1. Extracting the tasks to be assigned according to the scheduling task list and determining the starting position and target position of the tasks to be assigned; S2. Obtain the current occupancy status of the starting position and the target position of the task to be assigned; the occupancy status is idle or occupied; S3. If the starting position and the target position of the task to be assigned are both free, the task to be assigned is assigned to the best overhead travelling vehicle that can reach the starting position of the task to be assigned the fastest; S4. If the starting position of the task to be assigned is occupied and the target position of the task to be assigned is idle, the task to be assigned is assigned or put back into the scheduling task list according to the time required to release the starting position; S5. If the starting position of the task to be assigned is idle and the target position of the task to be assigned is occupied, the task to be assigned is assigned or the task to be assigned is decomposed and then the new task is assigned according to the task duration and the time required for the target position to be unoccupied; the task duration is the time required for the overhead travelling vehicle (4) to reach the target position from the starting position; S6. If both the starting position and the target position of the task to be assigned are occupied, put the task to be assigned back into the scheduling task list.

4. The overhead crane dispatching system according to claim 3, characterized in that: Step S1 includes: S101. Extracting the tasks to be assigned and the corresponding starting positions and target equipment distribution areas from the scheduling task list in order; S102. According to the position and occupancy status of each processing equipment (5) in the target equipment distribution area, select the position of the processing equipment (5) with the shortest distance and which is idle or the position of the processing equipment (5) whose occupancy status will become idle the earliest as the target position; wherein the occupancy status of the target position is the same as the occupancy status of the processing equipment (5) corresponding to the target position.

5. The overhead crane dispatching system according to claim 4, characterized in that: Step S102 includes: If there is an idle processing device (5) in the target device distribution area, an optimal path from the starting position to the position of each first device is obtained, and the position of the first device corresponding to the shortest optimal path is selected as the target position; the first device is an idle processing device (5) in the target device distribution area; If there is no idle processing equipment (5) in the target equipment distribution area, the time required for each processing equipment (5) in the target equipment distribution area to be unoccupied is obtained, recorded as the first unoccupied time, and the position of the processing equipment (5) corresponding to the shortest first unoccupied time is selected as the target position; wherein the time required for the target position to be unoccupied is the same as the corresponding first unoccupied time.

6. The overhead crane dispatching system according to claim 3, characterized in that: The optimal overhead crane is an idle overhead crane located upstream of the starting position of the task to be assigned or a non-idle overhead crane whose target position of the current task is upstream of the starting position of the task to be assigned; The step of assigning the task to be assigned to the best overhead travelling vehicle that can reach the starting position of the task to be assigned the fastest comprises: Calculate the shortest time required for each first overhead crane to travel from the current position to the starting position of the task to be assigned as the arrival time of the corresponding first overhead crane; the first overhead crane is an idle overhead crane located upstream of the starting position of the task to be assigned; Calculate the shortest time required for each second-day vehicle to complete the current task and go to the starting position of the task to be assigned as the arrival time of the corresponding second-day vehicle; the second-day vehicle is a non-idle overhead crane whose target position of the current task is upstream of the starting position of the task to be assigned; The overhead crane (4) corresponding to the shortest arrival time is selected as the best overhead crane, and the task to be assigned is assigned to the best overhead crane.

7. The overhead crane dispatching system according to claim 3, characterized in that: Step S4 includes: S401. Calculate the time required for releasing the starting position from the total time of the processing steps corresponding to the processing equipment (5) corresponding to the starting position of the task to be assigned and the time used for the current processing task of the processing equipment (5) corresponding to the starting position of the task to be assigned; S402. If the time required to release the starting position is less than the preset scheduling time, the task to be assigned is assigned to the best overhead travelling vehicle that can reach the starting position of the task to be assigned the fastest; S403. If the time required to release the starting position from occupation is not less than the preset scheduling time, the task to be assigned is put back into the scheduling task list.

8. The overhead crane dispatching system according to claim 3, characterized in that: Step S5 includes: S501. Calculate the task duration according to the starting position and the target position of the task to be assigned; S502. Calculate the time required for releasing the target position from occupation based on the total time of the processing steps corresponding to the processing equipment (5) corresponding to the target position of the task to be assigned and the time used for the current processing task of the processing equipment (5) corresponding to the target position of the task to be assigned; S503. If the sum of the task duration and the preset scheduling time is not less than the time required to release the target location, the task to be assigned is assigned to the best overhead travelling vehicle that can reach the starting location of the task to be assigned the fastest; S504. If the sum of the task duration and the preset scheduling time is less than the time required to release the target position, the task to be assigned is decomposed into a first new task and a second new task, and the first new task is assigned to the best overhead travelling vehicle that can reach the starting position of the first new task the fastest, and the second new task is added to the scheduling task list; the starting position of the first new task is the same as the starting position of the task to be assigned, and the target position of the first new task is a position corresponding to one of the temporary storage devices (6) in the equipment distribution area (1) where the target position of the task to be assigned is located; the starting position of the second new task is the same as the target position of the first new task.

9. The overhead crane dispatching system according to claim 8, characterized in that: The step of calculating the task duration according to the starting position and the target position of the task to be assigned comprises: Obtain the shortest path from the starting position of the task to be assigned to each exit of the equipment distribution area (1) corresponding to the starting position of the task to be assigned, recorded as a first path; Obtain the shortest path from each of the exits of the equipment distribution area (1) corresponding to the starting position of the task to be assigned to each of the entrances of the equipment distribution area (1) corresponding to the target position of the task to be assigned, and record it as a second path; Obtaining the shortest path from each entrance of the equipment distribution area (1) corresponding to the target location of the task to be assigned to the target location of the task to be assigned, recorded as a third path; combining the first path, the second path and the third path to obtain at least one continuous total path; The total path with the shortest length is selected as the effective total path, and the time taken for the overhead travelling vehicle (4) to move along the effective total path is calculated to obtain the task duration.

10. The overhead crane dispatching system according to claim 8, characterized in that: The overhead crane (4) performs dynamic path planning according to the assigned transportation task and executes the task according to the planning result, performing: According to the current position and the starting position and the target position of the assigned transport task, plan an execution path from the current position through the starting position of the assigned transport task to the target position of the assigned transport task; The task is executed based on the execution path, and the execution path is dynamically adjusted according to the real-time map data during the execution of the task; the real-time map data includes the position of each overhead crane (4), the speed of each overhead crane (4), the track network distribution data, the position and occupancy status of each processing equipment (5) and the position of each temporary storage device (6).

Citation Information

Patent Citations

  • A crane scheduling method, apparatus, equipment, and readable storage medium

    CN116934059B

  • Multi-AGV intelligent cooperative scheduling method with real-time conflict resolution for complex environment

    CN113780633A

  • Information acquisition method and device, electronic equipment and computer readable medium

    CN114089736A

  • Crown block scheduling method and system, processor and storage medium

    CN116128240A

  • Semiconductor high-efficiency manufacturing chip logistics and intelligent dispatching method and system

    CN118657460A

Cited By

  • Vehicle task allocation method and device, storage medium and electronic equipment

    CN119378961A

  • Crown block relocation control method based on partition cooperation, electronic equipment and medium

    CN122355170A