Map updating method and device based on semiconductor carrying path and computer equipment
By updating the map in real time, combining the position, speed and control information of the sky train, the matching of the sky train and tasks is optimized, and the problem of poor matching caused by ignoring environmental changes in traditional AMHS systems is solved, and the handling efficiency is improved.
Patent Information
- Application Number
- CN202411580130.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-11-07
- Publication Date
- 2024-12-06
- Estimated Expiration
- 2044-11-07
AI Technical Summary
Traditional AMHS systems ignore changes in the operating environment of the sky truck during scheduling, resulting in poor matching of material handling tasks, increasing the average handling time, and urgently need a method that can measure the changes in the operating environment of the sky truck to reduce the matching time.
Provide a map update method based on semiconductor transport path, which can optimize the sky car by obtaining the location, speed information and vehicle control information of the sky car, determine the passage order, calculate the passage time, and make an estimated passage time compensation update on the target map to optimize the sky car Matching with tasks.
By updating the map in real time, the matching time between material handling tasks and the sky truck is reduced, processing efficiency and production efficiency are improved, and the efficient operation of the sky truck is ensured in complex environments.
Smart Images

Figure CN119085636A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of semiconductor technology, and in particular to a map updating method, device and computer equipment based on semiconductor transport paths. Background Art
[0002] In semiconductor factories, AMHS (Automatic Material Handling System) is an automatic material handling system used to transport semiconductor materials such as wafer boxes and SMIF PODs. It plays an important role in improving production efficiency, reducing costs and ensuring product quality. The most important components of the AMHS system include the track system, the overhead crane system, the dispatching system that can dispatch the overhead cranes in clusters, and the road control system when the overhead cranes pass through the switch. All systems work together to ensure that dozens or even hundreds of overhead cranes can operate safely, orderly and efficiently in the same track system to ensure the completion of production tasks.
[0003] In traditional technology, the scheduling system needs to bind the material handling task with the overhead crane and then perform path planning.
[0004] However, traditional technologies do not consider changes in the operating environment of the overhead crane. If there is a traffic jam or a faulty vehicle in the middle, such as blocking the vehicle behind when picking up or placing goods, or slowing down due to waiting when passing a fork, when matching the overhead crane with the task, ignoring the impact caused by these factors will lead to a suboptimal match, resulting in an increase in the ADT (Average Delivery Time) of the task completed in the field. Therefore, a method that can measure changes in the operating environment of the overhead crane is urgently needed to reduce the matching time between the material handling task and the overhead crane and improve the matching efficiency. Summary of the invention
[0005] Based on this, it is necessary to provide a map updating method, device and computer equipment based on semiconductor transport paths that can improve processing efficiency in response to the above technical problems.
[0006] In a first aspect, the present application provides a map updating method based on a semiconductor transport path, the method comprising:
[0007] Obtaining each first position of each overhead travelling vehicle at a first moment in the target map;
[0008] Determining the planned paths of the overhead cranes in the target map based on the first positions of the overhead cranes, acquiring the overlapping sections that the overhead cranes will pass through according to the planned paths, and determining the passage order of the overhead cranes to arrive at the overlapping sections;
[0009] Acquiring speed information and vehicle control information of each of the overhead cranes;
[0010] Performing data information processing based on the passage sequence, the first positions of the overhead cranes, speed information, and vehicle control information to obtain the passage time of the overhead cranes;
[0011] The estimated travel time of each road section in the target map is compensated and updated based on the travel time of each overhead crane.
[0012] In one embodiment, determining the planned path of each overhead crane in the target map based on the first position of each overhead crane includes:
[0013] Based on the allocation results of each handling task and each overhead crane, the handling task corresponding to each overhead crane is obtained, and the starting point and end point of each task corresponding to each handling task are obtained;
[0014] Obtaining a target map, wherein the target map includes an estimated travel time for each road section;
[0015] Path planning is performed based on the current position of each of the overhead cranes, the starting point and the end point of each of the tasks, and the estimated travel time of each of the road sections to obtain a planned path for each of the overhead cranes.
[0016] In one embodiment, the path planning is performed based on the current position of each of the overhead cranes, the starting point and the end point of each of the tasks, and the estimated travel time of each road section to obtain the planned path of each of the overhead cranes, including:
[0017] Constructing a path planning model based on the current position of each overhead crane, the starting point and the end point of each task, and the estimated travel time of each road section;
[0018] Based on the total task execution time of each of the transport tasks, the path planning model is solved to obtain the planned path of each of the overhead cranes.
[0019] In one embodiment, the method further comprises:
[0020] Obtaining conflict constraint information, wherein the conflict constraint information includes at least one of point conflict constraint information and line conflict constraint information; the point conflict constraint information is that any two overhead cranes are in different positions at any time; the line conflict constraint information is that any two overhead cranes cannot travel in opposite directions on the same road section at any time;
[0021] The path planning model is solved based on the total task execution time of each of the transport tasks to obtain the planned path of each of the overhead cranes, including:
[0022] The path planning model is solved based on the total task execution time of each of the transport tasks and the conflict constraint information to obtain a planned path for each of the overhead cranes.
[0023] In one optional embodiment, the travel time of the overhead cranes includes the delayed travel time of each overhead crane passing through each road section in the target map and / or the relative travel time of each overhead crane passing through each road section in the target map.
[0024] In one of the optional embodiments, the travel time of the overhead crane includes at least one of the second travel time of each overhead crane through each road section in the target map, the delayed travel time of each overhead crane through each road section in the target map, and the relative travel time of each overhead crane through each road section in the target map; the delayed travel time is obtained based on the first travel time of each overhead crane through each road section in the target map at full speed; or the relative travel time is the difference between the second travel times of each overhead crane calculated in two adjacent cycles.
[0025] In one embodiment, the travel time of the overhead crane includes a delayed travel time; data information processing is performed based on the travel sequence, each of the first positions of each of the overhead cranes, speed information, and vehicle control information to obtain the travel time of each of the overhead cranes, including:
[0026] Processing the passage sequence, the first positions of the overhead cranes, speed information, and vehicle control information based on a vehicle passage model to obtain non-full-speed movement speeds and non-full-speed movement displacement planning information of the overhead cranes;
[0027] Based on the target speed of each of the overhead cranes and the displacement planning information of the non-full-speed motion of each of the overhead cranes, a first travel time of each of the overhead cranes is obtained;
[0028] Based on the speed of the non-full-speed movement of each of the overhead cranes and the displacement planning information of the non-full-speed movement, a second travel time of each of the overhead cranes is obtained;
[0029] The difference between each of the second passing times and the corresponding first passing time is used as the delayed passing time of each of the overhead cranes.
[0030] In one embodiment, the travel time of the overhead crane includes a relative travel time; the data information processing based on the travel sequence, each of the first positions of each of the overhead cranes, speed information and vehicle control information to obtain the travel time of each of the overhead cranes includes: based on a vehicle travel model, the data information processing of the travel sequence, each of the first positions of each of the overhead cranes, speed information and vehicle control information to obtain the speed of non-full-speed movement of each of the overhead cranes and the displacement planning information of non-full-speed movement;
[0031] Based on the speed of the non-full-speed movement of each of the overhead cranes and the displacement planning information of the non-full-speed movement, a second travel time of each of the overhead cranes is obtained;
[0032] The relative transit time is the difference between the second transit times calculated by two adjacent vehicle traffic model processing cycles of each of the overhead cranes within a map update cycle, wherein the map update cycle is greater than the vehicle traffic model processing cycle; or, the relative transit time is the difference between the second transit times calculated based on two adjacent map update cycles of each of the overhead cranes.
[0033] In one embodiment, the data information processing based on the passage sequence, the first positions of the overhead cranes, the speed information and the vehicle control information to obtain the passage time of each overhead crane, the speed of the non-full-speed movement of each overhead crane and the displacement planning information of the non-full-speed movement includes:
[0034] Determining a current overhead travelling vehicle to pass through the overlapping road section based on the passage sequence, and determining a current initial time and a current end time based on each of the first positions corresponding to the current overhead travelling vehicle;
[0035] The current end time is the time when the current overhead travelling vehicle arrives at the overlapping section;
[0036] When the current overhead travelling crane is the first overhead travelling crane that continuously passes through the overlapping road section, the current initial time is the time when the distance between the current overhead travelling crane and the overlapping road section is the target distance;
[0037] When the current overhead travelling vehicle is not the first overhead travelling vehicle that continuously passes through the overlapping road section, the current initial time is the last current end time;
[0038] Determine the current front vehicle and the current rear vehicle that continuously pass through the overlapping road section based on the passing order;
[0039] Determining a distance between the current leading vehicle and the current trailing vehicle based on the first positions of the overhead cranes and the vehicle control information;
[0040] Based on the speed information of the current leading vehicle and the distance between the current leading vehicle and the current trailing vehicle, obtaining the speed of the current trailing vehicle in a non-full-speed movement and the displacement planning information of the non-full-speed movement in a current time period, wherein the current time period is from the current initial moment to the current end moment;
[0041] The current rear vehicle is taken as a new current front vehicle, and a current rear vehicle corresponding to the new current front vehicle is determined based on the passage order, and the step of determining the distance between the current front vehicle and the current rear vehicle based on each of the first positions of each of the overhead cranes and the vehicle control information is continued until all the overhead cranes are traversed according to the passage order;
[0042] When the number of overhead cranes that have not passed the overlapping section is greater than a preset value, the next overhead crane to pass the overlapping section is determined as the current overhead crane based on the passage order, and the current initial time and the current end time are continuously determined based on the first positions corresponding to the current overhead crane until the number of overhead cranes that have not passed the overlapping section is equal to the preset value.
[0043] In one embodiment, the method further comprises:
[0044] Determine the current road section where the current following vehicle is located at the current initial moment;
[0045] The compensating and updating the estimated travel time of each road section in the target map based on the travel time of each overhead crane includes:
[0046] Determine a target overhead traveling vehicle in the current section at the current initial moment based on the passage sequence;
[0047] Based on the delayed travel time of the target overhead travelling vehicle, the estimated travel time of the current road section in the current time period is updated.
[0048] In one embodiment, before obtaining the speed of the current rear vehicle in the current time period and the displacement planning information of the non-full-speed movement based on the speed information of the current front vehicle and the distance between the current front vehicle and the current rear vehicle, the method further includes:
[0049] Obtaining a current reference displacement of the current following vehicle based on the speed information of the current following vehicle, the current end time and the current initial time;
[0050] In the case where the current reference displacement is greater than the distance between the current front vehicle and the current rear vehicle, the step of obtaining the speed of the current rear vehicle in the current time period and the displacement planning information of the non-full-speed movement based on the speed information of the current front vehicle and the distance between the current front vehicle and the current rear vehicle is continued;
[0051] When the current reference displacement is less than or equal to the distance between the current leading vehicle and the current trailing vehicle, the estimated travel time of the current road section in the current time period is kept unchanged.
[0052] In one embodiment, obtaining the speed of the current rear vehicle in the current time period and the displacement planning information of the non-full-speed movement based on the speed information of the current front vehicle and the distance between the current front vehicle and the current rear vehicle includes:
[0053] Determining speed constraint information of the current rear vehicle based on speed information of the current front vehicle, wherein the speed constraint information includes that the final speed of the current rear vehicle is less than or equal to the final speed of the current front vehicle;
[0054] Determine, based on the distance between the current front vehicle and the current rear vehicle, displacement constraint information of the current rear vehicle, wherein the displacement constraint information is that the displacement of the current rear vehicle is less than or equal to the distance between the current front vehicle and the current rear vehicle;
[0055] Speed and displacement planning is performed based on the speed constraint information and the displacement constraint information to obtain the speed of the current following vehicle in the current time period and the displacement planning information of the non-full-speed movement.
[0056] In one of the embodiments, the speed constraint information also includes a speed variation of the current following vehicle with respect to a speed variation of the current leading vehicle.
[0057] In one embodiment, the process of processing the passage sequence, the first positions of the overhead cranes, the speed information and the vehicle control information based on the vehicle passage model to obtain the speed of the non-full-speed movement of the overhead cranes and the displacement planning information of the non-full-speed movement also includes:
[0058] When there is an overlapped road section after the overhead crane passes through different road sections in the fork area, a fork traffic model is obtained as the vehicle traffic model of each overhead crane corresponding to the fork area; and a following vehicle traffic model is obtained as the vehicle traffic model of other overhead cranes.
[0059] In one embodiment, the vehicle traffic model is a fork traffic model; and determining the distance between the current front vehicle and the current rear vehicle based on the first positions of the overhead cranes and the vehicle control information includes:
[0060] In the case where the current front vehicle and the current rear vehicle are located at different sections of the fork area, the first distance between the current rear vehicle and the fork area at the current initial moment is determined based on the first positions of the overhead cranes; and the first distance is used as the distance between the current front vehicle and the current rear vehicle.
[0061] In one embodiment, the vehicle traffic model is a vehicle following traffic model; the determining the distance between the current leading vehicle and the current trailing vehicle based on the first positions of the overhead cranes and the vehicle control information comprises:
[0062] In the case where the overhead cranes are traveling sequentially on the same road section, a second distance between the current front vehicle and the current rear vehicle at the current initial moment is determined based on the first positions of the overhead cranes; displacement planning information of non-full-speed movement of the current front vehicle is obtained, and a third distance between the current front vehicle and the current rear vehicle at the current end moment is determined based on the second distance and the displacement planning information of non-full-speed movement of the current front vehicle, and the third distance is used as the distance between the current front vehicle and the current rear vehicle.
[0063] In one embodiment, the process of processing the passage sequence, the first positions of the overhead cranes, the speed information and the vehicle control information based on the vehicle passage model to obtain the speed of the non-full-speed movement of the overhead cranes and the displacement planning information of the non-full-speed movement also includes:
[0064] In the case where there is an overlapped road section after the overhead cranes pass through different road sections in the fork area, the overhead cranes corresponding to the curved road section in the fork area are obtained; in the case where the overhead cranes corresponding to the curved road section pass through the curved road section, the overhead cranes corresponding to the curved road section are projected to the straight road section in the fork area; and a vehicle following traffic model is obtained as a vehicle traffic model for each overhead crane;
[0065] When the overhead cranes travel sequentially on the same road section, a vehicle following traffic model is obtained as a vehicle traffic model of each overhead crane.
[0066] In one embodiment, the vehicle traffic model is a vehicle following traffic model; the determining the distance between the current leading vehicle and the current trailing vehicle based on the first positions of the overhead cranes and the vehicle control information comprises:
[0067] In the case where there is an overlapping section after the overhead crane passes through different sections in the fork area, the target position of the current front vehicle or the current rear vehicle located on the curved road section projected onto the straight road section is obtained as the first position of the current front vehicle or the current rear vehicle at the current initial moment, and the step of determining the second distance between the current front vehicle and the current rear vehicle at the current initial moment based on the first positions of each overhead crane is continued to obtain the distance between the current front vehicle and the current rear vehicle.
[0068] In one embodiment, the method further comprises:
[0069] Get the updated target map;
[0070] Obtain information on each handling task and each overhead crane;
[0071] Based on the updated target map, the allocation results of each of the transporting tasks and each of the overhead cranes are obtained.
[0072] In a second aspect, the present application further provides a map updating device based on a semiconductor transport path, the device comprising:
[0073] A planning path acquisition module, used for acquiring each first position of each overhead travelling vehicle at a first moment in a target map;
[0074] A passage sequence acquisition module, used for determining the planned path of each overhead crane in the target map based on the first position of each overhead crane, acquiring the overlapping road sections that each overhead crane will pass through according to each planned path, and determining the passage sequence of each overhead crane when arriving at the overlapping road sections;
[0075] An information acquisition module, used to acquire speed information and vehicle control information of each overhead crane;
[0076] A delayed passage time acquisition module, configured to process data information based on the passage sequence, the first positions of the overhead cranes, speed information, and vehicle control information to obtain the passage time of each overhead crane;
[0077] A map updating module is used to compensate and update the estimated travel time of each road section in the target map based on the travel time of each overhead crane.
[0078] In a third aspect, the present application further provides a computer device, comprising a memory and a processor, wherein the memory stores a computer program, and the processor implements the steps of the method in any one of the above-mentioned embodiments when executing the computer program.
[0079] The above-mentioned map updating method, device and computer equipment based on the semiconductor handling path obtain the first positions of each overhead crane at the first moment in the target map; determine the planned path of each overhead crane in the target map based on the first position of each overhead crane, obtain the overlapping sections that each overhead crane will pass through according to each planned path, and determine the passage order of each overhead crane to reach the overlapping sections; and obtain the speed information and vehicle control information of each overhead crane; thus, based on the vehicle passage model, the passage order, the first positions of each overhead crane, the speed information and the vehicle control information are processed to obtain the passage time of each overhead crane; based on the passage time of each overhead crane, the estimated passage time of each section in the target map is compensated and updated, so that the subsequent matching of the overhead crane and the task is based on the updated target map, which reduces the matching time between the material handling task and the overhead crane and improves the processing efficiency. BRIEF DESCRIPTION OF THE DRAWINGS
[0080] In order to more clearly illustrate the technical solutions in the embodiments of the present application or related technologies, the drawings required for use in the embodiments of the present application or related technical descriptions will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without paying creative work.
[0081] FIG1 is a diagram showing an application environment of a map updating method based on a semiconductor transport path in one embodiment;
[0082] FIG2 is a schematic flow chart of a method for updating a map based on a semiconductor transport path in one embodiment;
[0083] FIG3 is a flow chart of the non-full speed motion planning steps of each overhead crane in one embodiment;
[0084] FIG4 is a schematic diagram of a branch road traffic model in one embodiment;
[0085] FIG5 is a first graph of velocity and displacement planning in one embodiment;
[0086] FIG6 is a schematic diagram of a vehicle following traffic model in one embodiment;
[0087] FIG7 is a second graph of velocity and displacement planning in one embodiment;
[0088] FIG8 is a third graph of velocity and displacement planning in one embodiment;
[0089] FIG9 is a fourth graph of velocity and displacement planning in one embodiment;
[0090] FIG10 is a fifth graph of velocity and displacement planning in one embodiment;
[0091] FIG11 is a sixth graph of velocity and displacement planning in one embodiment;
[0092] FIG12 is a schematic diagram of a vehicle following traffic model in another embodiment;
[0093] FIG13 is a flow chart of a method for planning multiple paths of multiple overhead cranes in a semiconductor handling system in one embodiment;
[0094] FIG14 is a schematic diagram of a flow chart of a method for allocating transport tasks in one embodiment;
[0095] FIG15 is a flow chart of a method for allocating transport tasks in another embodiment;
[0096] FIG16 is a block diagram of a map updating device based on a semiconductor transport path according to an embodiment;
[0097] FIG17 is a diagram showing the internal structure of a computer device in one embodiment;
[0098] Fig.18 A partial track system for each overhead travelling vehicle in one embodiment;
[0099] Fig.19 An overhead traveling vehicle running on a rail system in one embodiment. DETAILED DESCRIPTION
[0100] In order to make the purpose, technical solution and advantages of the present application more clearly understood, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.
[0101] The map updating method based on the semiconductor handling path provided in the embodiment of the present application can be applied to the AMHS (Automatic Material Handling System) as shown in Figure 1. The AMHS mainly includes a track installed on the ceiling in a suspended manner, an overhead crane traveling on the track, a storage device arranged under or on the side of the track, a production machine and other equipment. The overhead crane stops when it travels along the track to the target position, and can grab materials from the production machine, storage device and other equipment, or place the materials on the equipment. The track has interconnected straight track sections, curved track sections, and cross track sections (also called forks). The overhead crane travels straight on the straight track section, changes the direction of travel on the curved track section, and merges or diverges in the fork area where the cross track section is located.
[0102] Among them, in AMHS, as many as hundreds of overhead hoist transfers (OHTs) will run on the same track system according to the instructions of the scheduling system, grabbing wafer boxes from the starting point of the task and placing them at the end point of the task. Each overhead hoist is relatively independent and runs on the track to perform the corresponding task. After grabbing the wafer box, it will travel on the track system according to the path planned by the scheduling system.
[0103] Therefore, each task needs to be assigned to an overhead crane to execute, which inevitably requires path planning for each overhead crane and the assignment of corresponding tasks to each overhead crane. In this application, new tasks are obtained through MCS and sent to the MSTC system. The MSTC system calls the corresponding algorithm to implement the assignment of tasks and overhead cranes, and after path planning based on the assignment results of tasks and overhead cranes, the planned path is sent to the overhead crane so that the overhead crane can execute the corresponding task. MSTC sends the assignment results to MCS so that MCS can monitor the execution of the task. The MSTC system also calls the corresponding algorithm to implement the path planning of the overhead crane based on the target map and the assignment results, and implements the update of the target map based on the planned path of the overhead crane, and sends the planned path to the corresponding overhead crane so that the overhead crane can execute the corresponding task.
[0104] The present application provides a map updating method based on semiconductor transport paths, comprising: obtaining each first position of each overhead crane at a first moment in a target map; determining a planned path of each overhead crane in the target map based on the first position of each overhead crane, obtaining the overlapping sections that each overhead crane will pass through according to each planned path, and determining the passage order of each overhead crane to arrive at the overlapping sections; obtaining speed information and vehicle control information of each overhead crane; performing data information processing based on the passage order, each first position of each overhead crane, speed information and vehicle control information to obtain the passage time of each overhead crane; compensating and updating the estimated passage time of each section in the target map based on the passage time of each overhead crane, so that subsequent matching of the overhead crane and the task is based on the updated target map, reducing the matching time between the material handling task and the overhead crane and improving the processing efficiency.
[0105] In an exemplary embodiment, as shown in FIG2 , a map updating method based on a semiconductor transport path is provided, and the method is applied to the MSTC system in FIG1 as an example for explanation, including the following steps S202 to S210. Among them:
[0106] S202: Acquire each first position of each overhead travelling vehicle at a first moment in the target map.
[0107] S204: determining the planned paths of the overhead cranes in the target map based on the first positions of the overhead cranes, acquiring the overlapping sections that the overhead cranes will pass through according to the planned paths, and determining the passage order of the overhead cranes when arriving at the overlapping sections.
[0108] The planned path of the overhead crane is generated based on the handling task assigned to the overhead crane, for example, the planned path of the overhead crane is generated based on the starting point and end point of the handling task assigned to the overhead crane and the target map. It should be noted that the planned path includes several first positions in the target map, so the planned path of the overhead crane is generated based on the target map and the starting point and end point of the handling task and the current position of the overhead crane. The planned path of each overhead crane includes each first position of the overhead crane in the target map at each first moment, for example, pi= , where pi represents the planned path of the ith overhead travelling vehicle, represents the first position of the i-th overhead travelling vehicle at the first moment T. For specific limitations on the target map, please refer to the following.
[0109] The overlapping section is the overlapping part of the planned paths of at least two overhead cranes, wherein it can be determined based on each first position in the planned path whether there is an overlapping section in the planned paths of any two overhead cranes, and if there is an overlapping section, the passage order of each overhead crane arriving at the overlapping section is determined. Optionally, when it is determined based on each first position in the planned path that there is an overlapping section in the planned paths of any two overhead cranes, the overhead cranes corresponding to the planned paths with the overlapping section are added to a set, and the passage order of the overhead cranes is determined based on the first moment when each overhead crane in each set arrives at the overlapping section, wherein arriving at the overlapping section can be the starting position of arriving at the overlapping section, that is, the starting overlapping position of the planned paths of each overhead crane.
[0110] S206: Acquire speed information and vehicle control information of each overhead crane.
[0111] The speed information of the overhead crane includes the current speed of the overhead crane, which may be assigned to the overhead crane through model planning or calculation; or the current speed may be reported by the overhead crane, that is, used as the initial speed of the overhead crane when calculating the delayed travel time of each overhead crane.
[0112] The vehicle control information may include an acceleration / deceleration model and / or a safety distance. The acceleration / deceleration model is the acceleration of the overhead crane when accelerating and the deceleration when decelerating. The acceleration and deceleration may be fixed or variable, and are not specifically limited here. The safety distance is the distance between any two overhead cranes without collision.
[0113] S208: Performing data information processing based on the passage sequence, the first positions of the overhead cranes, the speed information, and the vehicle control information to obtain the passage time of the overhead cranes.
[0114] In one of the optional embodiments, the travel time of the overhead cranes includes at least one of the second travel time of each overhead crane through each road section in the target map, the delayed travel time of each overhead crane through each road section in the target map, and the relative travel time of each overhead crane through each road section in the target map; the delayed travel time is obtained based on the first travel time of each overhead crane through each road section in the target map using the target speed (full speed); or the relative travel time is the difference between the second travel times of each overhead crane calculated in two adjacent cycles.
[0115] In one embodiment, the travel time of the overhead cranes includes the delayed travel time of each overhead crane passing through each road section in the target map and / or the relative travel time of each overhead crane passing through each road section in the target map.
[0116] The method for obtaining the second travel time of each overhead crane through each road section in the target map includes: processing the travel order, each of the first positions of each overhead crane, speed information and vehicle control information based on a vehicle travel model to obtain the speed of non-full-speed movement of each overhead crane and the displacement planning information of non-full-speed movement; and obtaining the second travel time of each overhead crane based on the speed of non-full-speed movement of each overhead crane and the displacement planning information of non-full-speed movement.
[0117] The delayed travel time of the overhead crane is the delayed travel time of the overhead crane compared to when the overhead crane passes the corresponding road section at the target speed. The target speed may be the speed of the overhead crane at full speed, such as the maximum speed of the overhead crane. Thus, the delayed travel time is the difference between the second travel time corresponding to the non-full speed movement of each overhead crane and the first travel time corresponding to the full speed movement of the overhead crane. The target speed is not equal to the speed of the non-full speed movement.
[0118] In one embodiment, the relative travel time is the difference between the second travel times calculated by two adjacent vehicle traffic model processing cycles of each overhead crane within a map update cycle; wherein the map update cycle is greater than the vehicle traffic model processing cycle. Specifically, the map update cycle is, for example, 10 seconds, and the vehicle traffic model calculation cycle for calculating the second travel time of the overhead crane is 2 seconds. Then, the second travel time of an overhead crane calculated within 10 seconds can be iterated 5 times, and the difference between the second travel times between two adjacent times is the relative travel time of the overhead crane. Among them, two adjacent vehicle traffic model processing cycles are correspondingly recorded as the previous cycle and the next cycle. For an overhead crane, the previous second travel time corresponding to the overhead crane in the previous cycle can be obtained, and the next second travel time corresponding to the overhead crane in the next cycle can also be obtained. In this way, the difference obtained by subtracting the previous second travel time from the next second travel time is the current relative travel time. Among them, the map can be a target map.
[0119] In some embodiments, the relative travel time is the difference between the second travel times calculated in two adjacent map update cycles of each overhead crane. The update cycles of two adjacent target maps are recorded as the previous cycle and the next cycle. For an overhead crane, the previous second travel time corresponding to the overhead crane in the previous cycle can be obtained, and the next second travel time corresponding to the overhead crane in the next cycle can also be obtained. In this way, the difference obtained by subtracting the previous second travel time from the next second travel time is the current relative travel time. The map can be a target map.
[0120] The influence of the passing order on the delayed passing time is that the passing of the front vehicle may affect the passing of the rear vehicle, thereby prolonging the passing time of the rear vehicle.
[0121] The influence of the first positions of the overhead cranes on the delayed travel time is due to the need to maintain a safe distance between the overhead cranes.
[0122] The influence of speed information on the delayed travel time is that if the speed of the front vehicle is lower than that of the rear vehicle, the front vehicle and the rear vehicle may collide within a period of time, so it is necessary to control the rear vehicle to decelerate and / or the front vehicle to accelerate.
[0123] The acceleration / deceleration model in the vehicle control information is used to control the speed of the overhead crane based on the speed information, and the safety distance is used to control the distance between the overhead cranes based on the first positions of the overhead cranes.
[0124] In one of the optional embodiments, the travel time of the overhead crane includes a delayed travel time; data information processing is performed based on the travel sequence, the first positions of each overhead crane, speed information and vehicle control information to obtain the travel time of each overhead crane, including: processing the travel sequence, the first positions of each overhead crane, speed information and vehicle control information based on a vehicle travel model to obtain the speed of non-full-speed movement of each overhead crane and the displacement planning information of non-full-speed movement; obtaining the first travel time of each overhead crane based on the displacement planning information of non-full-speed movement of each overhead crane and the target speed of each overhead crane; obtaining the second travel time of each overhead crane based on the speed of non-full-speed movement of each overhead crane and the displacement planning information of non-full-speed movement; and taking the difference between each second travel time and the corresponding first travel time as the delayed travel time of each overhead crane.
[0125] Due to the influence of the front vehicle, the rear vehicle is in non-full-speed motion, which causes a delay in the time for the rear vehicle to reach the overlapping section. Therefore, the traffic order, the first positions of each overhead crane, speed information and vehicle control information can be processed based on the vehicle traffic model to obtain the non-full-speed speed and non-full-speed displacement planning information of each overhead crane.
[0126] Among them, when performing speed and displacement planning of non-full-speed movement, the front vehicle and the rear vehicle can be determined based on the passage order, and then the speed and displacement are planned so that when the front vehicle reaches the overlapping section, the rear vehicle does not collide with the front vehicle, thereby obtaining the speed of the rear vehicle and the displacement planning information of non-full-speed movement. In this way, based on the displacement planning information of non-full-speed movement, the first passage time required for the overhead crane to move at full speed under the same displacement can be calculated. Based on the speed of non-full-speed movement of each rear vehicle and the displacement planning information of non-full-speed movement, the second passage time of each overhead crane in order to prevent the rear vehicle from colliding with the front vehicle when the overhead crane is moving at non-full speed is obtained, and the difference between each second passage time and the corresponding first passage time is used as the delayed passage time of each overhead crane.
[0127] S210: compensating and updating the estimated travel time of each road section in the target map based on the travel time of each overhead travelling vehicle.
[0128] The map updating method based on the semiconductor handling path obtains the first positions of each overhead crane at the first moment in the target map; determines the planned paths of each overhead crane in the target map based on the first positions of each overhead crane, obtains the overlapping sections that each overhead crane will pass through according to the planned paths, and determines the passage order of each overhead crane to arrive at the overlapping sections; and obtains the speed information and vehicle control information of each overhead crane; thus, data information processing is performed based on the passage order, the first positions of each overhead crane, the speed information and the vehicle control information to obtain the passage time of each overhead crane; based on the passage order, the first positions of each overhead crane, the speed information and the vehicle control information, data information processing is performed to obtain the passage time of each overhead crane; based on the passage time of each overhead crane, the estimated passage time of each section in the target map is compensated and updated, so that the subsequent matching of the overhead crane and the task is based on the updated target map, which reduces the matching time between the material handling task and the overhead crane and improves the processing efficiency.
[0129] In one of the optional embodiments, the planned path of each overhead crane in the target map is determined based on the first position of each overhead crane, including: based on the allocation results of each handling task and the overhead crane, obtaining the handling task corresponding to each overhead crane, and obtaining the starting point and end point of each task corresponding to each handling task; obtaining the target map, the target map including the estimated travel time of each road section; performing path planning based on the current position of each overhead crane, the starting point and end point of each task and the estimated travel time of each road section, to obtain the planned path of each overhead crane.
[0130] The allocation results of each handling task and each overhead crane are obtained by MSTC calling the task allocation algorithm. The input of the task allocation algorithm is each handling task, each overhead crane and the target map, and the output is the allocation results of each handling task and each overhead crane. For specific limitations, please refer to the following.
[0131] In this embodiment, the MSTC calls the path planning algorithm to implement the path planning of each overhead crane, wherein the input of the path planning algorithm is the task starting point and end point corresponding to each transport task and the target map obtained based on the allocation results of each transport task and each overhead crane, and the output is the planned path of each overhead crane.
[0132] After each transport task is assigned to each overhead crane, the starting point of each overhead crane's path is the starting point of the transport task, and the end point is the end point of the transport task. In other optional embodiments, if the overhead crane is a scheduled vehicle, that is, the overhead crane needs to complete the delivery first and then proceed to a new transport task, then the delivery path of the overhead crane is the semiconductor transport path that has been planned, and the new path that needs to be planned for the overhead crane is the path from the end position of the previous task to the starting point of the new transport task, and the path from the starting point to the end point. In this application, only the path from the end position of the previous task to the starting point of the new transport task can be planned first, and after the overhead crane arrives at the starting point, the path from the starting point to the end point can be planned, or all paths can be planned at one time, and no specific limitation is made here.
[0133] In one of the optional embodiments, path planning is performed based on the current position of each overhead crane, the starting point and the end point of each task, and the estimated travel time of each road section to obtain the planned path of each overhead crane, including: constructing a path planning model based on the current position of each overhead crane, the starting point and the end point of each task, and the estimated travel time of each road section; solving the path planning model based on the total task execution time of each handling task to obtain the planned path of each overhead crane.
[0134] The target map includes positions and sections, and each section includes an estimated travel time. Assume that the target map G=(B, E), where B is the position in the target map, and E is the section in the target map. There are k handling tasks, corresponding to k overhead cranes A={a1,a2…ak}. Then the starting point si∈B and the end point gi∈B of each overhead crane, and the point occupied by the overhead crane ai at any time is unique. A path planning model is established and solved. The purpose is to find a set of paths P={p1,p2..pk} so that the total task execution time of the overhead crane meets the requirements, such as the shortest total task execution time. Among them, pi represents the path of ai, pi= , pi consists of a set of vertices where T>0.
[0135] In this embodiment, the path planning model may be solved by using the RHCR (Rolling-Horizon Collision Resolution) algorithm. In other embodiments, other algorithms may also be used, which are not specifically limited here.
[0136] In one of the optional embodiments, the method also includes: obtaining conflict constraint information, the conflict constraint information including at least one of point conflict constraint information and line conflict constraint information; the point conflict constraint information is that any two overhead cranes are in different positions at any time; the line conflict constraint information is that any two overhead cranes cannot travel towards each other on the same road section at any time; based on the total task execution time of each handling task, solving the path planning model to obtain the planned path of each overhead crane, including: solving the path planning model based on the total task execution time of each handling task and the conflict constraint information to obtain the planned path of each overhead crane.
[0137] The point conflict constraint information is that at any time any two overhead cranes are in different positions, that is This is not true, where the overhead cranes ai and aj are both at position b at time t.
[0138] The line conflict constraint information is that at any time, any two overhead cranes cannot travel in opposite directions on the same section of road, that is, It is not true, that is, it is not true that overhead cranes ai and aj cross the same section of road in opposite directions at the same time.
[0139] In this way, by solving the path planning model, a set of paths P={p1,p2..pk} is found so that the total task execution time of the overhead crane meets the requirements, and any two paths are conflict-free, including point conflicts and line conflicts.
[0140] In the above embodiment, time and space are introduced when performing path planning through the target map, and the obtained planned path also includes time and space, which lays a foundation for subsequent updating of the target map and also for subsequent control of the overhead crane.
[0141] In one of the optional embodiments, as shown in FIG. 3 , FIG. 3 is a flow chart of the non-full-speed motion planning steps of each overhead crane in one embodiment, the non-full-speed motion planning steps of each overhead crane, that is, processing the passage sequence, each first position of each overhead crane, speed information and vehicle control information based on the vehicle passage model to obtain the delayed passage time of each overhead crane, and obtain the speed of the non-full-speed motion of each overhead crane and the displacement planning information of the non-full-speed motion, including:
[0142] S302: Determine the current overhead travelling vehicle to pass through the overlapping section based on the passage sequence, and determine the current initial time and the current end time based on the first positions corresponding to the current overhead travelling vehicle, wherein the current end time is the time when the current overhead travelling vehicle reaches the overlapping section.
[0143] Among them, when the current overhead crane is the first overhead crane to pass through the overlapping section continuously, the current initial moment is the moment when the distance between the current overhead crane and the overlapping section is the target distance; when the current overhead crane is not the first overhead crane to pass through the overlapping section continuously, the current initial moment is the previous current end moment.
[0144] As shown in Figure 4, Figure 4 is a schematic diagram of a branch road traffic model in an embodiment. In this embodiment, each overhead crane passes through the overlapping section in sequence. Therefore, the current overhead crane passing through the overlapping section can be determined in sequence based on the traffic order. As shown in Figure 4, overhead crane OHT1 is first used as the current overhead crane passing through the overlapping section, and the speed and displacement planning of non-full-speed movement of overhead crane OHT2 and overhead crane OHT3 is performed. Then, overhead crane OHT2 is used as the current overhead crane, and the speed and displacement planning of non-full-speed movement of overhead crane OHT3 is performed.
[0145] When the current overhead crane is the first overhead crane that continuously passes through the overlapping section, the current initial moment is the moment when the distance between the current overhead crane and the overlapping section is the target distance, specifically, the moment when the distance between the first position of the current overhead crane and the starting point of the overlapping section is the target distance, and the target distance can be a preset fixed distance, such as 10 meters, or other values in other embodiments. When the current overhead crane is not the first overhead crane that continuously passes through the overlapping section, the current initial moment is the last current end moment, the moment when the last current overhead crane passed through the overlapping section. The current end moment is the moment when the current overhead crane reaches the overlapping section, that is, the moment when it reaches the starting point of the overlapping section.
[0146] The current time period is obtained based on the current initial moment and the current end moment. This application requires the delayed passage time of each rear vehicle due to the passage of the front vehicle in each current time period, and obtains the delayed passage time of the road section where each rear vehicle is located based on the delayed passage time.
[0147] S304: Determine the current front vehicle and the current rear vehicle that continuously pass through the overlapping road sections based on the passing order.
[0148] This embodiment involves two loops. The first loop is the loop of the car, that is, it is necessary to calculate once in each current time period the speed of each rear car caused by the front car and the displacement planning information of the non-full-speed movement. The second is the loop of the current time period, that is, it is necessary to calculate the speed of the non-full-speed movement and the displacement planning information of the non-full-speed movement corresponding to each rear car in each current time period.
[0149] This step is for the first cycle. As shown in FIG4 , when there are three overhead cranes, overhead cranes OHT2 and OHT3 are not moving at full speed because overhead crane OHT1 passes through the overlapping section. Therefore, it is necessary to calculate the non-full-speed movement of overhead cranes OHT2 and OHT3 in turn, so as to first determine the current front vehicle and the current rear vehicle based on the passage order, where as shown in FIG4 , in the first vehicle cycle, the current front vehicle is overhead crane OHT1, and the current rear vehicle is overhead crane OHT2; in the second vehicle cycle, the current front vehicle is overhead crane OHT2, and the current rear vehicle is overhead crane OHT3.
[0150] S306: Determine the distance between the current leading vehicle and the current trailing vehicle based on the first positions of the overhead cranes and the vehicle control information.
[0151] The distance between the current front vehicle and the current rear vehicle is to ensure a safe distance. This distance is not the actual distance between the current front vehicle and the current rear vehicle, but the maximum displacement of the current rear vehicle in the current time period.
[0152] Optionally, if the current front vehicle and the current rear vehicle are on the same section of road in the fork area or the current front vehicle and the current rear vehicle are on a straight road section, the maximum displacement may be the sum of the displacement of the current front vehicle in the current time period and the distance between the current front vehicle and the current rear vehicle at the current initial moment; if the current front vehicle and the current rear vehicle are on different sections of road in the fork area, the maximum displacement is the distance between the current rear vehicle and the overlapping section at the current initial moment.
[0153] S308: Based on the speed information of the current front vehicle and the distance between the current front vehicle and the current rear vehicle, obtain the speed of the current rear vehicle in non-full-speed motion and the displacement planning information of the non-full-speed motion in the current time period, where the current time period is from the current starting moment to the current ending moment.
[0154] The main purpose of speed and displacement planning is to prevent the current front vehicle and the current rear vehicle from colliding within the current time period, thereby obtaining the speed of the current rear vehicle and the displacement planning information of non-full-speed movement.
[0155] A speed and displacement model is introduced, in which the displacement of the current rear vehicle is constrained based on the distance between the current front vehicle and the current rear vehicle, and the displacement of the current rear vehicle is constrained based on the speed information of the current front vehicle, thereby obtaining the speed of the current rear vehicle in non-full-speed motion in the current time period and the displacement planning information of the non-full-speed motion.
[0156] S310: The current rear vehicle is taken as the new current front vehicle, and the current rear vehicle corresponding to the new current front vehicle is determined based on the passage order, and the step of determining the distance between the current front vehicle and the current rear vehicle based on the first positions of the overhead cranes and the vehicle control information is continued until all the overhead cranes are traversed according to the passage order.
[0157] S312: When the number of overhead cranes that have not passed the overlapping section is greater than a preset value, the next overhead crane to pass the overlapping section is determined as the current overhead crane based on the passage order, and the current initial time and the current end time are continuously determined based on the first positions corresponding to the current overhead crane until the number of overhead cranes that have not passed the overlapping section is equal to the preset value.
[0158] Step S310 is the control step of the first loop. If the current overhead crane is overhead crane OHT1, the overhead cranes to be traversed are overhead cranes OHT2 and OHT3; if the current overhead crane is overhead crane OHT2, the overhead crane to be traversed is overhead crane OHT3. Each time, the overhead cranes arranged in the order of passage need to be traversed to realize the first loop.
[0159] Step S312 is the control step of the second loop. If the number of overhead cranes that have not passed the overlapping section is greater than a preset value, which may be 1, it is necessary to continue to determine the next overhead crane to pass the overlapping section as the current overhead crane based on the passage sequence, and determine the current time period in order to calculate the delayed passage time of each following vehicle in the new current time period.
[0160] In the above embodiment, the delayed travel time of each following vehicle in each current time period is calculated respectively through two loops, so as to calculate the delayed travel time of the corresponding road section.
[0161] In one of the optional embodiments, the method also includes: determining the current road section where the current following vehicle is located at the current initial moment; compensating and updating the estimated travel time of each road section in the target map based on the travel time of each overhead crane, including: determining the target overhead crane in the current road section at the current initial moment based on the travel order; updating the estimated travel time of the current road section in the current time period based on the delayed travel time of the target overhead crane.
[0162] In the present application, the current road section where the current rear vehicle is located at the current initial moment is first determined, so that after calculating the speed of the current rear vehicle's non-full-speed movement and the displacement planning information of the non-full-speed movement, the delayed passage time of the current rear vehicle can be calculated. The delayed passage time of a section is the delayed passage time of the last overhead crane in the section. Therefore, it is necessary to determine the target overhead crane in the current section at the current initial moment based on the passage sequence, which can be optionally the last overhead crane. The estimated passage time of the current section in the current time period is obtained based on the delayed passage time of the last overhead crane. For example, the delayed passage time can be directly used as the estimated passage time, or the sum of the first passage time obtained by passing at full speed and the delayed passage time can be used as the estimated passage time.
[0163] As shown in Figure 4, when the overhead crane OHT1 arrives at the overlapping section from the current initial moment to the current end moment, the overhead crane OHT2 is located at the section P-P1, and the overhead crane OHT3 is located at the section P1-P2. Therefore, the estimated passage time of the section P-P1 is obtained based on the delayed passage time of the overhead crane OHT2 in the current time period, and the estimated passage time of the section P1-P2 is obtained based on the delayed passage time of the overhead crane OHT3 in the current time period.
[0164] In one of the optional embodiments, before obtaining the speed and displacement planning information of the non-full-speed movement of the current rear vehicle in the current time period based on the speed information of the current front vehicle and the distance between the current front vehicle and the current rear vehicle, it also includes: obtaining the current reference displacement of the current rear vehicle based on the speed information of the current rear vehicle, the current end time and the current initial time; when the current reference displacement is greater than the distance between the current front vehicle and the current rear vehicle, continuing to execute the step of obtaining the speed and displacement planning information of the non-full-speed movement of the current rear vehicle based on the speed information of the current front vehicle and the distance between the current front vehicle and the current rear vehicle; when the current reference displacement is less than or equal to the distance between the current front vehicle and the current rear vehicle, keeping the estimated travel time of the current road section in the current time period unchanged.
[0165] This embodiment is used to determine whether it is necessary to perform speed and displacement planning for the current rear vehicle at non-full speed. That is to say, if the current front vehicle and the current rear vehicle do not pass through the overlapping section within a certain time range, but are separated by a long time, the passage of the current front vehicle will not affect the passage of the current rear vehicle.
[0166] To this end, the current reference displacement of the current rear vehicle is calculated based on the speed information of the current rear vehicle, the current end time and the current initial time, and the current reference displacement=the speed information of the current rear vehicle*the current time period.
[0167] If the current reference displacement is greater than the distance between the front vehicle and the rear vehicle, it means that if the current rear vehicle runs at the current speed, the current rear vehicle and the current front vehicle may collide. Therefore, it is necessary to plan the speed and displacement of the current rear vehicle, that is, there is a delayed passage time for the current rear vehicle.
[0168] If the current reference displacement is less than or equal to the distance between the current front vehicle and the current rear vehicle, the current rear vehicle cannot collide with the current front vehicle. Therefore, there is no need to plan the speed and displacement of the current rear vehicle, and the delayed travel time of the road section where the current rear vehicle is located is 0, thereby keeping the estimated travel time of the current road section in the current time period unchanged.
[0169] In addition, optionally, since the current front vehicle does not affect the passage of the current rear vehicle, it is impossible to affect the passage of the vehicle after the current rear vehicle. For this reason, the overhead cranes corresponding to the overlapping section can be split based on the current rear vehicle and the passage order to obtain two sets, and then the overhead cranes in each set are processed according to the above method.
[0170] In the above embodiment, whether speed and displacement planning of non-full speed movement of the rear vehicle is required is determined based on the current reference displacement and the distance between the front vehicle and the rear vehicle, thereby reducing the amount of calculation and improving processing efficiency.
[0171] In one of the optional embodiments, based on the speed information of the current leading vehicle and the distance between the current leading vehicle and the current rear vehicle, the speed of the current rear vehicle in the current time period and the displacement planning information of the non-full-speed movement are obtained, including: based on the speed information of the current leading vehicle, the speed constraint information of the current rear vehicle is determined, the speed constraint information includes that the final speed of the current rear vehicle is less than or equal to the final speed of the current leading vehicle; based on the distance between the current leading vehicle and the current rear vehicle, the displacement constraint information of the current rear vehicle is determined, the displacement constraint information is that the displacement of the current rear vehicle is less than or equal to the distance between the current leading vehicle and the current rear vehicle; speed and displacement planning is performed based on the speed constraint information and the displacement constraint information to obtain the speed of the current rear vehicle in the current time period and the displacement planning information of the non-full-speed movement.
[0172] In one of the optional embodiments, the speed constraint information also includes a speed change of the current rear vehicle with the speed of the current front vehicle.
[0173] In this embodiment, the speed and displacement planning of the non-full-speed movement of the current rear vehicle in the current time period can be obtained based on the analysis of speed change and displacement change, and restricted based on the corresponding constraint information, as shown in Figure 5, wherein the overhead crane OHT1 is the current front vehicle, the overhead crane OHT2 is the current rear vehicle, and when the speed V1 of the overhead crane OHT1 is less than V2 of the overhead crane OHT2, if the overhead crane OHT1 is moving at a constant speed, the overhead crane OHT2 decelerates to the speed of the overhead crane OHT1. Specifically, the speed constraint information includes that the final speed of the current rear vehicle is less than or equal to the final speed of the current front vehicle, and the displacement constraint information is that the displacement of the current rear vehicle is less than or equal to the distance between the current front vehicle and the current rear vehicle. The speed curve and the displacement curve are drawn based on the speed constraint information and the displacement constraint information to obtain the speed of the non-full-speed movement of the current rear vehicle in the current time period and the displacement planning information of the non-full-speed movement.
[0174] In one of the optional embodiments, before the traffic order, the first positions of each overhead crane, the speed information and the vehicle control information are processed based on the vehicle traffic model to obtain the speed of non-full-speed movement and the displacement planning information of non-full-speed movement of each overhead crane, it also includes: when there is an overlapping section after the overhead crane passes through different sections in the fork area, the fork traffic model is obtained as the vehicle traffic model of each overhead crane corresponding to the fork area; the following vehicle traffic model is obtained as the vehicle traffic model of other overhead cranes.
[0175] The vehicle traffic model in this embodiment includes a fork model and a following vehicle model, wherein in the fork model, the overhead crane passes through different sections of the fork area and there are overlapping sections, so the overhead crane is located at different sections of the fork area. In the following vehicle model, the overhead crane passes through the same section sequentially.
[0176] In one alternative embodiment, the vehicle passing model is a branch passing model; determining the distance between the current leading vehicle and the current following vehicle based on the respective first positions of the respective overhead cranes and the vehicle control information includes: in the case where the current leading vehicle and the current following vehicle are located in different sections of the branch area, determining the first distance between the current following vehicle and the branch area at the current initial moment based on the respective first positions of the respective overhead cranes.
[0177] In one alternative embodiment, the vehicle passing model is a following vehicle passing model; determining the distance between the current leading vehicle and the current following vehicle based on the respective first positions of the respective overhead cranes and the vehicle control information includes: in the case where the respective overhead cranes are traveling in sequence on the same section, determining the second distance between the current leading vehicle and the current following vehicle at the current initial moment based on the respective first positions of the respective overhead cranes; obtaining the displacement planning information of the current leading vehicle during non-full-speed movement, and determining the third distance between the current leading vehicle and the current following vehicle at the current end moment based on the second distance and the displacement planning information of the current leading vehicle during non-full-speed movement, and taking the third distance as the distance between the current leading vehicle and the current following vehicle.
[0178] Specifically, as shown in FIGS. 4 and 5, in this embodiment, three overhead cranes are taken as an example for illustration. In other embodiments, the number of overhead cranes can also be other values. Based on the planned path, the overhead crane OHT1(P, t1) passes through point P at time t1; the overhead crane OHT2(P, t2) passes through point P at time t2; the overhead crane OHT3(P, t3) passes through point P at time t3. Therefore, the passing sequence is overhead crane OHT1, overhead crane OHT2, and overhead crane OHT3. To prevent the overhead crane OHT2 from colliding with the overhead crane OHT1 at point P and the overhead crane OHT3 from colliding with the overhead crane OHT2, it is necessary to obtain the distance between the overhead crane OHT2 and the overhead crane OHT1 at the current initial moment. Since the overhead crane OHT2 and the overhead crane OHT1 are located in different sections of the branch area, the branch passing model needs to be adopted. Based on the overhead crane OHT2 and the overhead crane OHT1, determine the first distance between the overhead crane OHT2 and the branch area at the current initial moment; take the first distance as the distance between the current leading vehicle and the current following vehicle. Combining FIG. 4, that is, L2 is the distance between the overhead crane OHT2 and the overhead crane OHT1.
[0179] The current time period is (t0, t1). Therefore, it is judged whether the displacement S2 of the overhead crane OHT2 at the current speed in (t0, t1) is greater than L2.
[0180] If S2 = V2 * (t1 - t0) < L2, the safety distance can be guaranteed and deceleration is not required. Therefore, the estimated passing time of the section PP1 where the overhead crane OHT2 is located in the time period (t0, t1) is p.
[0181] If S2= V2* (t1-t0)>L2, the overhead crane OHT2 needs to slow down to avoid colliding with the overhead crane OHT1 at point P. Combined with Figure 5, the speed and displacement of the overhead crane OHT2 are planned so that the displacement of the overhead crane OHT2 satisfies the displacement constraint S2≤L2, and the speed satisfies the speed constraint V2<=V1, that is, the final speed of the overhead crane OHT2 is less than or equal to the final speed of the overhead crane OHT1, so that the displacement of the overhead crane OHT2 in the time period t1-t0 can be obtained. and final speed .
[0182] In one of the optional embodiments, in combination with FIG6 , FIG6 is a schematic diagram of a following vehicle model in an embodiment. In this embodiment, it is still assumed that the current initial time is t0 and the current end time is t1. At this time, the overhead crane OHT1 arrives at point P, so that the overhead crane OHT1, the overhead crane OHT2 and the overhead crane OHT3 are on a straight road. Therefore, the following vehicle model is required, and the displacement planning information of the non-full-speed motion of the overhead crane OHT2 is also obtained, so that the distance between the overhead crane OHT3 and the overhead crane OHT2 can be calculated, and then the speed of the overhead crane OHT2 and the displacement planning information of the non-full-speed motion of the overhead crane OHT3 can be calculated based on the speed of the overhead crane OHT2 and the distance between the overhead crane OHT3 and the overhead crane OHT2.
[0183] For the overhead crane OHT3, since the overhead crane OHT2 and the overhead crane OHT3 are located on the same section of the fork area, the following vehicle model is adopted to determine the second distance between the overhead crane OHT2 and the overhead crane OHT3 at the current initial moment based on the first positions of the overhead crane OHT2 and the overhead crane OHT3; the displacement planning information of the non-full-speed movement of the overhead crane OHT2 is obtained, and based on the second distance and the displacement planning information of the non-full-speed movement of the overhead crane OHT2, the third distance between the overhead crane OHT2 and the overhead crane OHT3 at the current end moment is determined, and the third distance is used as the distance between the overhead crane OHT2 and the overhead crane OHT3.
[0184] Determine whether the displacement S3 of OHT3 at the current speed in the time period t1-t0 is greater than the second distance L3+ .
[0185] If S3=v3*(t1-t0) <L3+ , it can ensure a safe distance without slowing down, pass point P at time t3, and keep the estimated travel time of the section P1P2 where OHT3 is located in the time period t0-t1 unchanged.
[0186] If S3=v3*(t1-t0)>L3+ , then OHT3 needs to decelerate to avoid colliding with the overhead crane OHT2. Combining with Figure 5, the speed and displacement of the overhead crane OHT3 are planned so that the displacement of the overhead crane OHT3 satisfies the displacement constraint S3 ≤ L3 + , and the speed satisfies the speed constraint V3 <= V2, that is, the final speed of the overhead crane OHT3 is less than or equal to the final speed of the overhead crane OHT2. Thus, the displacement and the final speed of the overhead crane OHT3 within the time period t1 - t0 can be obtained.
[0187] Since there are several cases for the speed of the overhead crane OHT1, they will be discussed separately as follows:
[0188] As shown in Figure 5, when V1 < V2, if the overhead crane OHT1 is moving forward at a constant speed, the overhead crane OHT2 decelerates to the speed of the overhead crane OHT1, and the overhead crane OHT3 decelerates to the speed of the overhead crane OHT2.
[0189] As shown in Figure 7, when V2 < V1, if the overhead crane OHT1 is moving forward at a constant speed, the overhead crane OHT2 accelerates to the speed of the overhead crane OHT1, and the overhead crane OHT3 accelerates to the speed of the overhead crane OHT2.
[0190] As shown in Figure 8, when V1 < V2, if the speed change of the overhead crane OHT1 is accelerating first and then moving at a constant speed, the speed change of the overhead crane OHT2 is decelerating first and then moving at a constant speed following the overhead crane OHT1, and the speed change of the overhead crane OHT3 is also decelerating first and then moving at a constant speed following the overhead crane OHT2, or only according to the final speed of the overhead crane OHT1, the overhead crane OHT2 follows; the overhead crane OHT3 follows the overhead crane OHT2 according to the final speed of the overhead crane OHT2.
[0191] As shown in Figure 9, when V1 > V2, if the speed change of the overhead crane OHT1 is accelerating first and then moving at a constant speed, the speed change of the overhead crane OHT2 is also accelerating first and then moving at a constant speed following the overhead crane OHT1, and the speed change of the overhead crane OHT3 is also accelerating first and then moving at a constant speed following the overhead crane OHT2, or only according to the final speed of the overhead crane OHT1, the overhead crane OHT2 follows; the overhead crane OHT3 follows the overhead crane OHT2 according to the final speed of the overhead crane OHT2.
[0192] As shown in Figure 10, when V1 < V2, if the speed change of the overhead crane OHT1 is decelerating first and then moving at a constant speed, the speed change of the overhead crane OHT2 is also decelerating first and then moving at a constant speed following the overhead crane OHT1, and the speed change of the overhead crane OHT3 is also decelerating first and then moving at a constant speed following the overhead crane OHT2. In addition, the following speed and following change of the overhead crane OHT2 can be calculated according to the final speed of the overhead crane OHT1 at the moment t1; the following speed and speed change of the overhead crane OHT3 can be calculated according to the final speed of the overhead crane OHT2 at the moment t1.
[0193] As shown in FIG. 11, when V2 < V1, if the speed change of the overhead crane OHT1 is deceleration followed by uniform motion, the speed change of the overhead crane OHT2 is also deceleration followed by uniform motion and follows the overhead crane OHT1, and the speed change of the overhead crane OHT3 is also deceleration followed by uniform motion and follows the overhead crane OHT2. In addition, the following speed and following change of the overhead crane OHT2 can be calculated according to the final speed of the overhead crane OHT1 at time t1; the following speed and speed change of the overhead crane OHT3 can be calculated according to the final speed of the overhead crane OHT2 at time t1.
[0194] In one optional embodiment, before processing the passing order, the first positions and speed information of each overhead crane, and the vehicle control information based on the vehicle passing model to obtain the speed of the non-full-speed movement of each overhead crane and the displacement planning information of the non-full-speed movement, it further includes: when there is an overlapping section after different sections of the overhead crane passing through the fork area, obtaining each overhead crane corresponding to the curved section in the fork area; when each overhead crane corresponding to the curved section passes through the curved section, projecting each overhead crane corresponding to the curved section to the straight section of the fork area; obtaining the car-following passing model as the vehicle passing model of each overhead crane; when each overhead crane travels in the same section order, obtaining the car-following passing model as the vehicle passing model of each overhead crane.
[0195] In one optional embodiment, the vehicle passing model is a car-following passing model; determining the distance between the current leading vehicle and the current following vehicle based on the first positions of each overhead crane and the vehicle control information includes: when there is an overlapping section after different sections of the overhead crane passing through the fork area, obtaining the target position of the current leading vehicle or the current following vehicle located in the curved section projected to the straight section as the first position of the current leading vehicle or the current following vehicle at the current initial moment, determining the second distance between the current leading vehicle and the current following vehicle at the current initial moment based on the first positions of each overhead crane, determining the third distance between the current leading vehicle and the current following vehicle at the current end moment based on the second distance and the displacement planning information of the non-full-speed movement of the current leading vehicle, and taking the third distance as the distance between the current leading vehicle and the current following vehicle.
[0196] As shown in FIG. 12, in this embodiment, the fork model and the car-following model are classified as the car-following model. In this embodiment, when there is an overlapping section after different sections of the overhead crane passing through the fork area, the overhead crane in the curved section is projected to the straight section, and then the car-following model is used to calculate the speed and the displacement planning information of the non-full-speed movement.
[0197] In the case where there is an overlapping section after the overhead crane passes through different sections in the fork area, the target position of the current front vehicle or the current rear vehicle located on the curved road section projected to the straight road section is obtained as the first position of the current front vehicle or the current rear vehicle at the current initial moment, so that the distance between the current front vehicle and the current rear vehicle is calculated in the same way as the straight road model in the above text. Combined with the distance between the overhead crane OHT1 and the overhead crane OHT2 in Figure 12 is L2', which will not be repeated here.
[0198] In one of the optional embodiments, the method further includes: obtaining an updated target map; obtaining information of each transport task and each overhead crane; and obtaining allocation results of each transport task and each overhead crane based on the updated target map.
[0199] Among them, in this embodiment, after the target map is updated, the target map is also used for the allocation of each transport task and each overhead crane. Specifically, the updated target map includes the estimated travel time of each road section, so that the task cost corresponding to the execution of the corresponding transport task by any overhead crane can be determined based on these estimated travel times, and then the allocation result of each transport task and each overhead crane can be determined based on the total task cost.
[0200] For ease of understanding, as shown in Figure 13, MSTC first obtains the initial state of the target map, which includes the time between any two points that each overhead crane passes at full speed as the estimated travel time, and then allocates each transport task, each overhead crane and the target map of the initial state to obtain the allocation results of each transport task and each overhead crane. The allocation results are then used as input for the path planning step to obtain the path planning result, and the target map is periodically updated based on the path planning result. Subsequently, the allocation step is performed based on the target map, each transport task and each overhead crane, and the above allocation steps and path planning steps are repeated until the end.
[0201] In an exemplary embodiment, as shown in FIG14 , a method for allocating transport tasks is provided, which is described by taking the method applied to the MSTC system in FIG1 as an example, and includes the following steps 1402 to 1408 . Among them:
[0202] S1402: Obtain a target map that is periodically generated based on the planned paths of each overhead travelling vehicle, wherein the target map includes an estimated travel time for any road section.
[0203] The target map is generated periodically based on the planned path of each overhead crane, and the target map includes the estimated travel time of any road section. In addition, the planned path of each overhead crane is generated in real time, so on the one hand, the planned path of each overhead crane is dynamic, and on the other hand, the target map obtained based on the planned path is also dynamic. In the initial state, since there is no overhead crane and no task, the initial target map is based on the time it takes for each overhead crane to pass through any road section at full speed as the estimated travel time. When there is an overhead crane traveling on the track, the estimated travel time of any road section is calculated based on the planned path of the overhead crane. One point that needs to be explained is that the planned path of the overhead crane here is obtained by path planning for each overhead crane that has been assigned a handling task, and the overhead crane assigned to the handling task can be the allocation result of the previous allocation cycle.
[0204] Optionally, the target map is periodically acquired in the present application so that the basis for each semiconductor handling task and overhead crane allocation is a real-time target map, fully considering the driving environment of the overhead crane, that is, considering the impact of path planning on task matching, thereby improving the accuracy of task and overhead crane matching.
[0205] S1404: Acquire information of each transport task and each overhead crane.
[0206] In one of the optional embodiments, information of each transport task and each overhead crane is obtained, including: obtaining an initial transport task, and obtaining each transport task based on the initial transport task; the initial transport task includes a target transport task and a transport task newly added in this cycle, and the target transport task is a task that has been assigned an overhead crane in the previous allocation cycle but has not been completed; obtaining the overhead crane corresponding to the target transport task and the currently idle overhead crane as the overhead crane.
[0207] The transport tasks may include the newly added transport tasks in the current allocation cycle. Optionally, the transport tasks may also include the target transport tasks that have been assigned to the overhead crane in the previous allocation cycle but have not been completed. The target transport tasks can be understood as the transport tasks that have not been completed in the previous cycle. The transport tasks that have not been completed in the previous cycle include the transport tasks that have not been picked up (the transport tasks of the overhead crane going to the pickup point). It should be noted that obtaining the handling task here includes obtaining the pickup position, delivery position, task type, task information, etc. of the handling task, wherein the pickup position and delivery position can be represented by the track information corresponding to the storage device at the time of pickup and the storage device at the time of delivery and the specific position information on the track; wherein the task type includes the first task type (handling tasks newly added in this cycle), the second task type (target handling tasks) and other task types, the first task type is that after obtaining the corresponding pickup position and delivery position, the overhead crane shall first perform the pickup task and then the delivery task; the second task type is that after obtaining the corresponding delivery task position and pickup task position, the overhead crane shall first perform the delivery task and then the pickup task; other task types include that in an allocation cycle, the number of overhead cranes is greater than the number of tasks, and some overhead cranes shall operate in a specific area to be allocated to the handling tasks of the next cycle, wherein the specific area is usually an area with a higher handling frequency, which can reduce the time consumed by the overhead crane to the pickup position corresponding to the task; wherein the task information at least includes the task number, task location information, and task type information.
[0208] The overhead cranes include at least one of an idle overhead crane in the current allocation cycle and an overhead crane corresponding to the target handling task, wherein the idle overhead crane is an overhead crane that is not currently assigned a task, and the overhead cranes that are not currently assigned a task include overhead cranes that have never been assigned a task and overhead cranes that were released after completing the task in the previous cycle. The overhead cranes corresponding to the target handling task include at least one of a first crane and a second crane. The first crane is an overhead crane that goes to the pickup point of the handling task, that is, an overhead crane that performs a handling task without picking up the goods. The second crane is an overhead crane that goes to the delivery point of the handling task, that is, an overhead crane that performs a handling task without delivering the goods after picking up the goods. It should be noted that the overhead cranes here refer to overhead cranes that need to be reallocated for handling tasks, so these overhead cranes need to re-plan their paths after reallocating the handling tasks, that is, currently these overhead cranes do not have planned paths to perform the handling tasks allocated in this allocation cycle.
[0209] In addition, it should be noted that the present application replaces the handling tasks and overhead cranes related to the previous allocation cycle to the current allocation cycle (wherein, the handling tasks related to the previous allocation cycle refer to: unfinished handling tasks; the overhead cranes related to the previous allocation cycle refer to: overhead cranes that have not completed handling tasks and overhead cranes released after completing handling tasks), so that the relevant parameters between adjacent allocation cycles can be dynamically updated, the parameters used by the task matching model in the current allocation cycle are closer to the actual operation scenario, and the allocation method of handling tasks and overhead cranes is easier to obtain the optimal solution, which solves the problem that the allocation of handling tasks and overhead cranes in the current allocation cycle is not the optimal solution due to ignoring the allocation results of the previous allocation cycle. In addition, it should be noted that the overhead crane here is an overhead crane in the software category, which can be understood as overhead crane information, and the overhead crane information can uniquely determine the corresponding hardware overhead crane.
[0210] S1406: Determine the task cost of each transport task assigned to each overhead crane based on the estimated travel time of any road section, the crane position of each overhead crane and the task position of each transport task.
[0211] In one of the optional embodiments, the task cost includes a first task cost when the overhead crane is in a running state and a second task cost when the overhead crane is in a blocked state; the blocked state is a state where the overhead crane is blocked by other overhead cranes; the running state is a state where the overhead crane is not blocked by other overhead cranes. The blocked state is a state where the overhead crane cannot move due to other overhead cranes picking up goods, that is, the overhead crane can only stop and wait.
[0212] The first task cost is the first task cost when the overhead crane corresponding to the handling task is assigned, and the first task cost is obtained based on the current position of the overhead crane, the task position of the handling task, and the estimated travel time of any road section. Optionally, the first task cost can be represented by the path travel time, for example, the first task cost is the path travel time between the current position of the overhead crane and the task position of the handling task, and the path travel time and can be obtained by the Floyd algorithm based on the estimated travel time of any road section in the target map. Other algorithms can also be used in other embodiments, and no specific limitation is made here.
[0213] In this embodiment, multiple allocation results of handling tasks and each overhead crane can be obtained. In each allocation result, one handling task can only be allocated to one overhead crane, and one overhead crane corresponds to one handling task. Therefore, the first task cost in this application includes the path travel time corresponding to each handling task assigned to each overhead crane, and the first task cost corresponding to each allocation result can be calculated.
[0214] The second task cost is the blocking cost corresponding to each handling task assigned to each overhead crane when each overhead crane performs each handling task. For example, the blocking cost of overhead crane m blocking overhead crane i can be represented by the pickup time. For example, the blocking cost of overhead crane m blocking overhead crane i is the pickup time of overhead crane m. Optionally, the pickup time can be a pre-set fixed value. In addition, the pickup time can also be set based on the pickup type corresponding to the handling task. Different pickup types of different handling tasks correspond to different fixed values. In addition, it should be noted that due to the introduction of the dynamic map, the influence of the operation of other overhead cranes on the operation of the currently assigned overhead crane is also introduced. Therefore, it is only necessary to consider the influence of other overhead cranes on the operation of the currently assigned overhead crane when picking up goods, that is, the second task cost.
[0215] Optionally, the Floyd algorithm can be used to determine the picking path of the overhead crane when the transport task is assigned, and the picking points of each transport task are fixed, so the picking points on the picking path can be obtained, and then the picking cost of the overhead crane when the transport task is assigned is obtained based on the number of picking points, and the sum of the picking costs of all the assignment results is used as the second task cost.
[0216] In addition, it is necessary to explain that, in some optional embodiments, the blocking cost may also include the situation that when the path of the overhead crane includes a turning section (switching from a straight track to a curved track) when performing a handling task, the blocking cost may also be characterized by adding an extra time to pass through the curved track on the basis of the pickup time, for example, the overhead crane m needs to pass through one or more of the above-mentioned turning tracks when performing a handling task. Optionally, the extra time may be a pre-set specific value, that is, whenever the path of the overhead crane includes switching from a straight track to a curved track, the speed of the overhead crane needs to switch from a first speed to a second speed, wherein the second speed is less than the first speed, that is, the time required for the overhead crane to run at the second speed is different from the time required to run at the first speed, and the difference between the time required to run at the second speed and the time required to run at the first speed is the extra time, wherein the switching from the straight track to the curved track here does not include the situation where multiple vehicles need to queue up and pass in a specified order, such as overlapping track sections, merging track sections, and diverging track sections, and only corresponds to the situation where the overhead crane needs to switch from a straight track to a track in another direction.
[0217] S1408: Establish a task matching model based on the task cost, and obtain the allocation results of each handling task and each overhead crane based on the task matching model.
[0218] The task matching model can be established based on the first task cost and the second task cost. The task matching model can be a mixed integer programming mathematical model. In other embodiments, the task matching model can also be other models, which are not specifically limited here.
[0219] Optionally, establishing a task matching model based on the task cost includes: taking a minimum value of a sum of a first task cost and a second task cost as the task matching model.
[0220] By solving the task matching model, the allocation results of each handling task and each overhead crane can be obtained. For example, when the comprehensive task cost (the sum of the first task cost and the second task cost) is determined to be the minimum, the allocation result of the handling task and each overhead crane is the final allocation result.
[0221] Optionally, the task matching model may be solved by using a corresponding solver, and no specific limitation is imposed on the type of solver.
[0222] The above-mentioned method for allocating handling tasks obtains a target map periodically generated based on the planned paths of each overhead crane, and matches each handling task with each overhead crane based on the estimated travel time of any road section in the target map. Specifically, the task cost of allocating each handling task to each overhead crane is determined based on the estimated travel time of any road section, the crane position of each overhead crane and the task position of each handling task. In this way, establishing a task matching model based on the task cost fully takes into account the operating environment of the overhead crane to be matched, and the matching of the handling task to be matched and the overhead crane to be matched are processed separately, which can improve the matching efficiency.
[0223] In one of the optional embodiments, based on the estimated travel time of any road section, the crane position of each overhead crane and the task position of each transport task, the second task cost of each transport task assigned to each overhead crane is determined, including: determining each task path based on the estimated travel time of any road section, the crane position of each overhead crane and the task position of each transport task; based on the number of valid pickup points on each task path, obtaining the second task cost of each transport task assigned to each overhead crane, wherein the valid pickup point is the pickup point of the transport task for which the pickup has not been completed, the valid pickup point corresponds to the transport task, and the transport task corresponding to the valid pickup point has been assigned a corresponding overhead crane.
[0224] Among them, the task path can be determined by a corresponding algorithm based on the estimated travel time of any road section, with the crane position of each crane and the task position of each handling task as the starting point and the end point respectively. The corresponding algorithm can be the Floyd algorithm. In other embodiments, the corresponding algorithm can also be other algorithms.
[0225] The task paths are different for different overhead cranes. For example, for an idle overhead crane and the first crane, the task path is a task path generated by taking the crane position of the overhead crane as the starting point and the task location (pick-up point) of the handling task as the end point; for the second crane, the task path is a task path generated by taking the crane position of the overhead crane as the starting point, taking the delivery location of the original task of the second crane as the transfer point, and taking the task location (pick-up point) of the handling task as the end point.
[0226] Since the pickup points for the transport task are known and the pickup costs are pre-set, the corresponding pickup costs for each task path can be determined based on the number of pickup points on each task path. The pickup cost corresponding to each task path can be the number of pickup points, or the task cost of each pickup point multiplied by the number of pickup points to obtain the corresponding pickup cost for the task path. The task cost of each pickup point can refer to the limitation of the pickup time above, and the sum of all pickup costs is the second task cost.
[0227] Optionally, the second task cost is less than a task cost threshold, and the task cost threshold is generated based on a target number of valid pickup points; the allocation results of each handling task and each overhead crane are obtained based on a task matching model, including: when the second task cost is less than the task cost threshold, solving the task matching model to obtain the allocation results of each handling task and each overhead crane.
[0228] The task cost threshold is generated based on the target number of valid pickup points. For example, the number of valid pickup points on the pickup path of the overhead crane to be matched is less than the target number, for example, less than 3. In other embodiments, it can be other values. The task cost threshold can be obtained based on the target number, that is, the task cost threshold is equal to the product of the target number and the task cost of each valid pickup point.
[0229] Therefore, when solving the task matching model, the second task cost less than the task cost threshold can be used as a constraint condition to screen the allocation results of each handling task and each overhead crane, so that the second task cost in the allocation results of each handling task and each overhead crane is less than the task cost threshold, thereby avoiding excessively high task costs and resulting in reduced handling efficiency.
[0230] In the above embodiment, the mutual influence between the various overhead cranes is fully considered, so that the final allocation of the overhead cranes and tasks is more accurate.
[0231] In one of the optional embodiments, based on the estimated travel time of any road section, the first task cost of each transport task assigned to each overhead crane is determined, including: based on the estimated travel time of any road section, the crane position of each overhead crane and the task position of each transport task, the first travel cost is determined; and the first travel cost is used as the first task cost of the overhead crane.
[0232] The overhead crane in this embodiment is an idle overhead crane. Therefore, the estimated travel time of any road section can be directly based on the overhead crane position as the starting point and the task position of each transport task as the end point to generate the first travel cost, that is, the travel time between the starting point and the end point. Specifically, it can be calculated by the Floyd algorithm. In other embodiments, it can also be obtained by other algorithms.
[0233] In one of the optional embodiments, the overhead crane includes a first crane that goes to a pickup point for an assigned transport task; determining a first task cost for each transport task assigned to each overhead crane, including: determining a second travel cost based on an estimated travel time of any road section, the crane position of each first crane, and the task position of each transport task; obtaining a pre-set task abandonment cost; and obtaining a first task cost corresponding to the first crane based on the second travel cost and the task abandonment cost.
[0234] The overhead crane in this embodiment is the first crane, that is, the overhead crane going to the pick-up point of the assigned handling task, that is, the overhead crane that has been assigned a handling task in the previous allocation cycle, and the overhead crane is currently going to the pick-up point of the assigned handling task. In this cycle, the first crane is reassigned a new handling task, then the cost of the first crane to perform the new handling task includes the second travel cost from the overhead crane position of the first crane to the task location (pick-up point) of the handling task, and the task abandonment cost of the first crane abandoning the handling task assigned in the previous cycle.
[0235] The method for determining the second pass cost can refer to the method for determining the first pass cost, which will not be repeated here. The task abandonment cost can be a preset fixed value, and optionally the task abandonment cost can be set to different fixed values based on different task types, which is not specifically limited here.
[0236] In one of the optional embodiments, the overhead crane includes a second crane that goes to the delivery point of the handling task; determining the first task cost of each handling task assigned to each overhead crane, including: determining the third travel cost based on the estimated travel time of any road section, the overhead crane position of each second crane, the position of the delivery point of the second crane's current task and the task position of each handling task; obtaining a preset delivery cost; and obtaining the first task cost corresponding to the second crane based on the third travel cost and the delivery cost.
[0237] The overhead crane in this embodiment is the second-day crane, that is, the overhead crane that has picked up the goods and is going to the delivery point of the assigned handling task, that is, the overhead crane that has been assigned a handling task in the previous allocation cycle, and the overhead crane is currently going to the delivery point of the assigned handling task. In this cycle, the second-day crane is reassigned a new handling task, then the cost of the second-day crane to perform the new handling task includes the third travel cost from the overhead crane position of the second-day crane to the task position (delivery point) of the handling task assigned in the previous cycle and from the task position (delivery point) of the handling task assigned in the previous cycle to the task position (pick-up point) of the handling task assigned in this cycle. Therefore, the third travel cost includes two parts. The first part is the travel cost from the overhead crane position of the second day's vehicle to the task location (drop point) of the handling task assigned in the previous cycle. The path corresponding to the travel cost is the planned path of the second day's vehicle. Therefore, it can be obtained based on the planned path of the second day's vehicle and the estimated travel time of any road section; the second part is the travel cost from the task location (drop point) of the handling task assigned in the previous cycle to the task location (pick-up point) of the handling task assigned in this cycle. The method for determining the travel cost of the second part can refer to the method for determining the first travel cost or the second communication cost, which will not be repeated here.
[0238] The release cost may be a preset fixed value. Optionally, the release cost may be set to different fixed values based on different task types, which is not specifically limited here.
[0239] In summary, a task matching model can be constructed based on the above-mentioned first task cost and the second task cost. For ease of understanding, this application takes a mixed integer programming model as an example, and obtains the following task matching model based on the first task cost and the second task cost:
[0240]
[0241] in, Indicates that overhead crane i is matched to handling task j, and its value is 1 or 0. It represents the path travel cost when crane i matches handling task j, including the first travel cost when crane i is an idle crane, the second travel cost when crane i is the first crane, and the first part of the third travel cost when crane i is the second crane. Indicates the second part of the third toll when overhead travelling vehicle i is the second overhead travelling vehicle. Indicates the cost of releasing goods when crane i is the second-day crane. It indicates the task abandonment cost when crane i is the first crane. Indicates that overhead crane m is matched with handling task o, and its value is 1 or 0. It represents the pickup time at the pickup point when the overhead crane m is matched with the handling task o, which is also the second task cost.
[0242] Therefore, in summary, the above * It is used to indicate the first passage cost when crane i is an idle crane. *( + + ) is used to represent the first mission cost when crane i is the second car, which includes three parts. The specific meanings of the three parts can be found in the previous paragraph. *( + ) is used to represent the first mission cost when crane i is the first crane, which specifically includes two parts. The specific meanings of the two parts can be found in the previous paragraph.
[0243] The goal of this application is to solve the above-mentioned task matching model and obtain the matching results of each overhead crane i and each handling task j when the comprehensive task cost is minimized.
[0244] In one of the optional embodiments, the solution of the task matching model, i.e., obtaining the allocation results of each handling task and each overhead crane based on the task matching model, includes: obtaining constraint information, the constraint information includes the quantity constraint information of the overhead crane and the task, and / or the type constraint information of the overhead crane type and the task type; solving the task matching model based on the constraint information to obtain the allocation results of each handling task and each overhead crane. Among them, the quantity constraint information of the overhead crane and the task includes that when the number of handling tasks is greater than the number of overhead cranes, each handling task is allocated to one overhead crane; when the number of handling tasks is less than or equal to the number of overhead cranes, each overhead crane is allocated to one handling task; the type constraint information includes the mapping relationship between the type of handling task and the type of overhead crane.
[0245] In order to solve the task matching model, constraint information is introduced, and the constraint information includes the quantity constraint information of the crane and the task, and / or the type constraint information of the crane type and the task type. The quantity constraint information of the crane and the task can be:
[0246] =1 if j >x, that is, if the number of handling tasks is greater than the number of overhead cranes, =1 means that each handling task is assigned to one overhead crane.
[0247] =1 if j <=x, that is, if the number of handling tasks is less than or equal to the number of overhead cranes, =1 means that each vehicle is assigned to a handling task.
[0248] The type constraint information of the crane type and the task type is the mapping relationship between the type of handling task and the type of the crane, that is, a specific handling task can only be performed by a specific crane. For example, a crane of type A can perform handling tasks of type a and type b. A crane of type B can only perform handling tasks of type b.
[0249] Based on the above constraint information, the task matching model can be solved to obtain the allocation results of each handling task and each overhead crane.
[0250] In one of the optional embodiments, each transport task is obtained based on the initial transport task, including: based on the task priority, obtaining the current transport tasks corresponding to each task priority from the initial transport task step by step; each current transport task corresponding to each task priority performs the following steps until the transport tasks corresponding to each task priority are all assigned or the overhead cranes are all assigned; after the current transport tasks corresponding to the current task priority are assigned, the overhead crane assigned with the task in the current task priority is obtained, and based on the overhead crane assigned with the task in the current task priority and the overhead crane not assigned with the task, each overhead crane of the assignable task corresponding to the next task priority is updated.
[0251] The task priority is the priority of each transport task. For example, type A tasks must be assigned to overhead cranes first, so type A transport tasks have a higher priority than other types of transport tasks.
[0252] Specifically, in conjunction with Figure 15, Figure 15 is a flow chart of a method for allocating transport tasks in another embodiment. First, each initial transport task and each overhead crane, as well as a target map, are acquired. Then, based on the task priority, the handling tasks corresponding to the current priority are determined from each initial handling task, and a task matching model and constraint information are constructed based on each handling task and each overhead crane. The task matching model is solved based on the constraint information to obtain the allocation results of each handling task and each overhead crane; then, based on the task priority, each handling task of the next priority is obtained from each initial handling task, and the next priority is used as the new current priority, and each handling task of the next priority is used as the new current handling task of the new current priority, and each overhead crane is updated based on the allocated overhead crane and each overhead crane, and the updated overhead crane is used as the overhead crane corresponding to the new current priority, that is, the allocated overhead crane is removed from each overhead crane, thereby reducing the processing volume, and subsequently, the task matching model and constraint information are constructed based on each new handling task corresponding to the current priority and each new overhead crane, and the task matching model is solved based on the constraint information to obtain the allocation results of each handling task and each overhead crane, until the handling tasks of each task priority or each overhead crane have been allocated.
[0253] In one embodiment, the update period of the target map is greater than or equal to the allocation period of each transport task and each overhead crane.
[0254] For ease of understanding, this application mainly includes the update cycle of the target map, the allocation cycle of each handling task and each overhead crane, and the path planning cycle of the overhead crane. In order to ensure accuracy, that is, when the accuracy is the highest, the update cycle of the target map, the allocation cycle of each handling task and each overhead crane, and the path planning cycle of the overhead crane are equal. In order to improve efficiency and ensure a certain degree of accuracy, the update cycle of the target map is greater than the allocation cycle of each handling task and each overhead crane, and the update cycle of the target map is greater than the path planning cycle of the overhead crane. In addition, optionally, the path planning cycle of the overhead crane can be greater than the allocation cycle of each handling task and each overhead crane, so as to ensure that the path of the overhead crane is planned in real time.
[0255] In one of the optional embodiments, obtaining a target map includes: obtaining a target map generated based on a planned path of an existing overhead crane every first period; obtaining information on each transport task and each overhead crane includes: obtaining information on each transport task and each overhead crane every second period, wherein the first period is greater than or equal to the second period.
[0256] In this application, the update cycle of the target map is the first cycle and the allocation cycle corresponding to the allocation step is the second cycle. The first cycle and the second cycle can be the same, or the first cycle is greater than the second cycle, that is, it is considered that the environment of the track is fixed within a certain time range. Optionally, the first cycle is 2 minutes and the second cycle is 1 second. In other embodiments, other values can also be used. In addition, the allocation step can also be executed based on a new task trigger.
[0257] By setting the first cycle of the target map update and the second cycle of the allocation step, the frequency of the target map update can be reduced, thereby reducing the amount of calculation, and improving the calculation efficiency while ensuring the matching accuracy of the matching step.
[0258] In one of the optional embodiments, the method further includes: performing path planning based on the allocation results to obtain the planned path of the overhead crane for each assigned task; updating the target map based on the planned path of the overhead crane for each assigned task, and continuing to execute the step of obtaining the target map until all handling tasks are completed.
[0259] Among them, in this application, after obtaining the allocation results of each handling task and each overhead crane, based on the allocation results, the overhead cranes with each assigned task are path planned, and then the target map is updated based on each planned path obtained by the path planning. Optionally, the update of the target map is carried out according to the above-mentioned first cycle, and the path planning can be carried out according to the second cycle to ensure the real-time nature of the path planning. The process of path planning and the process of updating the target map can be found above and will not be repeated here.
[0260] It should be understood that, although the steps in the flowcharts involved in the above embodiments are displayed in sequence according to the indication of the arrows, these steps are not necessarily executed in sequence according to the order indicated by the arrows. Unless there is a clear explanation in this article, the execution of these steps is not strictly limited in order, and these steps can be executed in other orders. Moreover, at least a part of the steps in the flowcharts involved in the above embodiments may include multiple steps or multiple stages, and these steps or stages are not necessarily executed at the same time, but can be executed at different times, and the execution order of these steps or stages is not necessarily carried out in sequence, but can be executed in turn or alternately with other steps or at least a part of the steps or stages in other steps.
[0261] Based on the same inventive concept, the embodiment of the present application also provides a semiconductor transport path-based map updating device for implementing the semiconductor transport path-based map updating method mentioned above. The implementation scheme for solving the problem provided by the device is similar to the implementation scheme recorded in the above method, so the specific limitations in one or more semiconductor transport path-based map updating device embodiments provided below can refer to the above limitations on the semiconductor transport path-based map updating method, which will not be repeated here.
[0262] In an exemplary embodiment, as shown in FIG. 16 , a map updating device based on a semiconductor transport path is provided, comprising: a planned path acquisition module 1601, a travel sequence acquisition module 1602, an information acquisition module 1603, a delayed travel time acquisition module 1604 and a map updating module 1605, wherein:
[0263] The planned path acquisition module 1601 is used to acquire each first position of each overhead travelling vehicle at a first moment in the target map;
[0264] The passage sequence acquisition module 1602 is used to determine the planned path of each overhead crane in the target map based on the first position of each overhead crane, obtain the overlapping road sections that each overhead crane will pass through according to each planned path, and determine the passage sequence of each overhead crane when arriving at the overlapping road sections;
[0265] The information acquisition module 1603 is used to acquire the speed information and vehicle control information of each overhead crane;
[0266] The delayed travel time acquisition module 1604 is used to process data information based on the travel sequence, the first positions of the overhead cranes, the speed information and the vehicle control information to obtain the travel time of each overhead crane;
[0267] The map updating module 1605 is used to compensate and update the estimated travel time of each road section in the target map based on the travel time of each overhead travelling vehicle.
[0268] In one of the optional embodiments, the above-mentioned planned path acquisition module 1601 is specifically used to obtain the handling tasks corresponding to each overhead crane based on the allocation results of each handling task and each overhead crane, and obtain the starting point and end point of each task corresponding to each handling task; obtain the target map, the target map includes the estimated travel time of each road section; perform path planning based on the current position of each overhead crane, the starting point and end point of each task and the estimated travel time of each road section, and obtain the planned path of each overhead crane.
[0269] In one of the optional embodiments, the above-mentioned planned path acquisition module 1601 is specifically used to construct a path planning model based on the current position of each overhead crane, the starting point and end point of each task, and the estimated travel time of each road section; based on the total task execution time of each handling task, the path planning model is solved to obtain the planned path of each overhead crane.
[0270] In one of the optional embodiments, the above-mentioned planned path acquisition module 1601 is specifically used to obtain conflict constraint information, and the conflict constraint information includes at least one of point conflict constraint information and line conflict constraint information; the point conflict constraint information is that any two overhead cranes are in different positions at any time; the line conflict constraint information is that any two overhead cranes cannot travel towards each other on the same road section at any time; the path planning model is solved based on the total task execution time of each handling task and the conflict constraint information to obtain the planned path of each overhead crane.
[0271] In one of the optional embodiments, the travel time of the overhead crane includes at least one of the second travel time of each overhead crane through each road section in the target map, the delayed travel time of each overhead crane through each road section in the target map, and the relative travel time of each overhead crane through each road section in the target map; the delayed travel time is obtained based on the first travel time of each overhead crane through each road section in the target map at full speed; or the relative travel time is the difference between the second travel times of each overhead crane calculated in two adjacent cycles.
[0272] In one of the optional embodiments, the travel time of the overhead crane includes a delayed travel time; the above-mentioned delayed travel time acquisition module 1604 is specifically used to process the travel order, the first positions of each overhead crane, the speed information and the vehicle control information based on the vehicle travel model to obtain the speed of the non-full-speed movement of each overhead crane and the displacement planning information of the non-full-speed movement; based on the displacement planning information of the non-full-speed movement of each overhead crane and the target speed of each overhead crane, obtain the first travel time of each overhead crane; based on the speed of the non-full-speed movement of each overhead crane and the displacement planning information of the non-full-speed movement of each overhead crane, obtain the second travel time of each overhead crane; and use the difference between each second travel time and the corresponding first travel time as the delayed travel time of each overhead crane.
[0273] In one of the optional embodiments, the delayed travel time acquisition module 1604 is specifically used to determine the current overhead crane to be passing through the overlapping section based on the passage sequence, and determine the current initial time and the current end time based on the first positions corresponding to the current overhead crane, the current end time being the time when the current overhead crane arrives at the overlapping section, when the current overhead crane is the first overhead crane to continuously pass through the overlapping section, the current initial time is the time when the distance between the current overhead crane and the overlapping section is the target distance, and when the current overhead crane is not the first overhead crane to continuously pass through the overlapping section, the current initial time is the previous current end time; determine the current front vehicle and the current rear vehicle that continuously pass through the overlapping section based on the passage sequence; determine the distance between the current front vehicle and the current rear vehicle based on the first positions of the overhead cranes and the vehicle control information; determine the distance between the current front vehicle and the current rear vehicle based on the speed information of the current front vehicle information and the distance between the current front vehicle and the current rear vehicle, obtain the speed of the current rear vehicle in the current time period and the displacement planning information of the non-full-speed movement, wherein the current time period is from the current initial moment to the current end moment; take the current rear vehicle as the new current front vehicle, and determine the current rear vehicle corresponding to the new current front vehicle based on the traffic order, and continue to execute the step of determining the distance between the current front vehicle and the current rear vehicle based on the first positions of each overhead crane and the vehicle control information, until all overhead cranes are traversed according to the traffic order; when the number of overhead cranes that have not passed the overlapping section is greater than a preset value, determine the next overhead crane to pass the overlapping section as the current overhead crane based on the traffic order, and continue to determine the current initial moment and the current end moment based on the first positions corresponding to the current overhead crane, until the number of overhead cranes that have not passed the overlapping section is equal to the preset value.
[0274] In one of the optional embodiments, the map update module 1605 is specifically used to determine the current road section where the current following vehicle is located at the current initial moment; determine the target overhead crane in the current road section at the current initial moment based on the passage order; and update the estimated passage time of the current road section in the current time period based on the delayed passage time of the target overhead crane.
[0275] In one of the optional embodiments, the above-mentioned delayed passage time acquisition module 1604 is specifically used to obtain the current reference displacement of the current rear vehicle based on the speed information of the current rear vehicle, the current end time and the current initial time; when the current reference displacement is greater than the distance between the front vehicle and the rear vehicle, continue to execute the steps of obtaining the speed of the non-full-speed movement of the rear vehicle and the displacement planning information of the non-full-speed movement based on the speed information of the front vehicle and the distance between the front vehicle and the rear vehicle; when the reference displacement is less than or equal to the distance between the front vehicle and the rear vehicle, keep the estimated passage time of the current road section in the current time period unchanged.
[0276] In one of the optional embodiments, the delayed travel time acquisition module 1604 is specifically used to determine the speed constraint information of the current rear vehicle based on the speed information of the current front vehicle, the speed constraint information including that the final speed of the current rear vehicle is less than or equal to the final speed of the current front vehicle; determine the displacement constraint information of the current rear vehicle based on the distance between the current front vehicle and the current rear vehicle, the displacement constraint information is that the displacement of the current rear vehicle is less than or equal to the distance between the current front vehicle and the current rear vehicle; perform speed and displacement planning based on the speed constraint information and the displacement constraint information to obtain the speed of the current rear vehicle in non-full speed motion in the current time period and the displacement planning information of the non-full speed motion.
[0277] In one of the optional embodiments, the speed constraint information also includes a speed change of the current rear vehicle with the speed of the current front vehicle.
[0278] In one of the optional embodiments, the delayed travel time acquisition module 1604 is specifically used to obtain a branch road traffic model as a vehicle traffic model for each overhead crane corresponding to the branch road area when there is an overlapping section after the overhead crane passes through different sections in the branch road area; and obtain a following vehicle traffic model as a vehicle traffic model for other overhead cranes.
[0279] In one of the optional embodiments, the vehicle traffic model is a fork traffic model; the above-mentioned delayed passage time acquisition module 1604 is specifically used to determine the first distance between the current rear vehicle and the fork area at the current initial moment based on the first positions of each overhead crane when the current front vehicle and the current rear vehicle are located in different sections of the fork area; and use the first distance as the distance between the current front vehicle and the current rear vehicle.
[0280] In one of the optional embodiments, the vehicle traffic model is a following vehicle traffic model; the above-mentioned delayed passage time acquisition module 1604 is specifically used to determine the second distance between the current front vehicle and the current rear vehicle at the current initial moment based on the first positions of each overhead crane when each overhead crane travels sequentially on the same road section; obtain the displacement planning information of the non-full-speed movement of the current front vehicle, and determine the third distance between the current front vehicle and the current rear vehicle at the current end moment based on the second distance and the displacement planning information of the non-full-speed movement of the current front vehicle, and use the third distance as the distance between the current front vehicle and the current rear vehicle.
[0281] In one of the optional embodiments, the delayed travel time acquisition module 1604 is specifically used to obtain the overhead cranes corresponding to the curved road section in the fork area when there is an overlapping section after the overhead cranes pass through different sections in the fork area; when the overhead cranes corresponding to the curved road section pass through the curved road section, project the overhead cranes corresponding to the curved road section to the straight road section in the fork area; obtain the following vehicle traffic model as the vehicle traffic model of each overhead crane; when the overhead cranes travel sequentially on the same section, obtain the following vehicle traffic model as the vehicle traffic model of each overhead crane.
[0282] In one of the optional embodiments, the vehicle traffic model is a following vehicle traffic model; the above-mentioned delayed passage time acquisition module 1604 is specifically used to obtain the target position of the current front vehicle or the current rear vehicle located on the curved road section projected to the straight road section as the first position of the current front vehicle or the current rear vehicle at the current initial moment when there is an overlapping section after the overhead crane passes through different sections in the fork area, determine the second distance between the current front vehicle and the current rear vehicle at the current initial moment based on the first positions of each overhead crane, determine the third distance between the current front vehicle and the current rear vehicle at the current end moment based on the second distance and the displacement planning information of the non-full-speed motion of the current front vehicle, and use the third distance as the distance between the current front vehicle and the current rear vehicle.
[0283] In one of the optional embodiments, the above-mentioned device also includes: a matching module, which is used to obtain an updated target map; obtain information of each transport task and each overhead crane; and obtain allocation results of each transport task and each overhead crane based on the updated target map.
[0284] Combination Figure 18 to Figure 19 In one embodiment, the track system includes a straight track section, a turning section (a curved track section downstream of the straight track section), an overlapping section, a forked section, etc. A plurality of different types of storage devices are arranged below the straight track section on the track system. The overhead crane serves as an independent operating mechanism, with a wheel portion running above the track and a main body carrying goods located below the track. The overhead crane runs on the track system and performs picking and releasing tasks relative to each storage device.
[0285] In some optional embodiments, the target map includes the rail system and the estimated travel time of any section on the rail system.
[0286] Each module in the map updating device based on semiconductor transport path can be implemented in whole or in part by software, hardware or a combination thereof. Each module can be embedded in or independent of a processor in a computer device in the form of hardware, or can be stored in a memory in a computer device in the form of software, so that the processor can call and execute the operations corresponding to each module.
[0287] In an exemplary embodiment, a computer device is provided, which may be a terminal, and its internal structure diagram may be shown in FIG17. The computer device includes a processor, a memory, an input / output interface, a communication interface, a display unit, and an input device. The processor, the memory, and the input / output interface are connected via a system bus, and the communication interface, the display unit, and the input device are connected to the system bus via the input / output interface. The processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The input / output interface of the computer device is used to exchange information between the processor and an external device. The communication interface of the computer device is used to communicate with an external terminal in a wired or wireless manner, and the wireless manner may be implemented through WIFI, a mobile cellular network, near field communication (NFC) or other technologies. When the computer program is executed by the processor, a map updating method based on a semiconductor handling path is implemented. The display unit of the computer device is used to form a visually visible picture, which may be a display screen, a projection device, or a virtual reality imaging device. The display screen can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer device can be a touch layer covering the display screen, or a button, trackball or touchpad set on the computer device shell, or an external keyboard, touchpad or mouse.
[0288] Those skilled in the art will understand that the structure shown in FIG. 17 is merely a block diagram of a partial structure related to the scheme of the present application, and does not constitute a limitation on the computer device to which the scheme of the present application is applied. The specific computer device may include more or fewer components than shown in the figure, or combine certain components, or have a different arrangement of components.
[0289] In one embodiment, a computer device is further provided, including a memory and a processor, wherein a computer program is stored in the memory, and the processor implements the steps in the above method embodiments when executing the computer program.
[0290] In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the steps in the above-mentioned method embodiments are implemented.
[0291] In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the steps in the above-mentioned method embodiments are implemented.
[0292] A person of ordinary skill in the art can understand that all or part of the processes in the above-mentioned embodiment method can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to the memory, database or other medium used in the embodiments provided in the present application can include at least one of non-volatile memory and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. As an illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM). The database involved in each embodiment provided in this application may include at least one of a relational database and a non-relational database. Non-relational databases may include distributed databases based on blockchains, etc., but are not limited to this. The processor involved in each embodiment provided in this application may be a general-purpose processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic device, a data processing logic device based on quantum computing, an artificial intelligence (AI) processor, etc., but are not limited to this.
[0293] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this application.
[0294] The above-described embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the present application. It should be pointed out that, for a person of ordinary skill in the art, several variations and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the attached claims.
Claims
1. A map updating method based on semiconductor transport path, It is characterized in that The method comprises: Obtaining each first position of each overhead travelling vehicle at a first moment in the target map; Determining the planned paths of the overhead cranes in the target map based on the first positions of the overhead cranes, acquiring the overlapping sections that the overhead cranes will pass through according to the planned paths, and determining the passage order of the overhead cranes to arrive at the overlapping sections; Acquiring speed information and vehicle control information of each of the overhead cranes; Performing data information processing based on the passage sequence, the first positions of the overhead cranes, speed information, and vehicle control information to obtain the passage time of the overhead cranes; The estimated travel time of each road section in the target map is compensated and updated based on the travel time of each overhead crane.
2. The method according to claim 1, It is characterized in that The determining the planned path of each overhead crane in the target map based on the first position of each overhead crane comprises: Based on the allocation results of each handling task and each overhead crane, the handling task corresponding to each overhead crane is obtained, and the starting point and end point of each task corresponding to each handling task are obtained; Obtaining a target map, wherein the target map includes an estimated travel time for each road section; Path planning is performed based on the current position of each of the overhead cranes, the starting point and the end point of each of the tasks, and the estimated travel time of each of the road sections to obtain a planned path for each of the overhead cranes.
3. The method according to claim 2, It is characterized in that The path planning is performed based on the current position of each of the overhead cranes, the starting point and the end point of each of the tasks, and the estimated travel time of each road section to obtain the planned path of each of the overhead cranes, including: Constructing a path planning model based on the current position of each overhead crane, the starting point and the end point of each task, and the estimated travel time of each road section; Based on the total task execution time of each of the transport tasks, the path planning model is solved to obtain the planned path of each of the overhead cranes.
4. The method according to claim 3, It is characterized in that The method further comprises: Obtaining conflict constraint information, wherein the conflict constraint information includes at least one of point conflict constraint information and line conflict constraint information; the point conflict constraint information is that any two overhead cranes are in different positions at any time; the line conflict constraint information is that any two overhead cranes cannot travel in opposite directions on the same road section at any time; The path planning model is solved based on the total task execution time of each of the transport tasks to obtain the planned path of each of the overhead cranes, including: The path planning model is solved based on the total task execution time of each of the transport tasks and the conflict constraint information to obtain a planned path for each of the overhead cranes.
5. The method according to claim 1, It is characterized in that The travel time of the overhead crane includes a delayed travel time; the data information processing based on the travel sequence, the first positions of the overhead cranes, the speed information and the vehicle control information to obtain the travel time of each overhead crane includes: Based on the vehicle traffic model, data information processing is performed on the traffic sequence, the first positions of the overhead cranes, speed information, and vehicle control information to obtain the speed of the non-full-speed movement of the overhead cranes and the displacement planning information of the non-full-speed movement; Based on the target speed of each of the overhead cranes and the displacement planning information of the non-full-speed motion of each of the overhead cranes, a first travel time of each of the overhead cranes is obtained; Based on the speed of the non-full-speed movement of each of the overhead cranes and the displacement planning information of the non-full-speed movement, a second travel time of each of the overhead cranes is obtained; The difference between each of the second passing times and the corresponding first passing time is used as the delayed passing time of each of the overhead cranes.
6. The method according to claim 1, It is characterized in that The travel time of the overhead crane includes a relative travel time; the data information processing based on the travel sequence, the first positions of the overhead cranes, the speed information and the vehicle control information to obtain the travel time of each overhead crane includes: Based on the vehicle traffic model, data information processing is performed on the traffic sequence, the first positions of the overhead cranes, speed information, and vehicle control information to obtain the speed of the non-full-speed movement of the overhead cranes and the displacement planning information of the non-full-speed movement; Based on the speed of the non-full-speed movement of each of the overhead cranes and the displacement planning information of the non-full-speed movement, a second travel time of each of the overhead cranes is obtained; The relative transit time is the difference between the second transit times calculated by two adjacent vehicle traffic model processing cycles of each of the overhead cranes within a map update cycle, wherein the map update cycle is greater than the vehicle traffic model processing cycle; or, the relative transit time is the difference between the second transit times calculated based on two adjacent map update cycles of each of the overhead cranes.
7. The method according to claim 5, It is characterized in that The process of processing the passage sequence, the first positions of the overhead cranes, speed information and vehicle control information based on the vehicle passage model to obtain the speed of the non-full-speed movement of the overhead cranes and the displacement planning information of the non-full-speed movement includes: Determining a current overhead travelling vehicle to pass through the overlapping road section based on the passage sequence, and determining a current initial time and a current end time based on each of the first positions corresponding to the current overhead travelling vehicle; The current end time is the time when the current overhead travelling vehicle arrives at the overlapping section; When the current overhead travelling crane is the first overhead travelling crane that continuously passes through the overlapping road section, the current initial time is the time when the distance between the current overhead travelling crane and the overlapping road section is the target distance; When the current overhead travelling vehicle is not the first overhead travelling vehicle that continuously passes through the overlapping road section, the current initial time is the last current end time; Determine the current front vehicle and the current rear vehicle that continuously pass through the overlapping road section based on the passing order; Determining a distance between the current leading vehicle and the current trailing vehicle based on the first positions of the overhead cranes and the vehicle control information; Based on the speed information of the current leading vehicle and the distance between the current leading vehicle and the current trailing vehicle, obtaining the speed of the current trailing vehicle in a non-full-speed movement and the displacement planning information of the non-full-speed movement in a current time period, wherein the current time period is from the current initial moment to the current end moment; The current rear vehicle is taken as a new current front vehicle, and a current rear vehicle corresponding to the new current front vehicle is determined based on the passage order, and the step of determining the distance between the current front vehicle and the current rear vehicle based on each of the first positions of each of the overhead cranes and the vehicle control information is continued until all the overhead cranes are traversed according to the passage order; When the number of overhead cranes that have not passed the overlapping section is greater than a preset value, the next overhead crane to pass the overlapping section is determined as the current overhead crane based on the passage order, and the current initial time and the current end time are continuously determined based on the first positions corresponding to the current overhead crane until the number of overhead cranes that have not passed the overlapping section is equal to the preset value.
8. The method according to claim 7, It is characterized in that The method further comprises: Determine the current road section where the current following vehicle is located at the current initial moment; The compensating and updating the estimated travel time of each road section in the target map based on the travel time of each overhead crane includes: Determine a target overhead traveling vehicle in the current section at the current initial moment based on the passage sequence; Based on the delayed travel time of the target overhead travelling vehicle, the estimated travel time of the current road section in the current time period is updated.
9. The method according to claim 8, It is characterized in that Before obtaining the speed of the current rear vehicle in the current time period and the displacement planning information of the non-full-speed movement based on the speed information of the current front vehicle and the distance between the current front vehicle and the current rear vehicle, the method further includes: Obtaining a current reference displacement of the current following vehicle based on the speed information of the current following vehicle, the current end time and the current initial time; In the case where the current reference displacement is greater than the distance between the current front vehicle and the current rear vehicle, the step of obtaining the speed of the current rear vehicle in the current time period and the displacement planning information of the non-full-speed movement based on the speed information of the current front vehicle and the distance between the current front vehicle and the current rear vehicle is continued; When the current reference displacement is less than or equal to the distance between the current leading vehicle and the current trailing vehicle, the estimated travel time of the current road section in the current time period is kept unchanged.
10. The method according to claim 7, It is characterized in that The obtaining, based on the speed information of the current leading vehicle and the distance between the current leading vehicle and the current trailing vehicle, the speed of the current trailing vehicle at a non-full speed in the current time period and the displacement planning information of the non-full speed movement includes: Determining speed constraint information of the current rear vehicle based on speed information of the current front vehicle, wherein the speed constraint information includes that the final speed of the current rear vehicle is less than or equal to the final speed of the current front vehicle; Determine, based on the distance between the current front vehicle and the current rear vehicle, displacement constraint information of the current rear vehicle, wherein the displacement constraint information is that the displacement of the current rear vehicle is less than or equal to the distance between the current front vehicle and the current rear vehicle; Speed and displacement planning is performed based on the speed constraint information and the displacement constraint information to obtain the speed of the current following vehicle in the current time period and the displacement planning information of the non-full-speed movement.
11. The method according to claim 10, It is characterized in that The speed constraint information also includes a speed variation of the current following vehicle according to a speed variation of the current leading vehicle.
12. The method according to claim 7, It is characterized in that Before the passage sequence, the first positions of the overhead cranes, the speed information and the vehicle control information are processed based on the vehicle passage model to obtain the speed of the non-full-speed movement of the overhead cranes and the displacement planning information of the non-full-speed movement, the method further includes: When there is an overlapped road section after the overhead crane passes through different road sections in the fork area, a fork traffic model is obtained as the vehicle traffic model of each overhead crane corresponding to the fork area; and a following vehicle traffic model is obtained as the vehicle traffic model of other overhead cranes.
13. The method according to claim 12, It is characterized in that The vehicle traffic model is a fork traffic model; the determining the distance between the current front vehicle and the current rear vehicle based on the first positions of the overhead cranes and the vehicle control information includes: In the case where the current front vehicle and the current rear vehicle are located at different sections of the fork area, the first distance between the current rear vehicle and the fork area at the current initial moment is determined based on the first positions of the overhead cranes; and the first distance is used as the distance between the current front vehicle and the current rear vehicle.
14. The method according to claim 7, It is characterized in that The vehicle traffic model is a vehicle following traffic model; the determining the distance between the current leading vehicle and the current trailing vehicle based on the first positions of the overhead cranes and the vehicle control information includes: In the case where the overhead cranes are traveling sequentially on the same road section, a second distance between the current front vehicle and the current rear vehicle at the current initial moment is determined based on the first positions of the overhead cranes; displacement planning information of non-full-speed movement of the current front vehicle is obtained, and a third distance between the current front vehicle and the current rear vehicle at the current end moment is determined based on the second distance and the displacement planning information of non-full-speed movement of the current front vehicle, and the third distance is used as the distance between the current front vehicle and the current rear vehicle.
15. The method according to claim 14, It is characterized in that Before the passage sequence, the first positions of the overhead cranes, the speed information and the vehicle control information are processed based on the vehicle passage model to obtain the speed of the non-full-speed movement of the overhead cranes and the displacement planning information of the non-full-speed movement, the method further includes: In the case where there is an overlapped road section after the overhead cranes pass through different road sections in the fork area, the overhead cranes corresponding to the curved road section in the fork area are obtained; in the case where the overhead cranes corresponding to the curved road section pass through the curved road section, the overhead cranes corresponding to the curved road section are projected to the straight road section in the fork area; and a vehicle following traffic model is obtained as a vehicle traffic model for each overhead crane; When the overhead cranes travel sequentially on the same road section, a vehicle following traffic model is obtained as a vehicle traffic model of each overhead crane.
16. The method according to claim 15, It is characterized in that The vehicle traffic model is a vehicle following traffic model; the determining the distance between the current leading vehicle and the current trailing vehicle based on the first positions of the overhead cranes and the vehicle control information includes: In the case where there is an overlapping section after the overhead crane passes through different sections in the fork area, the target position of the current front vehicle or the current rear vehicle located on the curved road section projected onto the straight road section is obtained as the first position of the current front vehicle or the current rear vehicle at the current initial moment, and the second distance between the current front vehicle and the current rear vehicle at the current initial moment is determined based on the first positions of the overhead cranes to obtain the distance between the current front vehicle and the current rear vehicle, and the third distance between the current front vehicle and the current rear vehicle at the current end moment is determined based on the second distance and the displacement planning information of the non-full-speed motion of the current front vehicle, and the third distance is used as the distance between the current front vehicle and the current rear vehicle.
17. The method according to claim 1, It is characterized in that The method further comprises: Get the updated target map; Obtain information on each handling task and each overhead crane; Based on the updated target map, the allocation results of each of the transporting tasks and each of the overhead cranes are obtained.
18. A map updating device based on semiconductor transport path, It is characterized in that The device comprises: A planning path acquisition module, used for acquiring each first position of each overhead travelling vehicle at a first moment in a target map; A passage sequence acquisition module, used for determining the planned path of each overhead crane in the target map based on the first position of each overhead crane, acquiring the overlapping road sections that each overhead crane will pass through according to each planned path, and determining the passage sequence of each overhead crane when arriving at the overlapping road sections; An information acquisition module, used to acquire speed information and vehicle control information of each overhead crane; A delayed passage time acquisition module, configured to process data information based on the passage sequence, the first positions of the overhead cranes, speed information, and vehicle control information to obtain the passage time of each overhead crane; A map updating module is used to compensate and update the estimated travel time of each road section in the target map based on the travel time of each overhead crane.
19. A computer device comprising a memory and a processor, wherein the memory stores a computer program. It is characterized in that When the processor executes the computer program, the steps of the method according to any one of claims 1 to 17 are implemented.
Citation Information
Patent Citations
Vehicle control method, electronic equipment and storage medium
CN117360537A
Route planning method and device for vehicle lane-changing driving and computer equipment
CN117760453A
Crown block double-layer planning intelligent scheduling optimization method, device, equipment and medium
CN117952389A
Path planning method and system based on multiple carriers, electronic equipment and storage medium
CN118258420A
Oxygen generator
KR1020200144343A
Cited By
Crown block roaming control method and device, storage medium and electronic equipment
CN120143718A
Overhead crane roaming control method, device, storage medium and electronic device
CN120143718B
