Multi-car dispatching method, electronic device and storage medium based on ROPN
By setting shortcuts on a circular single track and using the ROPN model to generate scheduling instructions, the problem of low scheduling efficiency of trolleys in semiconductor manufacturing was solved, and more efficient cargo transportation was achieved.
Patent Information
- Application Number
- CN202411047730.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-01
- Publication Date
- 2024-11-05
- Estimated Expiration
- 2044-08-01
AI Technical Summary
In existing technologies, the efficiency of cargo transportation in semiconductor manufacturing is low, especially in ring RGV systems, where the efficiency of OHT scheduling is limited by path planning and conflict waiting issues.
A multi-car scheduling method based on ROPN is adopted, which sets shortcuts on a circular single track and generates scheduling instructions through the ROPN model. This allows cars to take shortcuts when encountering conflicts to avoid waiting and improve transportation efficiency.
By setting shortcuts on a circular single track and using the ROPN model, the waiting time of the vehicles was reduced, the overall transportation efficiency was improved, and the efficiency of cargo transportation in the semiconductor manufacturing process was enhanced.
Smart Images

Figure CN118586674B_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of semiconductor manufacturing technology, and in particular to a multi-vehicle scheduling method based on ROPN, an electronic device and a readable storage medium. Background Art
[0002] In the field of semiconductor manufacturing, rail guide vehicles (RGV) and overhead hoist vehicles (OHT) are widely used in automated warehousing and logistics systems. They are the link between storage shelves and handling systems, and are the key link in warehousing and warehousing, which has a great impact on the overall operation efficiency of the warehouse. At present, the ring RGV system adopts the snake tail optimal principle. For example, when goods 1 (near) and goods 2 (far) are in place and car 1 (front) and car 2 (back) arrive at the same time, car 1 can directly pick up goods 2, and car 2 picks up goods 1. This method alone is not suitable for OHT scheduling. Most OHT scheduling uses the path planning method, using the Dijkstra algorithm to find the shortest path and drive along this path. When encountering a conflict, it is necessary to wait for the front car to leave, which reduces the transportation efficiency of the goods.
[0003] The above contents are only used to assist in understanding the technical solution of the present application and do not constitute an admission that the above contents are prior art. Summary of the invention
[0004] The main purpose of this application is to provide a multi-cart scheduling method, electronic equipment and storage medium based on ROPN, aiming to solve the technical problem of reduced cargo transportation efficiency at this stage.
[0005] To achieve the above purpose, the present application proposes a multi-car scheduling method based on ROPN, wherein each of the cars is arranged on a circular one-way track, a shortcut is arranged on the circular one-way track, and the shortcut is used to connect any two non-adjacent nodes on the one-way track, and the circular one-way track is configured with a standard maximum circular path and a POPN model generated based on the circular one-way track. The multi-car scheduling method based on ROPN includes the following steps:
[0006] Sequentially acquiring a mobile trolley as a target trolley from a preset equipment scheduling sequence of the circular single-row track, wherein the trolley recorded in the preset equipment scheduling sequence is in a moving state;
[0007] Determine whether the first transition in the transition sequence of the target vehicle satisfies the trigger condition, wherein the transition sequence is generated based on the moving path of the target vehicle in the ROPN model, and the moving path is the path of the target vehicle when performing the transport task;
[0008] If the trigger condition is met, the scheduling instruction for executing the first transition is added to the preset scheduling instruction sequence, and the process returns to the step of sequentially acquiring a mobile vehicle as a target vehicle from the preset equipment scheduling sequence of the circular single-row track;
[0009] If the trigger condition is not met, the target vehicle is used as the vehicle to be deployed, and it is determined whether the vehicle to be deployed meets the preset shortcut conditions;
[0010] If the preset shortcut conditions are met, the scheduling instruction for the target vehicle to take the shortcut is added to the preset scheduling instruction sequence, and the process returns to the step of sequentially acquiring a mobile vehicle as the target vehicle from the preset equipment scheduling sequence of the circular single-row track;
[0011] After traversing the mobile carts in the preset equipment scheduling sequence, each of the carts in the circular single-row track is scheduled based on the preset scheduling instruction sequence.
[0012] In addition, to achieve the above-mentioned purpose, the present application also provides an electronic device, which includes: a memory, a processor, and a ROPN-based multi-car scheduling program stored in the memory and executable on the processor, and the ROPN-based multi-car scheduling program, when executed by the processor, implements the steps of the ROPN-based multi-car scheduling method as described above.
[0013] In addition, to achieve the above-mentioned purpose, the present application also provides a readable storage medium, on which a ROPN-based multi-car scheduling program is stored. When the ROPN-based multi-car scheduling program is executed by a processor, the steps of the ROPN-based multi-car scheduling method as described above are implemented.
[0014] The embodiments of the present application propose a multi-car scheduling method, electronic device and storage medium based on ROPN. In the embodiments, a mobile car is sequentially obtained as a target car from the preset equipment scheduling sequence of the circular single-row track, wherein the car recorded in the preset equipment scheduling sequence is in a moving state; it is determined whether the first transition in the transition sequence of the target car meets the trigger condition, wherein the transition sequence is generated based on the moving path of the target car in the ROPN model, and the moving path is the path of the target car when performing a handling task; if the trigger condition is met, the scheduling instruction for executing the first transition is added to the preset scheduling instruction sequence, and the execution of the preset equipment scheduling sequence from the circular single-row track is returned. The step of obtaining a mobile car as a target car in the equipment scheduling sequence; if the trigger condition is not met, the target car is used as the car to be allocated, and then it is determined whether the car to be allocated has the preset shortcut condition; if it has the preset shortcut condition, the scheduling instruction of the target car to take a shortcut is added to the preset scheduling instruction sequence, and the step of obtaining a mobile car as a target car from the preset equipment scheduling sequence of the circular single-row track in sequence is returned to execute; after traversing the mobile cars in the preset equipment scheduling sequence, each car in the circular single-row track is scheduled based on the preset scheduling instruction sequence. That is, a shortcut will be set on the circular single-row track of the car in the present application. When scheduling the car, if it is found that the target car cannot trigger the transition (that is, the target car conflicts with other cars), it is further determined whether the target car has the preset shortcut condition, and when it has the preset shortcut condition, a corresponding scheduling instruction is generated to control the target car to take a shortcut. Compared with the existing solution where the car waits when there is a conflict, the present application can try to control the car to take a shortcut, reduce the situation where the car waits, and thus increase the overall transportation efficiency. BRIEF DESCRIPTION OF THE DRAWINGS
[0015] Figure 1 A schematic diagram of the device structure of the hardware operating environment involved in the embodiment of the present application;
[0016] Figure 2 This is a flow chart of the first embodiment of the multi-car dispatching method based on ROPN in this application;
[0017] Figure 3 This is a flow chart of the second embodiment of the multi-car dispatching method based on ROPN in this application;
[0018] Figure 4 This is a flow chart of the third embodiment of the multi-car dispatching method based on ROPN in the present application;
[0019] Figure 5This is a flow chart of the fourth embodiment of the multi-car dispatching method based on ROPN in the present application;
[0020] Figure 6 This is a flowchart of the fifth embodiment of the multi-car dispatching method based on ROPN in the present application;
[0021] Figure 7 This is a flowchart of the sixth embodiment of the multi-car scheduling method based on ROPN in this application;
[0022] Figure 8 This is a schematic diagram of the ROPN model in the ROPN-based multi-car scheduling method of this application.
[0023] The realization of the purpose, functional features and advantages of this application will be further explained in conjunction with embodiments and with reference to the accompanying drawings. DETAILED DESCRIPTION
[0024] 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.
[0025] like Figure 1 As shown, Figure 1 It is a schematic diagram of the device structure of the hardware operating environment involved in the embodiment of the present application.
[0026] The device in the embodiment of the present application can be an electronic terminal device such as a server, a smart phone, a PC, a tablet computer, a portable computer, etc.
[0027] like Figure 1 As shown, the device may include: a processor 1001, such as a CPU, a network interface 1004, a user interface 1003, a memory 1005, and a communication bus 1002. Among them, the communication bus 1002 is used to realize the connection and communication between these components. The user interface 1003 may include a display screen (Display), an input unit such as a keyboard (Keyboard), and the optional user interface 1003 may also include a standard wired interface and a wireless interface. The network interface 1004 may optionally include a standard wired interface and a wireless interface (such as a WI-FI interface). The memory 1005 may be a high-speed RAM memory, or a stable memory (non-volatile memory), such as a disk memory. The memory 1005 may also be a storage device independent of the aforementioned processor 1001.
[0028] Optionally, the electronic device may also include a camera, RF (Radio Frequency) circuit, sensor, audio circuit, WiFi module, etc. The terminal may also be equipped with other sensors such as a gyroscope, barometer, hygrometer, thermometer, infrared sensor, etc., which will not be described in detail here. Those skilled in the art will understand that Figure 1 The electronic device structure shown in the figure does not constitute a limitation of the electronic device, and may include more or less components than shown in the figure, or combine certain components, or arrange the components differently.
[0029] like Figure 1 As shown, the memory 1005 as a computer storage medium may include an operating system, a network communication module, a user interface module, and a multi-car scheduling program based on ROPN.
[0030] exist Figure 1 In the device shown, the network interface 1004 is mainly used to connect to the backend server and communicate data with the backend server; the user interface 1003 is mainly used to connect to the client (user end) and communicate data with the client; and the processor 1001 can be used to call the ROPN-based multi-car scheduling program stored in the memory 1005, each of the cars is set on a circular single-row track, and a shortcut is set on the circular single-row track. The shortcut is used to connect any two non-adjacent nodes on the circular single-row track. The circular single-row track is configured with a standard maximum circular path and a POPN model generated based on the circular single-row track. The processor performs the following operations:
[0031] Sequentially acquiring a mobile trolley as a target trolley from a preset equipment scheduling sequence of the circular single-row track, wherein the trolley recorded in the preset equipment scheduling sequence is in a moving state;
[0032] Determine whether the first transition in the transition sequence of the target vehicle satisfies the trigger condition, wherein the transition sequence is generated based on the moving path of the target vehicle in the ROPN model, and the moving path is the path of the target vehicle when performing the transport task;
[0033] If the trigger condition is met, the scheduling instruction for executing the first transition is added to the preset scheduling instruction sequence, and the process returns to the step of sequentially acquiring a mobile vehicle as a target vehicle from the preset equipment scheduling sequence of the circular single-row track;
[0034] If the trigger condition is not met, the target vehicle is used as the vehicle to be deployed, and it is determined whether the vehicle to be deployed meets the preset shortcut conditions;
[0035] If the preset shortcut conditions are met, the scheduling instruction for the target vehicle to take the shortcut is added to the preset scheduling instruction sequence, and the process returns to the step of sequentially acquiring a mobile vehicle as the target vehicle from the preset equipment scheduling sequence of the circular single-row track;
[0036] After traversing the mobile carts in the preset equipment scheduling sequence, each of the carts in the circular single-row track is scheduled based on the preset scheduling instruction sequence.
[0037] Optionally, the processor 1001 may call a multi-car scheduling program based on ROPN stored in the memory 1005, and further perform the following operations:
[0038] After the step of determining whether the vehicle to be deployed meets the preset shortcut conditions, the method includes:
[0039] If the preset shortcut condition is not met, the second first transition in the standard transition sequence of the vehicle to be deployed is determined, and the dispatch instruction for executing the second first transition is added to the preset temporary dispatch instruction sequence, and it is determined whether the second first transition meets the trigger condition, wherein the moving path associated with the standard transition sequence belongs to a partial path in the standard maximum circular path;
[0040] If the second first transition satisfies the trigger condition, the scheduling instructions in the preset temporary scheduling instruction sequence are merged into the preset scheduling instruction sequence, the preset temporary scheduling instruction sequence is cleared, and the step of sequentially acquiring a mobile vehicle as a target vehicle from the preset equipment scheduling sequence of the circular single-row track is returned to be executed;
[0041] If the second first transition does not meet the triggering condition, determining whether the conflicting vehicle that causes the second first transition to be untriggerable is the next moving vehicle of the target vehicle in the preset device scheduling sequence;
[0042] If it is the next moving car, the conflicting car is used as a new target car, and the step of determining whether the first transition in the transition sequence of the target car satisfies the trigger condition is performed based on the new target car;
[0043] If it is not the next moving car, determine whether the conflicting car is in a loading state or an unloading state;
[0044] If it is in the loading state or the unloading state, the preset temporary scheduling instruction sequence is cleared, and the step of sequentially acquiring a mobile trolley as a target trolley from the preset equipment scheduling sequence of the circular single-row track is returned to be executed;
[0045] If it is not in the loading state or the unloading state, the conflicting vehicle is used as a new vehicle to be allocated, and the process returns to the step of determining whether the vehicle to be allocated meets the conditions for taking a shortcut.
[0046] Optionally, the processor 1001 may call a multi-car scheduling program based on ROPN stored in the memory 1005, and further perform the following operations:
[0047] The preset moving direction of each of the trolleys set on the circular single-row track is clockwise or counterclockwise, and the ROPN model is provided with a preset basic maximum circular path. Before the step of sequentially acquiring a mobile trolley as a target trolley from a preset equipment scheduling sequence of the circular single-row track, the method includes:
[0048] Searching for unassigned handling tasks on the work warehouse in the ROPN model, and taking the work warehouse with the unassigned handling tasks as the target work warehouse, wherein the work warehouse corresponds to the loading and unloading node on the circular single-row track;
[0049] Taking the target work library as the starting point, obtaining the cart generation cart sequence on the preset basic maximum circular path in the opposite direction of the preset moving direction;
[0050] The unassigned transport task is assigned to the first idle trolley in the trolley sequence.
[0051] Optionally, the processor 1001 may call a multi-car scheduling program based on ROPN stored in the memory 1005, and further perform the following operations:
[0052] The transport task includes a loading node and an unloading node. After the step of assigning the unassigned transport task to the first idle trolley in the trolley sequence, the method includes:
[0053] Decomposing the transport task into a collection of subtasks, wherein the subtasks in the collection of subtasks include moving the loading node from the current node and the action state is a moving state, loading goods at the loading node and the action state is a loading state, moving from the loading node to the unloading node and the action state is a moving state, and unloading goods at the unloading node and the action state is an unloading state;
[0054] Add the subtask collection to the first car that is in an idle state.
[0055] Optionally, the processor 1001 may call a multi-car scheduling program based on ROPN stored in the memory 1005, and further perform the following operations:
[0056] Before the step of determining whether the first transition in the transition sequence of the target vehicle satisfies a trigger condition, the method includes:
[0057] If the target car does not have the transition sequence, generating the transition sequence based on the first subtask of the current subtask set of the target car;
[0058] If the transition sequence is empty, the first subtask is deleted, and the action state of the target vehicle is changed based on the new first subtask in the subtask collection.
[0059] Optionally, the processor 1001 may call a multi-car scheduling program based on ROPN stored in the memory 1005, and further perform the following operations:
[0060] Before the step of scheduling each of the trolleys in the circular single-row track based on the preset scheduling instruction sequence, the method includes:
[0061] Searching for a loading and unloading trolley in a loading state or an unloading state among the trolleys, wherein the actual state of the loading and unloading trolley is the same as the action state of the first subtask in the subtask sequence of the loading and unloading trolley, wherein the action state includes a loading state and an unloading state;
[0062] An unloading instruction or a loading instruction is generated based on the first subtask, and the unloading instruction or the loading instruction is added to the head end of the preset device scheduling sequence, and the first subtask is deleted.
[0063] Optionally, the processor 1001 may call a multi-car scheduling program based on ROPN stored in the memory 1005, and further perform the following operations:
[0064] The step of judging whether the vehicle to be deployed meets the preset shortcut conditions includes:
[0065] Determine whether the warehouse where the target vehicle is located is a forked warehouse, wherein the forked warehouse is provided with the shortcut;
[0066] If it is not the forked warehouse, it will be determined that the vehicle to be deployed does not have the conditions to take a shortcut;
[0067] If it is the forked warehouse, determine whether the target vehicle can trigger the shortcut transition of the shortcut, determine whether there is a moving vehicle in the shortest path between the starting node and the destination node of the shortcut on the circular one-way track, wherein the shortest path does not take a shortcut, and determine whether the destination node is in the moving path of the vehicle to be deployed;
[0068] If the target vehicle can trigger the shortcut transition of the shortcut, and there is no vehicle in a moving state in the shortest path between the shortcut start node and the destination node on the circular one-way track, and the destination node is in the moving path of the vehicle to be deployed, then it is determined that the vehicle to be deployed meets the conditions for taking a shortcut;
[0069] If the target vehicle cannot trigger the shortcut change of the shortcut, or there is a moving vehicle in the shortest path between the shortcut starting node and the destination node on the circular one-way track, or the destination node is not in the moving path of the vehicle to be deployed, it is determined that the vehicle to be deployed does not meet the conditions for taking a shortcut.
[0070] Optionally, the processor 1001 may call a multi-car scheduling program based on ROPN stored in the memory 1005, and further perform the following operations:
[0071] Before the step of sequentially acquiring a mobile vehicle as a target vehicle from the preset equipment scheduling sequence of the circular single-row track, the method includes:
[0072] Searching for a mobile vehicle in a driving state among the vehicles;
[0073] A preset equipment scheduling sequence is generated based on each of the mobile carts, wherein the arrangement order of each of the mobile carts in the preset equipment scheduling sequence is determined based on the order of each of the mobile carts in the standard maximum circular path.
[0074] In order to clearly explain this solution, some noun concepts that may appear in this application are now explained.
[0075] Petri Net (PN) is a powerful graphical modeling tool that can describe both system structure and system operation.
[0076] A PN model is composed of places, transitions, directed arcs, tokens and other elements. In a PN model, places are represented by circles, which represent resource states or operations; transitions are represented by rectangular boxes, which are used to describe the start and end of events, to determine the occurrence of local states and events, and to transfer the system from one discrete state to another; directed arcs are used to connect places and transitions; tokens represent dynamic objects in places, which can be moved from one place to another.
[0077] Usually a PN is represented by a six-tuple (P, T, I, O, M, K), where
[0078] P={p0, p1, ..., p m} represents a set of finite places;
[0079] T={t0, t1, ..., t n} represents the set of finite transitions, P∪T≠Φ, P∩T=Φ;
[0080] I: P×T→N={0,1,2,...} is the input function, I(p,t) represents the number of tokens input from place p to t when transition t is triggered by place p;
[0081] O: P×T→N is the output function, O(p,t) represents the number of tokens output from t to p when place p triggers transition t;
[0082] M: P m →N m is the identification function, representing the current number of tokens, M(p) represents the number of tokens in place p, M(P) represents the number vector of all places, called the identification of PN, and M0 is the initial identification of PN;
[0083] K: P→N+={1,2,...} is the capacity function, K(p) represents the maximum number of tokens that place p can accommodate.
[0084] Among them, transition t can be interpreted as the token moving from one place to another, or staying in the same place. The specific calculation of I and O is obtained by the attribute statistics of the tokens in the place.
[0085] In a PN, for ∀p∈P, the condition under which transition t∈T can be triggered is:
[0086] M(p)≥I(p,t),
[0087] K(p)≥M(p)-I(p,t)+O(p,t)
[0088] The trigger condition can be interpreted as the number of tokens to be moved out of the place is less than or equal to the number of tokens in the place, and the number of tokens in the place after the tokens are moved out and moved in does not exceed the place capacity.
[0089] Thus, when the identifier of p is M(p), if transition t is triggered, the identifier of p after the trigger is
[0090] M'(p)=M(p)-I(p,t)+O(p,t)
[0091] PN models are mainly divided into process-oriented Petri Net (POPN) and resource-oriented Petri Net (ROPN). Compared with POPN, ROPN is smaller in scale and can analyze discrete event systems more effectively. This application mainly uses ROPN.
[0092] The ROPN-based multi-car scheduling method in this application is mainly used for scheduling OHT overhead cranes in wafer factories, and can also be used for scheduling RGVs. The scheduling method is mainly used to plan what actions each OHT (or RGV) will take at what time, including driving, loading and unloading, waiting, etc.
[0093] Taking OHT as an example, a typical layout in a wafer fab is that the OHT track is built against the wall, next to the smart shelf, and there is a robotic arm with a flat-laying device in the smart shelf. OHT places the product on the robotic arm, and the robotic arm places the product at the designated position on the shelf. The AGV retrieves the product from the designated position and transports it to the processing equipment. After the processing is completed, the AGV transports and places the product, and the robotic arm takes it out for OHT to pick up. For the entire OHT scheduling, the movement of the robotic arm and the AGV transportation are not involved.
[0094] Therefore, the hybrid ring multi-OHT scheduling system can be modeled as ROPN with the nodes of the track as the storage place, the transportable direction as the transition, and the OHT as the token. The meaning of each member is shown in the following table:
[0095] The OHT dispatching system is to plan what actions each OHT (or RGV) will take at what time, including driving, loading and unloading, waiting, etc. The system includes map information, OHT information and task information.
[0096] A typical layout of a wafer fab is that the OHT track is built against the wall, next to the smart shelf, where there is a robot with a flat-laying device. The OHT places the product on the robot, which places the product at the designated location on the shelf. The AGV retrieves the product from the designated location and transports it to the processing equipment. After processing, the AGV transports and places the product, and the robot takes it out for the OHT to pick up. For the entire OHT scheduling, the robot's movements and AGV transportation are not involved.
[0097] Therefore, the hybrid ring multi-OHT scheduling system can be modeled as ROPN with the nodes of the track as the storage place, the transportable direction as the transition, and the OHT as the token. The meaning of each member is as follows:
[0098] p i : The place type is a general place, which means the corresponding node i;
[0099] J i : The place type is a working place, which means the location (shelf) corresponding to node i and indicating the loading and unloading location of OHT;
[0100] B i : The place type is a fork place, which means it corresponds to node i and indicates that there are multiple directed arcs pointing from the place to different transitions;
[0101] Ci : The place type is a confluence place, which means it corresponds to node i and indicates that there are multiple directed arcs pointing to the place;
[0102] t i,j : The type is move transition, meaning moving from node i to node j.
[0103] The ROPN model constructed above can be referred to Figure 8 , Figure 8 This is a schematic diagram of the ROPN model in the ROPN-based multi-car scheduling method of this application.
[0104] In this ROPN model, for the convenience of identification, the subscripts of the places are not equal. The capacity of the places (including general places, working places, and fork places) is 1, that is, ∀p∈P, K(p)=1. It should also be noted that Figure 8 The dashed box in the middle can be represented as a shelf.
[0105] In addition, basic parameters related to the ROPN model in this application are explained.
[0106] Step 1: Initialize basic data;
[0107] Step 1.1: Obtain map information and OHT information, including nodes, reachable paths and distances between nodes, correspondence between nodes and shelves, OHT initial position and OHT maximum capacity;
[0108] Step 1.2: Establish a ROPN model based on the map information. The token is OHT. The token attributes include location, current working status and included products.
[0109] Step 1.3: Reference Figure 8 , starting from one of the libraries (such as p0), according to the outermost largest ring (no shortcuts) and the preset moving direction, establish the preset basic maximum ring path;
[0110] Path=[p0, p1, p2, ..., B n-1 , J n ];
[0111] Step 1.4: Select a working library place sequence from the preset basic maximum circular path, wherein the working library place sequence includes working library places and the library places on the short path between two working library places, and select the next library place in the basic path based on the last library place of the working library place sequence ( Figure 1 In the example, p1 is used to perform a ring rearrangement algorithm on the preset basic maximum ring path, such as:
[0112] Let the original sequence be X=[x0, x1, x2, ..., xm], and select element xi, then the circular rearrangement sequence is
[0113] X'=[xi, xi+1, ..., xm, x0, x1, x2, ..., xi-1],
[0114] If we select p1 for the basic path Path and perform the ring rearrangement algorithm, we get the rearranged path as follows:
[0115] Pathp1=[p1, p2, ..., Bn-1, Jn, p0];
[0116] The rearranged path obtained by this ring rearrangement algorithm is called the standard maximum ring path;
[0117] Step 1.5: Select all working places in the order of the standard maximum circular path to obtain the working place sequence [Jk+2, ..., Jn], and then reverse the order to obtain the standard working place sequence
[0118] Job=[Jn, ..., Jk+2].
[0119] Step 2: Receive task release information and feedback information;
[0120] The task release information is the transfer task, which can include the following five members:
[0121] Product number, a unique identification code for the product (the product is usually a wafer);
[0122] The place of occurrence (starting node), where the vehicle performs the loading task;
[0123] Destination (destination node), where the car performs unloading tasks;
[0124] Quantity, the default value is 1. If it is greater than 1, the trolley needs to be transported multiple times;
[0125] Task release time, used to sort tasks.
[0126] Feedback information is used to update the status information of the car after executing the dispatch instruction, and can include the following four members:
[0127] Car number, the car's unique identification code;
[0128] At the current position, the car occupies a node, and the token is in the corresponding place of the occupied node;
[0129] Action states: driving, loading, idling and unloading;
[0130] Current product, the product number that the cart is currently operating, can be empty.
[0131] Step 3, update the map information and car status information;
[0132] The nodes and paths of the map are fixed, and what changes are the products on the shelves, indicating that there are unfinished tasks. When a task release information is added, it means that there are products on the shelves waiting to be transported.
[0133] The position of the car corresponds to the position of the ROPN token. Whether it can move or trigger the transition is related to the action of the car. The action state of the car is divided into four types: idle state, driving state, loading state and unloading state. The state information of the car is updated according to the feedback information. If the feedback information is unloading, the car has no operating product and there is no subsequent task, then the action state is updated to idle state.
[0134] Reference Figure 2 In the first embodiment of the multi-car scheduling method based on ROPN of the present application, each of the cars is arranged on a circular one-way track, a shortcut is arranged on the circular one-way track, and the shortcut is used to connect any two non-adjacent nodes on the one-way track. The circular one-way track is configured with a standard maximum circular path and a POPN model generated based on the circular one-way track. The multi-car scheduling method based on ROPN includes the following steps:
[0135] Step S10, sequentially acquiring a mobile vehicle as a target vehicle from a preset equipment scheduling sequence of the circular single-row track, wherein the vehicle recorded in the preset equipment scheduling sequence is in a moving state;
[0136] It should be noted that, in the present embodiment, each car will be arranged to move on a circular one-way track, and usually the moving direction of each car is the same. A shortcut is arranged on the circular one-way track, and the shortcut is used to connect any two non-adjacent nodes on the one-way track. It can be understood that if the car takes a shortcut, the car can reach the destination node of the shortcut faster. The circular one-way track is configured with a standard maximum circular path, and a POPN model generated based on the circular one-way track. In order to avoid the problem of poor transportation efficiency caused by the car waiting for the car in front to move away when encountering a conflict, the present application can further consider whether the car can take a shortcut when a conflict occurs (that is, the transition cannot be triggered), and take a shortcut when it can, thereby avoiding the situation of waiting, thereby increasing transportation efficiency.
[0137] Exemplarily, mobile carts are sequentially obtained from the preset equipment scheduling sequence of the circular single-row track as target carts, wherein the carts recorded in the preset equipment scheduling sequence are all in a moving state, and the order of each mobile cart in the preset equipment scheduling sequence can be sorted according to the moving direction of the cart, which can be sorted according to the moving direction or in the opposite direction of the moving direction. The obtained mobile cart is used as the target cart.
[0138] In a feasible implementation manner, before the step of sequentially acquiring a mobile vehicle as a target vehicle from the preset equipment scheduling sequence of the circular single-row track, the method includes:
[0139] Step S01, searching for a moving vehicle in a driving state among the vehicles;
[0140] Step S02, generating a preset equipment scheduling sequence based on each of the mobile carts, wherein the arrangement order of each of the mobile carts in the preset equipment scheduling sequence is determined based on the order of each of the mobile carts in the standard maximum circular path.
[0141] Exemplarily, a car in a driving state is searched among the cars as a mobile car, and then a preset equipment scheduling sequence is generated based on each mobile car, and the arrangement order of each mobile car in the preset equipment scheduling sequence is determined based on the order of each mobile car in the standard maximum circular path, and the cars can be scheduled in sequence based on this order. For example, the cars in the preset scheduling equipment sequence DO are sorted according to the standard maximum circular path, and the preset scheduling equipment sequence DO=[Oht1, Oht2, ..., Ohtc] is assumed at this time, where Oht1 represents car 1.
[0142] Step S20, determining whether the first transition in the transition sequence of the target vehicle satisfies the trigger condition, wherein the transition sequence is generated based on the moving path of the target vehicle in the ROPN model, and the moving path is the path of the target vehicle when performing the transport task;
[0143] It should be noted that the transition sequence is generated based on the moving path of the target car in the ROPN model, and the moving path is the path of the target car when performing the transport task. In practical applications, it is usually necessary to first determine whether a transition sequence exists. If not, a transition sequence is constructed for it. For example, a transport task may include a starting node and a destination node. Accordingly, the car may need to move from the current position to the starting node or the destination node. For example, the current position is pnow, and the destination is pdes. The preset basic maximum circular path Path selects pnow and performs a circular rearrangement algorithm to obtain the rearranged path Pathpnow; the part from pnow to pdes in Pathpnow is intercepted, which is called the moving path Pathnow_des. Due to the uniqueness of the subscript, the transition sequence that needs to be triggered for Pathpnow from pnow to pdes can be directly inferred. For further reference Figure 8 , if Pathnow_des=[p0, p1, p2], then the transition sequence is [t 0,1 , t 1,2]. In addition, if the transition sequence is an empty sequence, it means that the current car does not need to move (it has moved to the starting node or the destination node, and the first item in the task sequence is removed, such as removing the subtask of moving to the starting node or removing the subtask of moving to the destination node, and updating the status of the car).
[0144] Exemplarily, it is determined whether the first transition in the transition sequence of the target vehicle satisfies the trigger condition. Based on the above example, the transition sequence is [t 0,1 , t 1,2 ], then the first transition is t 0,1 . Determine t 0,1 Whether the trigger condition is met. The essence is to determine whether there is a car in the library p1.
[0145] Step S30, if the trigger condition is met, then the scheduling instruction for executing the first transition is added to the preset scheduling instruction sequence, and the process returns to the step of sequentially acquiring a mobile vehicle as a target vehicle from the preset equipment scheduling sequence of the circular single-row track;
[0146] For example, if the trigger condition is met, the scheduling instruction for executing the first transition is added to the preset scheduling instruction sequence. 0,1 , the scheduling instruction can be in the form of {“device”:Oht1, “code”: 1 (indicates mobile status), “desination”: p1, “taskID”: task k}, after the scheduling instruction is added, the first transition in the transition sequence can be deleted. In addition, the technician can also set the form of the scheduling instruction according to actual needs. After the scheduling instruction is added to the preset scheduling instruction sequence, the process returns to the step of sequentially obtaining the mobile car as the target car from the preset equipment scheduling sequence of the circular single-row track.
[0147] Step S40: if the trigger condition is not met, the target vehicle is used as the vehicle to be allocated, and it is determined whether the vehicle to be allocated meets the preset shortcut condition;
[0148] For example, if the trigger condition is not met, it means that the target car conflicts with other cars. 0,1 For example, if there is a car in the place p1, the transition cannot be triggered. The target car is used as the car to be deployed, and it is determined whether the deployed car has the preset shortcut conditions. For example, it can be determined whether the current location of the target car is a fork place, and the fork place is connected to the shortcut. If it is a fork place, it can be considered that the target car has the preset shortcut conditions.
[0149] Step S50, if the preset shortcut conditions are met, then the dispatching instruction for the target vehicle to take the shortcut is added to the preset dispatching instruction sequence, and the process returns to the step of sequentially acquiring a mobile vehicle as the target vehicle from the preset equipment dispatching sequence of the circular single-row track;
[0150] For example, if the target car meets the preset shortcut conditions, the scheduling instruction for the target car to take the shortcut is added to the preset scheduling instruction sequence. w , the change is t 0,w ,Correspondingly, the scheduling instruction can be,{“device”: Oht1, “code”: 1, “desination”: p w ,“taskID”: task k After adding the shortcut dispatching instruction to the preset dispatching instruction sequence, the process returns to the step of sequentially acquiring a mobile vehicle as a target vehicle from the preset equipment dispatching sequence of the circular single-row track.
[0151] In addition, if the preset shortcut conditions are not met, a dispatching instruction for the target vehicle to wait can also be generated and incorporated into the preset dispatching instruction sequence.
[0152] Step S60, after traversing the mobile carts in the preset equipment scheduling sequence, each of the carts in the circular single-row track is scheduled based on the preset scheduling instruction sequence.
[0153] Exemplarily, after traversing the mobile vehicles in the preset equipment scheduling sequence, each vehicle in the circular single-row track is scheduled based on the preset scheduling instruction sequence, that is, the equipment (vehicle) corresponding to the scheduling instruction is controlled to move to the destination.
[0154] In a feasible implementation manner, after the step of dispatching each of the vehicles according to the preset dispatch instruction sequence, the method includes:
[0155] Step S70, after completing each dispatch instruction in the preset dispatch instruction sequence, update the information status of each of the vehicles, wherein the information status includes the location of the vehicle and the action status, and the action status includes moving status, loading status, idle status and unloading status.
[0156] Exemplarily, after the trolley is dispatched based on each dispatch instruction in the preset dispatch instruction sequence, the position and action status of the trolley may change, and the information status of each trolley is updated. The information status includes the location of the trolley and the action status. The action status includes moving status, loading status, idle status and unloading status.
[0157] In this embodiment, a mobile cart is obtained as a target cart from the preset equipment scheduling sequence of the circular single-row track in sequence, wherein the cart recorded in the preset equipment scheduling sequence is in a moving state; it is determined whether the first transition in the transition sequence of the target cart meets the trigger condition, wherein the transition sequence is generated based on the moving path of the target cart in the ROPN model, and the moving path is the path of the target cart when performing the handling task; if the trigger condition is met, the scheduling instruction for executing the first transition is added to the preset scheduling instruction sequence, and the execution of the preset equipment scheduling sequence from the circular single-row track in sequence is returned. The step of obtaining a mobile car as a target car in the equipment scheduling sequence; if the trigger condition is not met, the target car is used as the car to be allocated, and then it is determined whether the car to be allocated has the preset shortcut condition; if it has the preset shortcut condition, the scheduling instruction of the target car to take a shortcut is added to the preset scheduling instruction sequence, and the step of obtaining a mobile car as a target car from the preset equipment scheduling sequence of the circular single-row track is returned to execute; after traversing the mobile cars in the preset equipment scheduling sequence, each car in the circular single-row track is scheduled based on the preset scheduling instruction sequence. That is, a shortcut will be set on the circular single-row track of the car in the present application. When scheduling the car, if it is found that the target car cannot trigger the transition (that is, the target car conflicts with other cars), it is further determined whether the target car has the preset shortcut condition, and when it has the preset shortcut condition, a corresponding scheduling instruction is generated to control the target car to take a shortcut. Compared with the existing solution of waiting when there is a conflict, this embodiment can try to control the car to take a shortcut, reduce the situation of waiting, and thus increase the overall transportation efficiency.
[0158] Reference Figure 3 , based on the first embodiment of the present application, the second embodiment of the present application is proposed. The parts of the present application that are the same as the above embodiment can refer to the above content and will not be repeated here. After the step of determining whether the vehicle to be deployed meets the preset shortcut conditions, the method includes:
[0159] Step A10, if the preset shortcut condition is not met, then determine the second first transition in the standard transition sequence of the vehicle to be deployed, add the dispatch instruction for executing the second first transition to the preset temporary dispatch instruction sequence, and judge whether the second first transition meets the trigger condition, wherein the moving path associated with the standard transition sequence belongs to a partial path in the standard maximum circular path;
[0160] It should be noted that, in this embodiment, if the target car does not meet the preset shortcut conditions, an attempt will be made to mobilize the conflicting car that causes the target car to be immutable, thereby eliminating the conflict and avoiding the situation where the car waits.
[0161] Exemplarily, if the target car does not meet the preset shortcut conditions, the second first transition in the standard transition sequence of the car to be deployed will add the dispatching instruction for executing the second first transition to the preset temporary dispatching instruction sequence to determine whether the second first transition meets the triggering conditions. Whether the specific transition meets the triggering conditions can be referred to the above content, which will not be repeated here. Among them, the preset temporary dispatching instruction sequence will determine whether to add it to the preset dispatching instruction sequence in subsequent steps based on whether the triggering conditions are met, and the moving path associated with the standard transition sequence belongs to a partial path in the standard maximum circular path. For cars without transition sequences, the standard transition sequence is also determined based on the standard maximum circular path according to moving from the current position to the destination (if there is no target destination, the next warehouse of the car on the standard maximum circular path is used as the destination).
[0162] Step A20, if the second first transition satisfies the trigger condition, then the preset temporary scheduling instruction in the preset temporary scheduling instruction sequence is merged into the preset scheduling instruction sequence, the preset temporary scheduling instruction sequence is cleared, and the step of sequentially acquiring a mobile trolley as a target trolley from the preset equipment scheduling sequence of the circular single-row track is returned to be executed;
[0163] Exemplarily, if the second first transition satisfies the trigger condition, the preset temporary scheduling instruction is added to the preset temporary scheduling instruction sequence accordingly, which also means that all temporary scheduling instructions in the preset temporary scheduling instruction sequence can be executed. Therefore, the temporary scheduling instructions in the preset temporary scheduling instruction sequence are merged into the preset scheduling instruction sequence, the preset temporary scheduling instruction sequence is cleared, and then the step of obtaining the mobile car as the target car from the preset equipment scheduling sequence of the circular single-row track is returned to execute.
[0164] In addition, it should be noted that the step of merging the temporary scheduling instructions in the preset temporary scheduling instruction sequence into the preset scheduling instruction sequence may include arranging the scheduling instructions in the preset temporary scheduling instruction sequence in reverse order and merging them into the preset scheduling instruction sequence to ensure that the scheduling instructions in the preset temporary scheduling instruction sequence can be executed normally. For example, suppose that cart a needs to be moved to warehouse 1, and there is cart b in warehouse 1, so try to move cart b to warehouse 2. If there is no cart in warehouse 2, it means that the conflict of cart a can be resolved (the scheduling instructions in the preset temporary scheduling instruction sequence can be executed), but the moving order should be to move cart b to warehouse 2 first, and then move cart a to warehouse 1.
[0165] Step A30, if the second first transition does not meet the triggering condition, determine whether the conflicting vehicle that causes the second first transition to be untriggerable is the next moving vehicle of the target vehicle in the preset device scheduling sequence;
[0166] For example, if the second transition does not meet the triggering condition, it is determined whether the conflicting vehicle that caused the second transition to fail to be triggered is the next moving vehicle of the target vehicle in the preset equipment scheduling sequence. It should be noted that at this time, the action state of the conflicting vehicle may be moving state, unloading state, or loading state. If the action state is moving state, the conflicting vehicle is usually the next moving vehicle mentioned above.
[0167] Step A40, if it is the next moving car, then the conflicting car is used as a new target car, and based on the new target car, the step of determining whether the first transition in the transition sequence of the target car satisfies the trigger condition is executed;
[0168] Exemplarily, if the conflicting car is the next moving car, the conflicting car is used as the new target car, and the step of determining whether the first transition in the transition sequence of the target car meets the triggering condition based on the new target car is performed, thereby attempting to move the car that caused the conflict to resolve the conflict.
[0169] Step A50, if it is not the next moving vehicle, determine whether the conflicting vehicle is in a loading state or an unloading state;
[0170] Exemplarily, if it is not the next moving cart, it is further determined whether the conflicting cart is in a loading state or an unloading state.
[0171] Step A60, if it is in the loading state or the unloading state, clear the preset temporary scheduling instruction sequence, and return to the step of sequentially acquiring a mobile vehicle as a target vehicle from the preset equipment scheduling sequence of the circular single-row track;
[0172] For example, if it is in the loading state or unloading state, it means that the conflicting trolley cannot move, so the temporary scheduling instructions in the temporary scheduling instruction sequence cannot be executed, which means that the conflict cannot be eliminated. Therefore, the preset temporary scheduling instruction sequence can be cleared, and then the step of obtaining a mobile trolley as the target trolley from the preset equipment scheduling sequence of the circular single-row track can be returned to execute.
[0173] Step A70, if the state is not loading or unloading, the conflicting vehicle is used as a new vehicle to be allocated, and the process returns to the step of determining whether the vehicle to be allocated meets the conditions for taking a shortcut.
[0174] For example, if the conflicting trolley is not in a loading state or an unloading state, it means that the conflicting trolley is in a moving state or an idle state, so you can try to move the conflicting trolley. Whether the conflicting trolley can be moved specifically, return to the step of determining whether the trolley to be deployed has the conditions for taking a shortcut, that is, the subsequent step, to determine again.
[0175] It can be understood that in this embodiment, if the target car does not meet the preset shortcut conditions, an attempt will be made to move the conflicting car that causes the target car to be immovable, thereby eliminating the conflict and avoiding the situation where the car waits, so as to further increase the transportation efficiency.
[0176] Reference Figure 4 , based on the second embodiment of the present application, the third embodiment of the present application is proposed. The parts of the present application that are the same as the above embodiments can refer to the above content and will not be repeated here. The preset moving direction of each of the trolleys set on the circular single-row track is clockwise or counterclockwise, and the ROPN model is provided with a preset basic maximum circular path. Before the step of sequentially obtaining a mobile trolley as a target trolley from the preset equipment scheduling sequence of the circular single-row track, the method includes:
[0177] Step B10, searching for unassigned handling tasks on the work warehouse in the ROPN model, and taking the work warehouse with the unassigned handling tasks as the target work warehouse, wherein the work warehouse corresponds to the loading and unloading node on the circular single-row track;
[0178] Step B20, starting from the target work library, obtaining a trolley sequence on the preset basic maximum circular path in the opposite direction of the preset moving direction;
[0179] Step B30: assign the unassigned transport task to the first idle trolley in the trolley sequence.
[0180] Exemplarily, the unassigned handling tasks on the working warehouse in the ROPN model are searched, wherein the unassigned handling tasks are equivalent to the appearance of new products that need to be transported on the loading node on the circular single-row track. The working warehouse where the unassigned handling tasks exist is used as the target working warehouse. The trolley generation trolley sequence is obtained by taking the target working warehouse as the starting point and following the reverse direction of the preset moving direction (including clockwise or counterclockwise). It should be noted that the directions of movement of each trolley on the circular single-row track are the same, which is clockwise or counterclockwise, so the trolley is set to be non-reversible, so if a trolley misses the corresponding working warehouse, it needs to go around again to return to the corresponding working warehouse. When assigning handling tasks, the handling tasks should be assigned to the trolleys that do not need to take a detour, so the present application obtains the trolley generation trolley sequence on the preset basic maximum circular path in the reverse direction of the preset moving direction. The unassigned transport task is then assigned to the first idle trolley in the trolley sequence, and the first idle trolley is the fastest trolley that can execute the transport task, thereby improving the transportation efficiency.
[0181] For example, suppose the job library is Job i If there are unassigned tasks, select the task with the earliest arrival time;
[0182] Arrange the basic path in reverse order to get the reverse path Pathr, and take Job i Perform the ring rearrangement algorithm to obtain the rearrangement reverse path Pathr Jobi ;
[0183] Assuming the number of cars is b, follow the rearranged reverse path Pathr Jobi Get the car sequence car{i}=[car1, car2, ..., car b ];
[0184] Select the first car in the car sequence that is in the idle state j , then Job i Assign the unassigned tasks on the cart to the j , and let the car j The state is the driving state.
[0185] In a feasible implementation manner, the transport task includes a loading node and an unloading node. After the step of assigning the unassigned transport task to the first idle trolley in the trolley sequence, the method includes:
[0186] Step B40, decomposing the transport task into a collection of subtasks, wherein the subtasks in the collection of subtasks include moving the loading node from the current node and the action state is the moving state, loading the cargo at the loading node and the action state is the loading state, moving from the loading node to the unloading node and the action state is the moving state, and unloading the cargo at the unloading node and the action state is the unloading state;
[0187] Step B50, adding the subtask collection to the first idle car, wherein after receiving the subtask collection, the first idle car generates a transition sequence based on the first subtask in the subtask collection, and a transition sequence is associated with a moving path of a subtask.
[0188] Exemplarily, the transport task includes a loading node and an unloading node, that is, the product of the loading node is transported to the unloading node. This process can actually be divided into multiple steps, that is, the transport task is decomposed into a collection of subtasks, and the subtasks in the collection of subtasks include moving the loading node from the current node and the action state is the moving state, loading goods at the loading node and the action state is the loading state, moving from the loading node to the unloading node and the action state is the moving state, and unloading goods at the unloading node and the action state is the unloading state. For example, the subtask sequence can be: {"device": Oht k , "code": 1 (moving state), "desination": p s (Mount node), "taskID": task k};{“device”: Oht k , "code": 2 (loading status), "desination": p s (Mount node), "taskID": task k},{“device”: Oht k , "code": 1 (moving state), "desination": p t (Uninstall node), "taskID": task k};{“device”: Oht k , "code": 3 (uninstalled state), "desination": p t (Uninstall node), "taskID": task k The generated subtask collection is added to the first idle car. After the first idle car receives the subtask collection, a transition sequence can be generated based on the first subtask in the subtask collection, where a transition sequence is associated with a moving path of a subtask.
[0189] Reference Figure 5 , based on the third embodiment of the present application, the fourth embodiment of the present application is proposed. The parts of the present application that are the same as the above embodiments can refer to the above contents and will not be repeated here. Before the step of scheduling each of the trolleys in the circular single-row track based on the preset scheduling instruction sequence, the method includes:
[0190] Step C10, searching for a loading and unloading trolley in a loading state or an unloading state among the trolleys, wherein the actual state of the loading and unloading trolley is the same as the action state of the first subtask in the subtask sequence of the loading and unloading trolley, wherein the action state includes a loading state and an unloading state;
[0191] Step C20, generating an unloading instruction or a loading instruction based on the first subtask, and adding the unloading instruction or the loading instruction to the head end of the preset device scheduling sequence, and deleting the first subtask.
[0192] Exemplarily, each loading and unloading trolley in a loading state or an unloading state will be scheduled, and the actual state of the loading and unloading trolley is the same as the action state of the first subtask in the task sequence of the loading and unloading trolley, wherein the action state includes a loading state and an unloading state. It should be noted that if the actual state of the loading and unloading trolley is the same as the action state of the first subtask in the task sequence of the loading and unloading trolley, it means that the trolley is about to perform a loading operation or an unloading operation. Accordingly, an unloading instruction or a loading instruction is generated for the first subtask, and the unloading instruction or the loading instruction is added to the head end of the preset equipment scheduling sequence. The unloading instruction or the loading instruction is basically similar to the corresponding subtask content, and will not be repeated here, and the first subtask will be added to the subtask sequence. It can be understood that if the trolley is performing a loading operation or an unloading operation, the actual state of the trolley will be different from the action state of the first subtask in the task sequence of the loading and unloading trolley.
[0193] Reference Figure 6 The fifth embodiment of the present application is proposed based on the fourth embodiment of the present application. The same parts as the above embodiments in the present application can refer to the above contents and will not be repeated here. The step of judging whether the vehicle to be deployed meets the preset shortcut conditions includes:
[0194] Step D10, determining whether the location of the target vehicle is a forked location, wherein the forked location is provided with the shortcut;
[0195] Step D20: If it is not the forked warehouse, it is determined that the vehicle to be deployed does not have the conditions to take a shortcut;
[0196] For example, if the warehouse where the target vehicle is located is not a fork warehouse, the vehicle to be deployed does not have the conditions to take a shortcut.
[0197] Step D30, if it is the forked warehouse, then determine whether the target vehicle can trigger the shortcut transition of the shortcut, determine whether there is a moving vehicle in the shortest path between the starting node and the destination node of the shortcut on the circular one-way track, wherein the shortest path does not take a shortcut, and determine whether the destination node is in the moving path of the vehicle to be deployed;
[0198] Exemplarily, if the warehouse where the target car is located is a forked warehouse, it satisfies one of the conditions, and then further determines whether the target car can trigger the shortcut transition of the shortcut, that is, whether there is a car in the warehouse pointed to by the shortcut transition; determine whether there is a moving car in the shortest path between the starting node and the destination node of the shortcut on the circular one-way track, and the shortest path does not take a shortcut, that is, whether there is a moving car in the shortest path corresponding to the circular one-way track. If so, it means that if the car to be deployed has walked close, it may exceed some other moving cars. The car in the state may affect the movement path of other cars (therefore, this situation should be avoided, that is, to avoid affecting the movement path of other cars, and then re-planning the movement path of other cars, resulting in planning redundancy and waste of computing resources); determine whether the destination node is in the movement path of the car to be deployed, that is, determine whether the destination node of the shortcut is in the original movement path of the car to be deployed (if it is not in the original movement path, it means that taking a shortcut will cause the car to miss the corresponding work warehouse. After missing it, the car needs to go another circle to reach the corresponding work warehouse).
[0199] Step D40: If the target vehicle can trigger a shortcut transition of a shortcut, and there is no vehicle in motion in the shortest path between the shortcut start node and the destination node on the circular one-way track, and the destination node is in the moving path of the vehicle to be deployed, then it is determined that the vehicle to be deployed meets the conditions for taking a shortcut;
[0200] Step D50, if the target vehicle cannot trigger the shortcut change of the shortcut, or there is a moving vehicle in the shortest path between the shortcut starting node and the destination node on the circular one-way track, or the destination node is not in the moving path of the vehicle to be deployed, it is determined that the vehicle to be deployed does not meet the conditions for taking a shortcut.
[0201] For example, if the target car can trigger the shortcut transition of the shortcut, and there is no car in a moving state in the shortest path between the shortcut start node and the destination node on the circular one-way track, and the destination node is in the moving path of the car to be deployed, then the car to be deployed meets the conditions for taking the shortcut. Otherwise, it does not meet the conditions for taking the shortcut.
[0202] It can be understood that in this embodiment, various scenarios after the target vehicle takes a shortcut are fully considered, including whether the trigger condition of the shortcut change is met, whether the shortcut will affect other vehicles, and whether a detour is required after taking the shortcut, so as to avoid negative effects after the target vehicle takes a shortcut, thereby ensuring transportation efficiency.
[0203] Reference Figure 7 , based on the fifth embodiment of the present application, the sixth embodiment of the present application is proposed. The parts in this embodiment that are the same as those in the above embodiment can refer to the above content and will not be repeated here. Before the step of determining whether the first transition in the transition sequence of the target vehicle meets the trigger condition, the method includes:
[0204] Step E10: if the target car does not have the transition sequence, then generate the transition sequence based on the first subtask of the current subtask set of the target car;
[0205] Step E20: If the transition sequence is empty, the first subtask is deleted, and the action state of the target vehicle is changed based on the new first subtask in the subtask collection.
[0206] Exemplarily, before the step of determining whether the first transition in the transition sequence of the target car satisfies the trigger condition, if the target car does not have a transition sequence, a transition sequence is generated based on the first subtask in the current subtask collection of the target car. The generation process of the transition sequence can refer to the above content and is not described here. It can be understood that if the transition sequence is empty, it means that the current position of the target car is the same as the loading node or unloading node in the first subtask. Further, the first subtask can be deleted, and then the action state of the target car can be changed based on the new first subtask in the subtask collection. At this time, the changed action state is usually a moving state.
[0207] The ROPN-based multi-cart scheduling device provided in the present application adopts the ROPN-based multi-cart scheduling method in the above-mentioned embodiment, aiming to quickly adjust each wafer in the PM to the correct processing position. Compared with the prior art, the beneficial effects of the ROPN-based multi-cart scheduling device provided in the embodiment of the present application are the same as the beneficial effects of the ROPN-based multi-cart scheduling method provided in the above-mentioned embodiment, and the other technical features in the ROPN-based multi-cart scheduling device are the same as the features disclosed in the above-mentioned embodiment method, which will not be repeated here.
[0208] In addition, to achieve the above-mentioned purpose, the present application also provides an electronic device, which includes: a memory, a processor, and a ROPN-based multi-car scheduling program stored in the memory and executable on the processor, and the ROPN-based multi-car scheduling program, when executed by the processor, implements the steps of the ROPN-based multi-car scheduling method as described above.
[0209] The specific implementation of the electronic device of the present application is basically the same as the above-mentioned embodiments of the multi-car scheduling method based on ROPN, and will not be repeated here.
[0210] In addition, to achieve the above-mentioned purpose, the present application also provides a readable storage medium, on which a ROPN-based multi-car scheduling program is stored. When the ROPN-based multi-car scheduling program is executed by a processor, the steps of the ROPN-based multi-car scheduling method as described above are implemented.
[0211] The specific implementation method of the computer-readable storage medium of the present application is basically the same as the above-mentioned embodiments of the multi-car scheduling method based on ROPN, and will not be repeated here.
[0212] It should be noted that, in this article, the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, article or system including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or system. In the absence of further restrictions, an element defined by the sentence "comprises a ..." does not exclude the existence of other identical elements in the process, method, article or system including the element.
[0213] The serial numbers of the above-mentioned embodiments of the present application are for description only and do not represent the advantages or disadvantages of the embodiments.
[0214] Through the description of the above implementation methods, those skilled in the art can clearly understand that the above-mentioned embodiment methods can be implemented by means of software plus a necessary general hardware platform, and of course by hardware, but in many cases the former is a better implementation method. Based on such an understanding, the technical solution of the present application is essentially or the part that contributes to the prior art can be embodied in the form of a software product, which is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk) as described above, and includes a number of instructions for a terminal device (which can be a computer, server, or network device, etc.) to execute the methods described in each embodiment of the present application.
[0215] The above are only preferred embodiments of the present application, and are not intended to limit the patent scope of the present application. Any equivalent structure or equivalent process transformation made using the contents of the present application specification and drawings, or directly or indirectly applied in other related technical fields, are also included in the patent protection scope of the present application.
Claims
1. A multi-car dispatching method based on ROPN, characterized in that: Each of the trolleys is arranged on a circular one-way track, a shortcut is arranged on the circular one-way track, and the shortcut is used to connect any two non-adjacent nodes on the circular one-way track. The circular one-way track is configured with a standard maximum circular path and a ROPN model generated based on the circular one-way track. The multi-vehicle scheduling method based on ROPN includes the following steps: Sequentially acquiring a mobile trolley as a target trolley from a preset equipment scheduling sequence of the circular single-row track, wherein the trolley recorded in the preset equipment scheduling sequence is in a moving state; Determine whether the first transition in the transition sequence of the target vehicle satisfies the trigger condition, wherein the transition sequence is generated based on the moving path of the target vehicle in the ROPN model, and the moving path is the path of the target vehicle when performing the transport task; If the trigger condition is met, the scheduling instruction for executing the first transition is added to the preset scheduling instruction sequence, and the process returns to the step of sequentially acquiring a mobile vehicle as a target vehicle from the preset equipment scheduling sequence of the circular single-row track; If the trigger condition is not met, the target vehicle is used as the vehicle to be allocated, and it is determined whether the vehicle to be allocated meets the preset shortcut conditions; If the preset shortcut conditions are met, the scheduling instruction for the target vehicle to take the shortcut is added to the preset scheduling instruction sequence, and the process returns to the step of sequentially acquiring a mobile vehicle as the target vehicle from the preset equipment scheduling sequence of the circular single-row track; After traversing the mobile carts in the preset equipment scheduling sequence, scheduling each of the carts in the circular single-row track based on the preset scheduling instruction sequence; Wherein, after the step of determining whether the vehicle to be deployed meets the preset shortcut conditions, the method includes: If the preset shortcut condition is not met, the second first transition in the standard transition sequence of the vehicle to be deployed is determined, and the dispatch instruction for executing the second first transition is added to the preset temporary dispatch instruction sequence, and it is determined whether the second first transition meets the trigger condition, wherein the moving path associated with the standard transition sequence belongs to a partial path in the standard maximum circular path; If the second first transition satisfies the trigger condition, the scheduling instructions in the preset temporary scheduling instruction sequence are merged into the preset scheduling instruction sequence, the preset temporary scheduling instruction sequence is cleared, and the step of sequentially acquiring a mobile vehicle as a target vehicle from the preset equipment scheduling sequence of the circular single-row track is returned to be executed; If the second first transition does not meet the triggering condition, determining whether the conflicting vehicle that causes the second first transition to be untriggerable is the next moving vehicle of the target vehicle in the preset device scheduling sequence; If it is the next moving car, the conflicting car is used as a new target car, and the step of determining whether the first transition in the transition sequence of the target car satisfies the trigger condition is performed based on the new target car; If it is not the next moving car, determine whether the conflicting car is in a loading state or an unloading state; If it is in the loading state or the unloading state, the preset temporary scheduling instruction sequence is cleared, and the step of sequentially acquiring a mobile trolley as a target trolley from the preset equipment scheduling sequence of the circular single-row track is returned to be executed; If it is not in the loading state or the unloading state, the conflicting vehicle is used as a new vehicle to be allocated, and the process returns to the step of determining whether the vehicle to be allocated meets the conditions for taking a shortcut.
2. The multi-car dispatching method based on ROPN as claimed in claim 1 is characterized in that: The preset moving direction of each of the trolleys set on the circular single-row track is clockwise or counterclockwise, and the ROPN model is provided with a preset basic maximum circular path. Before the step of sequentially acquiring a mobile trolley as a target trolley from a preset equipment scheduling sequence of the circular single-row track, the method includes: Searching for unassigned handling tasks on the work warehouse in the ROPN model, and taking the work warehouse with the unassigned handling tasks as the target work warehouse, wherein the work warehouse corresponds to the loading and unloading node on the circular single-row track; Taking the target work library as the starting point, obtaining the cart generation cart sequence on the preset basic maximum circular path in the opposite direction of the preset moving direction; The unassigned transport task is assigned to the first idle trolley in the trolley sequence.
3. The multi-car dispatching method based on ROPN as claimed in claim 2 is characterized in that: in, The transport task includes a loading node and an unloading node. After the step of assigning the unassigned transport task to the first idle trolley in the trolley sequence, the method includes: Decomposing the transport task into a collection of subtasks, wherein the subtasks in the collection of subtasks include moving the loading node from the current node and the action state is a moving state, loading goods at the loading node and the action state is a loading state, moving from the loading node to the unloading node and the action state is a moving state, and unloading goods at the unloading node and the action state is an unloading state; Add the subtask collection to the first car that is in an idle state.
4. The multi-car dispatching method based on ROPN as claimed in claim 3 is characterized in that: Before the step of determining whether the first transition in the transition sequence of the target vehicle satisfies a trigger condition, the method includes: If the target car does not have the transition sequence, generating the transition sequence based on the first subtask of the current subtask set of the target car; If the transition sequence is empty, the first subtask is deleted, and the action state of the target vehicle is changed based on the new first subtask in the subtask collection.
5. The multi-car dispatching method based on ROPN as claimed in claim 3 is characterized in that: Before the step of scheduling each of the trolleys in the circular single-row track based on the preset scheduling instruction sequence, the method includes: Searching for a loading and unloading trolley in a loading state or an unloading state among the trolleys, wherein the actual state of the loading and unloading trolley is the same as the action state of the first subtask in the subtask sequence of the loading and unloading trolley, wherein the action state includes a loading state and an unloading state; An unloading instruction or a loading instruction is generated based on the first subtask, and the unloading instruction or the loading instruction is added to the head end of the preset device scheduling sequence, and the first subtask is deleted.
6. The multi-car dispatching method based on ROPN as claimed in claim 1 is characterized in that: The step of judging whether the vehicle to be deployed meets the preset shortcut conditions includes: Determine whether the warehouse where the target vehicle is located is a forked warehouse, wherein the forked warehouse is provided with the shortcut; If it is not the forked warehouse, it will be determined that the vehicle to be deployed does not have the conditions to take a shortcut; If it is the forked warehouse, determine whether the target vehicle can trigger the shortcut transition of the shortcut, determine whether there is a moving vehicle in the shortest path between the starting node and the destination node of the shortcut on the circular one-way track, wherein the shortest path does not take a shortcut, and determine whether the destination node is in the moving path of the vehicle to be deployed; If the target vehicle can trigger the shortcut transition of the shortcut, and there is no vehicle in a moving state in the shortest path between the starting node and the destination node of the shortcut on the circular one-way track, and the destination node is in the moving path of the vehicle to be deployed, then it is determined that the vehicle to be deployed meets the conditions for taking a shortcut; If the target vehicle cannot trigger the shortcut transition of the shortcut, or there is a moving vehicle in the shortest path between the starting node and the destination node of the shortcut on the circular one-way track, or the destination node is not in the moving path of the vehicle to be deployed, it is determined that the vehicle to be deployed does not meet the conditions for taking a shortcut.
7. The multi-car dispatching method based on ROPN as claimed in claim 1 is characterized in that: Before the step of sequentially acquiring a mobile vehicle as a target vehicle from the preset equipment scheduling sequence of the circular single-row track, the method includes: Searching for a mobile vehicle in a driving state among the vehicles; A preset equipment scheduling sequence is generated based on each of the mobile carts, wherein the arrangement order of each of the mobile carts in the preset equipment scheduling sequence is determined based on the order of each of the mobile carts in the standard maximum circular path.
8. An electronic device, characterized in that: The electronic device includes a memory, a processor, and a ROPN-based multi-car scheduling program stored in the memory and executable on the processor, wherein: the ROPN-based multi-car scheduling program, when executed by the processor, implements the steps of the ROPN-based multi-car scheduling method as described in any one of claims 1 to 7.
9. A storage medium, characterized in that: The storage medium stores a ROPN-based multi-car scheduling program, which, when executed by a processor, implements the steps of the ROPN-based multi-car scheduling method as described in any one of claims 1 to 7.
