Tidal lane-borrowing scheduling method, system and medium for hoists

By using a tidal bypass scheduling method and a bypass ticket mechanism, the scheduling mode of the hoist is dynamically adjusted, which solves the problems of low utilization rate of the connection position and physical handover interruption when the double-opening chain hoist is unbalanced, and achieves more efficient resource utilization and stable operation.

CN123105141APending Publication Date: 2026-11-17WUXI QUICKTRON INTELLIGENT TECHNOLOGY CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202611554828.0
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2026-10-09
Publication Date
2026-11-17

AI Technical Summary

Technical Problem

When the ratio of inbound and outbound tasks is unbalanced, the existing double-opening chain hoist has low utilization of the connection position, limited cross-floor handling throughput, and physical handover interruption is prone to occur during the borrowing of connection positions, which affects the stable operation of the automated warehouse.

Method used

The tidal lane borrowing scheduling method is adopted. By obtaining the number of inbound and outbound tasks in the task queue, the scheduling mode is dynamically switched. In the tidal lane borrowing mode, the idle delivery docking position is temporarily locked as the delivery location to be borrowed and allowed to be borrowed. Combined with one-way lane borrowing constraints and hierarchical yielding mechanism, the task is executed in sequence.

Benefits of technology

It improves the utilization rate of connection resources and the throughput of handling in unbalanced scenarios, ensures the safety of physical handover and the stability of the scheduling system, avoids resource waste and deadlock, and improves the efficiency of cross-floor handling.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN123105141A_ABST
    Figure CN123105141A_ABST
Patent Text Reader

Abstract

This application provides a tidal lane-sharing scheduling method, system, and medium for hoists. By statistically analyzing the number of inbound and outbound tasks in the task queue, the system controls the switching between normal operation mode and tidal lane-sharing mode. In tidal lane-sharing mode, corresponding tickets are issued based on the availability of pick-up and drop-off docking points on the starting floor, and available drop-off docking points are locked as the designated drop-off locations. When a task assigned in the original direction initiates a occupancy request, a yielding strategy is determined based on whether the task has already begun physical docking, thereby improving the utilization rate of docking resources and cross-floor handling throughput, ensuring physical docking safety, and maintaining scheduling stability.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This application relates to the field of intelligent warehousing and logistics scheduling technology, and in particular to a tidal bypass scheduling method, system and medium for hoists. Background Technology

[0002] With the continuous development of intelligent warehousing and logistics technology, automated storage and retrieval systems (AS / RS) have been widely applied in scenarios such as goods storage, order picking, and cross-floor handling. Four-way shuttle AS / RS systems utilize four-way shuttles, stealth robots, and elevators to transport goods between different aisles and floors, improving warehouse space utilization and the automation level of logistics operations. Among these, the AS / RS elevator, as a key handling device connecting different floor conveyor systems, primarily undertakes the task of cross-floor goods transfer; its connection capacity and scheduling efficiency directly affect the overall inbound and outbound throughput of the AS / RS. With the increasing number of order tasks and the dynamic changes in the ratio of inbound and outbound tasks, how to fully utilize the elevators and their floor connection resources has become a key issue that needs to be considered in the field of intelligent warehousing and logistics scheduling.

[0003] Existing four-way shuttle automated storage and retrieval systems (AS / RS) typically employ double-opening chain hoists, with two physical connection points on each floor corresponding to the hoist: a pickup point and a drop-off point. During routine scheduling, the pickup and drop-off points perform fixed pickup and drop-off functions, respectively. The pickup point is used for the hoist to retrieve goods, while the drop-off point is used for the hoist to push goods to the floor-side equipment. For example, in an inbound task, goods enter the hoist from the pickup point on the starting floor, are transported across floors, and then exit from the drop-off point on the target floor. Similarly, in an outbound task, goods enter the hoist from the pickup point on their respective floor, are transported to the outbound floor, and then exit from the drop-off point on that floor. When the number of inbound and outbound tasks is relatively balanced, the pickup and drop-off points operate according to their fixed physical roles, ensuring relatively stable goods connection and cross-floor transport.

[0004] However, when the ratio of inbound to outbound tasks is severely imbalanced, the aforementioned fixed physical role connection method can easily lead to uneven utilization of connection resources. For example, when the ratio of inbound to outbound tasks reaches 8:2, the starting floor pickup location for tasks in the imbalanced direction will experience continuous queue backlog, while the opposite storage location on the same floor will remain idle for a long time. Thus, on the one hand, tasks in the imbalanced direction can only be connected through a single pickup location, making that pickup location a bottleneck for the elevator's cross-floor transport. On the other hand, the transport capacity resources such as elevator waiting points are difficult to fully utilize for tasks in the imbalanced direction, and the physical connection capacity of the opposite storage location is also idle, limiting the overall throughput capacity of the automated warehouse to the queue depth of a single pickup location.

[0005] Furthermore, if tasks in the unbalanced direction are simply allowed to borrow the opposite storage location as an additional retrieval location, the question arises as to whether the borrowing task should immediately withdraw when a task that originally needed to use that storage location arrives. Especially when the borrowing task has already begun physical handover with the elevator, forcibly canceling the current connection action could interrupt the handover process between the elevator chain and the pallet, leading to problems such as jammed goods, damage, inconsistencies between task and equipment status, or the inability to continue using the connection location. If both the inbound and outbound directions can simultaneously borrow connection locations from each other, a circular waiting process may occur due to tasks in different directions occupying each other's connection resources and waiting for the other to release them, causing deadlocks or unbounded waiting, affecting the continuous and stable operation of the automated warehouse.

[0006] Therefore, existing double-opening chain hoists, with fixed physical roles at the docking positions, struggle to balance docking resource utilization, task throughput, and physical handover security in scenarios of unbalanced inbound and outbound tasks. Summary of the Invention

[0007] In view of the shortcomings of the prior art described above, the purpose of this application is to provide a tidal bypass scheduling method, system and medium for hoists, which can solve the technical problems of low utilization rate of docking positions, limited cross-floor handling throughput and easy physical handover interruption during docking position borrowing when the ratio of inbound and outbound tasks of existing double-opening chain hoists is unbalanced.

[0008] To achieve the above and other related objectives, the first aspect of this application provides a tidal lane-sharing scheduling method for hoists, applied to a tidal lane-sharing scheduling system. The tidal lane-sharing scheduling system is communicatively connected to a hoist installed in an automated warehouse. The automated warehouse includes multiple floors, each with a pickup docking station and a delivery docking station. The tidal lane-sharing scheduling method for hoists includes: acquiring the number of inbound tasks and outbound tasks in a task queue to be assigned, and controlling the current scheduling mode to switch between a normal working mode and a tidal lane-sharing mode based on the number of inbound and outbound tasks. The method includes: determining the proportion of inbound tasks and the proportion of outbound tasks based on the number of inbound and outbound tasks; controlling the current scheduling mode to switch between a normal working mode and a tidal lane-sharing mode based on the proportion of inbound and outbound tasks and a preset mode switching rule; if the current scheduling mode is the tidal lane-sharing mode, determining whether the pickup docking station on the starting floor corresponding to the currently pending task is idle; if... If the pickup docking station on the starting floor corresponding to the previous task is idle, a normal handling ticket is issued to control the hoist to execute the normal handling process. If the pickup docking station on the starting floor corresponding to the current task is not idle, it is determined whether the delivery docking station on the same floor is idle. If the delivery docking station on the same floor is idle, a tidal delivery ticket is issued based on the detour ticket issuance mechanism, and the delivery docking station on the same floor is locked as the delivery location to be borrowed, so as to control the hoist to execute the detour handling process. The detour ticket issuance mechanism includes a one-way detour constraint mechanism, which allows only one task direction to detour at any given time. During the process of controlling the hoist to execute the detour handling process, if a task is assigned to the original direction of the delivery location to initiate an occupation request, the detour strategy for the current task is determined based on a tiered detour mechanism. The tiered detour mechanism includes: determining whether the current task has started physical docking action, and determining the detour strategy for the current task based on the determination result.

[0009] In some embodiments of the first aspect of this application, the tidal access mode includes an inbound access mode and an outbound access mode; wherein, the preset mode switching rule includes any one or more of the following combinations: if the current scheduling mode is the normal working mode, and the proportion of inbound tasks is greater than or equal to the preset access entry threshold, then the current scheduling mode is switched from the normal working mode to the inbound access mode; if the current scheduling mode is the normal working mode, and the proportion of outbound tasks is greater than or equal to the preset access entry threshold, then the current scheduling mode is switched from the normal working mode to the outbound access mode; if the current scheduling mode is the inbound access mode, and the proportion of inbound tasks is less than or equal to the preset access exit threshold, then the current scheduling mode is switched from the inbound access mode to the normal working mode; if the current scheduling mode is the outbound access mode, and the proportion of outbound tasks is less than or equal to the preset access exit threshold, then the current scheduling mode is switched from the outbound access mode to the normal working mode; if there are no tasks to be executed in the task queue to be allocated, then the normal working mode is maintained or switched back.

[0010] In some embodiments of the first aspect of this application, the tidal detour ticket includes an inbound detour ticket and an outbound detour ticket; wherein, the one-way detour constraint mechanism includes: if the current scheduling mode is an inbound detour mode, only an inbound detour ticket is issued; if the current scheduling mode is an outbound detour mode, only an outbound detour ticket is issued; after locking the detour location, before the inbound detour ticket or the outbound detour ticket expires, it is prohibited to allocate the detour location to other pending tasks that require detours and are of the opposite type to the currently pending task.

[0011] In some embodiments of the first aspect of this application, the detour ticket issuance mechanism includes a priority enhancement mechanism, which includes: obtaining the waiting time of the original direction assigned task using the same floor's cargo transfer station and the waiting time of the currently pending task requiring detour, and determining the actual priority of the original direction assigned task and the actual priority of the currently pending task based on a preset time threshold; if the actual priority of the original direction assigned task is greater than or equal to the actual priority of the currently pending task, then no tidal detour ticket is issued; if the actual priority of the original direction assigned task is less than the actual priority of the currently pending task, then a tidal detour ticket is issued.

[0012] In some embodiments of the first aspect of this application, the method of determining whether the currently pending task has started a physical connection action and determining the yielding strategy of the currently pending task based on the determination result includes: determining whether the currently pending task has started a physical connection action; if the currently pending task has not started a physical connection action, then determining that the yielding strategy of the currently pending task is to cancel the tidal passage ticket and release the borrowed storage space for use by the task to be allocated in the original direction; if the currently pending task has started a physical connection action, then determining that the yielding strategy of the currently pending task is to keep the tidal passage ticket valid, allow the current physical connection action to continue, and release the tidal passage ticket and the borrowed storage space after the current physical connection action is completed.

[0013] In some embodiments of the first aspect of this application, the method further includes: when exiting the tidal passage mode, stopping the issuance of new tidal passage tickets and identifying the issued and not yet expired tidal passage tickets as existing passage tickets; based on a graded yielding mechanism, performing a ticket convergence operation on the existing passage tickets; the method of performing the ticket convergence operation includes: if a request for occupancy of a task allocated in the original direction is received, and the corresponding task to be executed has not yet started physical connection, then canceling the corresponding existing passage ticket and releasing the borrowed storage space; if the corresponding task to be executed has started physical connection, then keeping the corresponding existing passage ticket valid, allowing the existing passage ticket and the borrowed storage space to be released after the physical connection is completed; if no request for occupancy of a task allocated in the original direction is received, then allowing the corresponding task to be executed to complete one passage action before releasing the corresponding existing passage ticket.

[0014] In some embodiments of the first aspect of this application, a self-resolving mechanism for occupied scenarios is further included. The self-resolving mechanism for occupied scenarios includes: during the execution of the original direction allocation task, if it is detected that the cargo delivery docking position of the target floor corresponding to the original direction allocation task is occupied, the hoist is controlled to return to the starting floor corresponding to the original direction allocation task, and the currently carried goods are transferred to the cargo delivery docking position of the starting floor. Then, the hoist is controlled to execute a bypass transport process. After the bypass transport process is completed, the hoist is controlled to return to the starting floor corresponding to the original direction allocation task to retrieve the goods again and execute the normal transport process.

[0015] To achieve the above and other related objectives, a second aspect of this application provides a tidal flow scheduling system, comprising: a mode switching module, configured to acquire the number of inbound tasks and the number of outbound tasks in the task queue to be assigned, and control the current scheduling mode to switch between a normal working mode and a tidal flow mode based on the number of inbound tasks and the number of outbound tasks; the method includes: determining the proportion of inbound tasks and the proportion of outbound tasks based on the number of inbound tasks and the number of outbound tasks; and controlling the current scheduling mode to switch between a normal working mode and a tidal flow mode based on the proportion of inbound tasks and the proportion of outbound tasks and a preset mode switching rule; and a resource scheduling module, configured to, if the current scheduling mode is the tidal flow mode, determine whether the pickup docking station corresponding to the starting floor of the currently pending task is idle; if the pickup docking station corresponding to the starting floor of the currently pending task is idle, issue a normal handling ticket to control the flow of goods. The hoist is controlled to perform a normal handling process. If the pickup docking station on the starting floor corresponding to the current task is not idle, it is determined whether the delivery docking station on the same floor is idle. If the delivery docking station on the same floor is idle, a tidal delivery ticket is issued based on the delivery ticket issuance mechanism, and the delivery docking station on the same floor is locked as the delivery location to be borrowed, so as to control the hoist to perform the delivery process. The delivery ticket issuance mechanism includes a one-way delivery constraint mechanism, which allows only one task direction to make delivery at the same time. During the process of controlling the hoist to perform the delivery process, if a task is assigned to the original direction of the delivery location to be borrowed and a request for occupation is initiated, the delivery strategy for the current task is determined based on the hierarchical delivery mechanism. The hierarchical delivery mechanism includes: determining whether the current task has started physical docking action, and determining the delivery strategy for the current task based on the determination result.

[0016] To achieve the above and other related objectives, a third aspect of this application provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the tidal bypass scheduling method for hoists as described above.

[0017] As described above, the tidal lane-borrowing scheduling method, system, and medium for hoists in this application have the following beneficial effects:

[0018] (1) Improve the utilization rate of connection resources and the throughput capacity of handling in imbalance scenarios: Based on the number of inbound and outbound tasks, control the current scheduling mode to switch between normal working mode and tidal diversion mode. In tidal diversion mode, the idle delivery connection position on the starting floor is temporarily locked as the borrowed delivery position, so that it can undertake the picking function. As a result, the effective picking connection position in the imbalance direction can be expanded from one to two, releasing the physical connection capacity of the idle delivery connection position on the same floor, alleviating the queuing backlog and throughput bottleneck of a single picking connection position, and improving the efficiency of cross-floor handling by the elevator.

[0019] (2) Increase the initial usage priority of the original direction allocation task: By setting the bypass task as the initial low priority task, the original direction allocation task will have a higher connection position usage priority under normal circumstances. At the same time, the waiting bonus mechanism will prevent the bypass task from being unable to be executed for a long time.

[0020] (3) Improve the security of the physical connection process: When a task in the original direction initiates a request for occupancy, the yielding strategy is determined based on whether the borrowing task has started physical connection. For borrowing tasks that have not yet started physical connection, the tidal borrowing ticket is cancelled and the borrowed storage space is released. For borrowing tasks that have started physical connection, they are allowed to complete the physical connection before the corresponding resources are released, thereby avoiding the forced interruption of the chain and pallet handover process, reducing the possibility of jammed goods, cargo damage, inconsistency between task status and equipment status, and deadlock of connection positions, and realizing orderly release after resource grabbing.

[0021] (4) Improve the stability and activity of the scheduling system: By using the one-way borrowing constraint mechanism, only one task direction is allowed to borrow at the same time, and the inbound and outbound directions are prohibited from borrowing connection positions from each other at the same time. This cuts off the conditions for bidirectional borrowing to form a circular waiting from the scheduling architecture, reduces the possibility of deadlock and unbounded waiting, and enables the borrowing task and the original direction assigned task to be executed continuously in the determined resource release order.

[0022] In summary, the tidal bypass scheduling method, system, and medium for hoists of the present invention, through the coordinated operation of tidal bypass mode, bypass ticket issuance mechanism, and graded pass-through mechanism, realizes the safe and dynamic reuse of cargo delivery docking positions in scenarios of task imbalance. While improving the utilization rate of docking resources and the throughput capacity of cross-floor handling, it also takes into account the priority of tasks in the original direction, the security of physical handover, the integrity of resource release, and the operational stability of the scheduling system. Attached Figure Description

[0023] Figure 1 The diagram shown is a schematic representation of the physical structure of a double-opening chain hoist according to an embodiment of this application.

[0024] Figure 2The diagram shown is a flowchart illustrating a tidal bypass scheduling method for a hoist in one embodiment of this application.

[0025] Figure 3 The diagram shown is a flowchart of a graded yielding mechanism in one embodiment of this application.

[0026] Figure 4 The diagram shown is a schematic block diagram of a tidal passage scheduling system according to an embodiment of this application. Detailed Implementation

[0027] The following specific examples illustrate the implementation of this application. Those skilled in the art can easily understand other advantages and effects of this application from the content disclosed in this specification. This application can also be implemented or applied through other different specific embodiments, and various details in this specification can also be modified or changed based on different viewpoints and applications without departing from the spirit of this application. It should be noted that, unless otherwise specified, the following embodiments and features in the embodiments can be combined with each other.

[0028] In the embodiments of this application, the terms "first" and "second" are used to distinguish identical or similar items with essentially the same function and effect. Those skilled in the art will understand that the terms "first" and "second" do not limit the quantity or execution order, and that the terms "first" and "second" do not necessarily imply that they are different.

[0029] It should be noted that, in the embodiments of this application, the words "exemplary" or "for example" indicate examples, illustrations, or descriptions. Any embodiment or design described as "exemplary" or "for example" in this application should not be construed as being more preferred or advantageous than other embodiments or designs. Specifically, the use of words such as "exemplary" or "for example" is intended to present the relevant concepts in a concrete manner.

[0030] In this application embodiment, "at least one" refers to one or more, and "more than one" refers to two or more. "And / or" describes the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A alone, A and B simultaneously, or B alone, where A and B can be singular or plural. The character " / " generally indicates that the preceding and following related objects are in an "or" relationship. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one of a, b, or c can represent: a, b, c, ab, ac, bc, or abc, where a, b, and c can be single or multiple.

[0031] The technical solution of this application embodiment can be applied to an intelligent warehousing system. In an automated warehouse, a double-opening chain-type hoist is used to perform pallet cross-floor inbound and outbound transport, and the floor connection points are scheduled when the ratio of inbound to outbound tasks is unbalanced. The automated warehouse has multiple floors, each floor is equipped with a picking connection point and a placing connection point. The picking connection point is used for the hoist to pick up the pallet, and the placing connection point is used for the hoist to push the pallet to the floor-side equipment of the corresponding floor. The hoist picks up the pallet carrying the goods from the picking connection point of the starting floor, transports the pallet to the target floor, and then pushes the pallet to the placing connection point of the target floor. Each hoist is equipped with a waiting point on the starting floor, and the number of waiting points is usually equal to the number of transport capacities that the hoist can handle concurrently. After obtaining the ticket, the borrowing task first goes to the waiting point to wait, and then goes to perform the transfer according to the status of the connection point. The hoist is equipped with a transfer mechanism, which includes chain tongues that can extend to both sides of the hoist. After the hoist moves to the corresponding floor and aligns with the picking or unloading docking station, it performs a pallet picking or pushing action via the chain tongue. When the chain tongue extends into the bottom of the pallet, the pallet enters the physical handover process, establishing a support relationship between the chain tongue and the pallet, and lifting the pallet to the preset support position. During this physical handover process, if the chain tongue is controlled to retract in reverse midway, it may cause inconsistencies between the task status and the equipment status. Therefore, once the physical handover between the chain tongue and the pallet begins, this physical handover action is not forcibly interrupted.

[0032] In this embodiment, as Figure 1The diagram illustrates the physical structure of a double-opening chain-type elevator according to an embodiment of the present invention. Exemplarily, the automated warehouse includes a first floor (1F), a second floor (2F), and a third floor (3F), and is equipped with a double-opening chain-type elevator for transporting goods between different floors. Each floor is provided with one picking dock and one placing dock. Specifically, the first floor (1F) has a picking dock 10 and a placing dock 11, the second floor (2F) has a picking dock 20 and a placing dock 21, and the third floor (3F) has a picking dock 30 and a placing dock 31. When performing an inbound task from the first floor (1F) to the third floor (3F), the transport unit on the starting floor transports the pallet carrying the goods to the picking dock 10 on the first floor (1F). The hoist moves to the first floor (1F) and aligns with the picking docking station 10. The chain tongue extends to the side of the picking docking station 10, inserting into the bottom of the pallet and lifting it to a preset support position. The pallet is then moved from the picking docking station 10 into the hoist via the retraction of the chain tongue. Subsequently, the hoist carries the pallet to the third floor (3F) and aligns with the placing docking station 31. The hoist controls the chain tongue to extend to the side of the placing docking station 31, pushing the pallet from the hoist to the placing docking station 31. After the pallet transfer is complete, the chain tongue retracts from the pallet handover area, leaving the pallet in the placing docking station 31. The transport unit on the target floor then transports the pallet from the placing docking station 31 to the corresponding target storage location, completing this warehousing task. It should be noted that... Figure 1 In this context, the picking location is the picking connection location, and the placing location is the placing connection location. A handling unit refers to a mobile handling device used to transport pallets within the storage floors or elevator connection areas. The handling unit can be a stealthy robot or a four-way shuttle. It should be noted that the number of floors shown in this embodiment is merely an example and does not constitute a limitation on the number of floors. In practical applications, the number of floors in an automated warehouse can be determined according to the specific usage scenario. Let the number of floors be Z, where Z is an integer greater than 1.

[0033] In this embodiment, exemplarily, when performing an outbound task from the third floor (3F) to the first floor (1F), the hoist moves to the third floor (3F) and aligns with the picking-up docking station 30. The chain tongue is then extended towards the side of the picking-up docking station 30, inserting into the bottom of the pallet and lifting it to a preset support position. Through the retraction and transfer action of the chain tongue, the pallet is moved from the picking-up docking station 30 into the hoist. Subsequently, the hoist lowers the pallet to the first floor (1F) and aligns with the delivery docking station 11. The hoist controls the chain tongue to extend towards the side of the delivery docking station 11, and through the pushing action of the chain tongue, the pallet is transferred from the hoist to the delivery docking station 11, thus completing the outbound task. The above-described inbound process from the first floor (1F) to the third floor (3F) and outbound process from the third floor (3F) to the first floor (1F) illustrate the normal handling process of a double-opening chain hoist. When the ratio of inbound to outbound tasks is unbalanced, the pickup pick-up points on the starting floor with a larger number of tasks may be continuously queued, while the drop-off pick-up points on the same floor may be idle, thus creating a tidal flow scheduling application scenario.

[0034] To facilitate understanding of the embodiments of this application, firstly, in conjunction with Figure 2 Detailed explanation. Figure 2 This document illustrates a flowchart of a tidal lane-sharing scheduling method for hoists according to an embodiment of the present invention. In this embodiment, the tidal lane-sharing scheduling method for hoists is applied to a tidal lane-sharing scheduling system. This system is communicatively connected to a hoist located in an automated warehouse. The automated warehouse comprises multiple floors, each equipped with a pick-up docking station and a drop-off docking station. The tidal lane-sharing scheduling method for hoists mainly includes the following steps:

[0035] S201: Obtain the number of inbound tasks and the number of outbound tasks in the task queue to be assigned, and control the current scheduling mode to switch between normal working mode and tidal bypass mode based on the number of inbound tasks and the number of outbound tasks.

[0036] In this embodiment, the method for controlling the switching of the current scheduling mode between the normal working mode and the tidal flow mode based on the number of inbound tasks and the number of outbound tasks includes:

[0037] (1) Determine the proportion of inbound tasks and the proportion of outbound tasks based on the number of inbound tasks and the number of outbound tasks.

[0038] (2) Based on the proportion of inbound tasks and the proportion of outbound tasks, and based on the preset mode switching rules, control the current scheduling mode to switch between normal working mode and tidal bypass mode.

[0039] In this embodiment, the scheduling system periodically counts the queue of tasks to be assigned corresponding to the hoist, or, upon receiving a ticket request for the hoist, counts the number of inbound and outbound tasks in the hoist's queue of tasks to be assigned. A ticket request refers to a request submitted by a task to be executed in order to obtain hoist transportation resources.

[0040] In this embodiment, the methods for determining the proportion of inbound tasks and the proportion of outbound tasks based on the number of inbound tasks and the number of outbound tasks include:

[0041] ;

[0042] ;

[0043] in, Indicates the percentage of tasks entering the warehouse; This indicates the number of inbound tasks in the task queue to be assigned; This indicates the number of outbound tasks in the task queue to be assigned; This indicates the percentage of outbound tasks.

[0044] In this embodiment, based on the proportion of inbound tasks, the proportion of outbound tasks, and preset mode switching rules, the current scheduling mode is controlled to switch between normal working mode and tidal flow mode. Normal working mode refers to a scheduling mode in which both inbound and outbound tasks are performed according to the original functions of the picking and placing docks on each floor.

[0045] In this embodiment, the tidal traffic diversion mode includes an inbound traffic diversion mode and an outbound traffic diversion mode. The inbound traffic diversion mode is used for traffic diversion scheduling of inbound tasks, and the outbound traffic diversion mode is used for traffic diversion scheduling of outbound tasks. The preset mode switching rules include any one or more combinations of the following:

[0046] (1) If the current scheduling mode is normal working mode and the proportion of the inbound task is greater than or equal to the preset access threshold, then the current scheduling mode is switched from normal working mode to inbound access mode.

[0047] (2) If the current scheduling mode is normal working mode and the proportion of outbound tasks is greater than or equal to the preset bypass entry threshold, then the current scheduling mode is switched from normal working mode to outbound bypass mode.

[0048] (3) If the current scheduling mode is the inbound detour mode, and the proportion of inbound tasks is less than or equal to the preset detour exit threshold, then the current scheduling mode is switched from the inbound detour mode to the normal working mode.

[0049] (4) If the current scheduling mode is outbound bypass mode and the proportion of outbound tasks is less than or equal to the preset bypass exit threshold, then the current scheduling mode is switched from outbound bypass mode to normal working mode.

[0050] (5) If there are no tasks to be executed in the task queue, maintain or switch back to normal working mode.

[0051] In this embodiment, the preset entry threshold for bypassing a task is greater than the preset exit threshold for bypassing a task. For example, the preset entry threshold for bypassing a task is 0.7, and the preset exit threshold for bypassing a task is 0.5. If the current scheduling mode is normal working mode, and the proportion of inbound tasks is greater than or equal to 0.7, it indicates that the inbound tasks in the task queue to be assigned are unbalanced relative to the outbound tasks. In this case, the current scheduling mode is switched from normal working mode to inbound bypassing mode. If the current scheduling mode is normal working mode, and the proportion of outbound tasks is greater than or equal to 0.7, it indicates that the outbound tasks in the task queue to be assigned are unbalanced relative to the inbound tasks. In this case, the current scheduling mode is switched from normal working mode to outbound bypassing mode.

[0052] In this embodiment, if the current scheduling mode is the inbound detour mode, even if the proportion of inbound tasks gradually decreases from below the preset detour entry threshold, the inbound detour mode will continue as long as the proportion of inbound tasks remains greater than 0.5. The current scheduling mode will only be switched from the inbound detour mode to the normal working mode when the proportion of inbound tasks is less than or equal to 0.5. Similarly, if the current scheduling mode is the outbound detour mode, even if the proportion of outbound tasks gradually decreases from below the preset detour entry threshold, the outbound detour mode will continue as long as the proportion of outbound tasks remains greater than 0.5. The current scheduling mode will only be switched from the outbound detour mode to the normal working mode when the proportion of outbound tasks is less than or equal to 0.5.

[0053] In this embodiment, if there are no tasks to be executed in the task queue, that is, the number of inbound tasks and the number of outbound tasks are both zero, the task ratio cannot be calculated based on the number of both, so the corresponding task ratio calculation is not performed, and the normal working mode is maintained. If the current scheduling mode is the inbound bypass mode or the outbound bypass mode, the current scheduling mode is switched back to the normal working mode.

[0054] In this embodiment, the preset entry threshold for bypassing is greater than the preset exit threshold for bypassing, creating a lag interval between the two. When the proportion of inbound or outbound tasks enters the lag interval, the scheduling system maintains the current scheduling mode and does not perform mode switching, thereby avoiding frequent switching between the normal working mode and the tidal bypass mode when the proportion of tasks fluctuates near the preset entry or exit threshold for bypassing.

[0055] S202: If the current scheduling mode is the tidal bypass mode, then determine whether the pickup docking position of the starting floor corresponding to the current task to be executed is in an idle state.

[0056] In this embodiment, if the current scheduling mode is the tidal bypass mode, the task to be executed is determined from the task queue. The task to be executed may be an inbound task or an outbound task. The starting floor and target floor corresponding to the task to be executed are determined, and it is determined whether the pickup docking station on the corresponding starting floor is idle. Only one pickup docking station is set up on each floor. It is determined whether the pickup docking station is idle, that is, whether the pickup docking station can currently accept the task to be executed. When the pickup docking station can accept a pickup task, it means that the pickup docking station has available capacity, that is, the pickup docking station is idle. When the pickup docking station is occupied, or there is already a task waiting to use the pickup docking station, it means that the pickup docking station does not have available capacity, that is, it is not idle. For example, in the inbound bypass mode, the task to be executed is an inbound task and the starting floor is the first floor 1F. First, it is checked whether the pickup docking station 10 on the first floor 1F is idle to determine whether the pickup docking station 10 can accept the current inbound task.

[0057] S203: If the pickup and transfer position on the starting floor corresponding to the current task to be executed is idle, a normal handling ticket is issued to control the hoist to execute the normal handling process.

[0058] In this embodiment, if the pickup docking station on the starting floor corresponding to the current task to be executed is idle, a normal handling ticket is issued, and the hoist is controlled to perform the normal handling process according to the original pickup function of the pickup docking station. For example, if the current task to be executed is an inbound task from the first floor 1F to the third floor 3F, and the pickup docking station 10 on the first floor 1F is idle, a normal handling ticket is issued, and the handling unit is controlled to transport the pallet carrying the goods to the pickup docking station 10. The hoist picks up the pallet from the pickup docking station 10, transports the pallet to the third floor 3F, and pushes it out from the unloading docking station 31 on the third floor 3F.

[0059] S204: If the pickup docking station on the starting floor corresponding to the current task to be executed is not idle, then determine whether the delivery docking station on the same floor is idle; if the delivery docking station on the same floor is idle, then issue a tidal delivery ticket based on the detour ticket issuance mechanism, and lock the delivery docking station on the same floor as the delivery docking station to be borrowed, so as to control the hoist to execute the detour transportation process.

[0060] In this embodiment, when the pickup docking station on the starting floor corresponding to the currently pending task is not idle, the scheduling system does not discard the current pending task. Instead, it attempts to request a detour ticket from an idle delivery docking station on the same floor. First, it checks whether the delivery docking station on the same floor as the pickup docking station is idle. If the delivery docking station on the same floor is unoccupied and available, it is determined that the delivery docking station is idle. Then, based on the detour ticket issuance mechanism, it is determined whether to issue a tidal detour ticket to the currently pending task.

[0061] In this embodiment, the tidal passage tickets include inbound passage tickets and outbound passage tickets; wherein, the passage ticket issuance mechanism includes a one-way passage constraint mechanism, the one-way passage constraint mechanism including:

[0062] (1) If the current scheduling mode is the inbound detour mode, then only inbound detour tickets will be issued.

[0063] (2) If the current scheduling mode is outbound detour mode, then only outbound detour tickets will be issued.

[0064] (3) After locking the borrowed storage location, before the inbound or outbound debit ticket expires, it is prohibited to assign the borrowed storage location to other pending tasks that require debiting and are opposite to the type of the current pending task.

[0065] In this embodiment, the one-way passage constraint mechanism allows only one task direction (inbound or outbound) to pass through at any given time. Specifically, if the current scheduling mode is inbound passage mode, only inbound passage tickets are issued to inbound tasks, allowing them to use the delivery docking station on their starting floor to perform retrieval operations, without issuing outbound passage tickets to outbound tasks. If the current scheduling mode is outbound passage mode, only outbound passage tickets are issued to outbound tasks, without issuing inbound passage tickets to inbound tasks. After locking the delivery docking station on the corresponding floor as the borrowed delivery location, the borrowed delivery location is prohibited from being assigned to other tasks requiring passage that are the opposite of the currently pending task type until the corresponding inbound or outbound passage ticket expires.

[0066] In this embodiment, exemplarily speaking, under the inbound detour mode, after the delivery docking station 11 on the first floor (1F) is locked as a detourable delivery station, before the corresponding inbound detour ticket expires, it is prohibited to issue outbound detour tickets for delivery docking station 11 to outbound tasks requiring detour access. It should be noted that the above restrictions apply to detour usage in the opposite direction and do not restrict tasks assigned in the original direction from initiating a occupancy request based on the original delivery function of delivery docking station 11. When a task assigned in the original direction initiates an occupancy request, the current detour task is processed according to a tiered yielding mechanism.

[0067] In this embodiment, the one-way borrowing constraint mechanism can be expressed as follows: for any two tickets in the valid ticket set, it is not allowed for two tickets to simultaneously have borrowing attributes and correspond to different borrowing directions. The valid ticket set includes tickets that have been issued but not yet revoked or released, and the borrowing directions include inbound borrowing directions and outbound borrowing directions. That is, at any given time, there is no situation in the valid ticket set where inbound borrowing tickets and outbound borrowing tickets are both valid. By restricting the inbound and outbound directions from simultaneously borrowing connection points from each other, the conditions for bidirectional borrowing to form a circular waiting pattern can be cut off, reducing the possibility of deadlock or unbounded waiting during the borrowing scheduling process.

[0068] In this embodiment, before issuing a tidal passage ticket, it is determined whether there are any original direction allocation tasks waiting to use the cargo delivery docking station. If there are no original direction allocation tasks, no priority comparison is required, and a tidal passage ticket is issued if the one-way passage constraint mechanism is satisfied. After the currently pending task obtains a tidal passage ticket, it is identified as the current passage task.

[0069] In this embodiment, the detour ticket issuance mechanism includes a priority enhancement mechanism, which includes:

[0070] (1) Obtain the waiting time of the original direction assigned task using the same floor delivery dock and the waiting time of the current task to be executed that needs to be bypassed, and determine the actual priority of the original direction assigned task and the actual priority of the current task to be executed based on the preset time threshold.

[0071] (2) If the actual priority of the task assigned in the original direction is greater than or equal to the actual priority of the task to be executed, then no tidal passage ticket will be issued.

[0072] (3) If the actual priority of the task assigned in the original direction is less than the actual priority of the task to be executed, then a tidal passage ticket is issued.

[0073] In this embodiment, if there are original direction allocation tasks waiting to use the cargo transfer station, the waiting time of the original direction allocation tasks and the waiting time of the currently pending tasks that need to use the transfer route are obtained. Based on the initial priority of each task and its corresponding waiting bonus, the actual priority of the original direction allocation tasks and the actual priority of the currently pending tasks are determined respectively. The actual priority of a task can be expressed as the sum of its initial priority and the waiting bonus, with the waiting bonus determined based on the task's waiting time.

[0074] In this embodiment, the initial priority of the currently pending task is lower than the initial priority of the task assigned in the original direction. When the waiting time of any task in the original direction or the currently pending task reaches a preset time threshold, a waiting bonus is added to the initial priority of that task to obtain the actual priority of the task assigned in the original direction and the actual priority of the currently pending task. For example, 10 points are added for every 15 minutes of waiting.

[0075] In this embodiment, if the actual priority of the task allocated in the original direction is greater than or equal to the actual priority of the task currently awaiting execution, a tidal passage ticket will not be issued to the task currently awaiting execution, allowing the task allocated in the original direction to use the cargo delivery dock first. If the actual priority of the task allocated in the original direction is less than the actual priority of the task currently awaiting execution, a tidal passage ticket will be issued to the task currently awaiting execution, allowing it to complete one passage in this round of ticket allocation first. After obtaining the tidal passage ticket, the task currently awaiting execution is identified as the current passage task. After completing this passage, the current passage task releases the tidal passage ticket and clears the waiting bonus accumulated due to this waiting, allowing the corresponding task to re-participate in priority sorting according to its initial priority in subsequent ticket allocation processes.

[0076] In this embodiment, the tidal passage ticket has the following characteristics:

[0077] (1) Tidal passage tickets carry passage attribute flags. For example, the passage attribute flag is set to "borrowed=true". Borrowed is the passage attribute field, and true indicates that the field is in a valid state.

[0078] (2) The tidal passage ticket is associated with the current passage task, and the initial priority of the current passage task is lower than the initial priority of the original direction allocation task that uses the passage space. The tidal passage ticket can be revoked when the original direction allocation task initiates an occupation request and the current passage task has not yet started physical connection.

[0079] (3) Each tidal passage ticket can only be used to complete one passage action and will be released after the passage action is completed.

[0080] In this embodiment, the initial priority of the task is:

[0081] ;

[0082] in, Indicates the initial priority of the task; Indicates the basic priority of the task; This indicates the deduction value for priority access. This indicates the function that indicates the route attribute.

[0083] In this embodiment, when the task is a currently pending task that needs to borrow a route, borrowed=true, the value of the route attribute indicator function is 1, the initial priority of the currently pending task is equal to its base priority minus the route priority deduction value, which is lower than the initial priority of the task allocated in the original direction.

[0084] In this embodiment, when a task is an original direction task that does not require borrowing, `borrowed=false`, the borrowing attribute indicator function is set to 0, no priority is deducted, and its initial priority is equal to the base priority. The borrowing priority deduction value is greater than the change range of the base priority within the system. The purpose is to ensure that the initial priority of the currently pending task requiring borrowing, after the borrowing priority deduction, is lower than the initial priority of the original direction task. Thus, without the addition of waiting bonus, the original direction task takes precedence over the currently pending task requiring borrowing. After a task enters the waiting state, a waiting bonus can be added to its initial priority based on the task's waiting time to determine the task's actual priority.

[0085] In this embodiment, after issuing the tidal passage ticket, the hoist is controlled to execute the passage transfer process, and the hoist is controlled to perform a retrieval action through the borrowed delivery position, realizing the passage use of the delivery connection position. For example, in the warehouse passage mode, the current task to be executed is the warehouse task from the first floor 1F to the third floor 3F. After detecting that the retrieval connection position 10 on the first floor 1F is not idle, it further detects whether the delivery connection position 11 on the same floor is idle. The original direction of the task assigned to the delivery connection position 11 is the outbound task with the first floor 1F as the target floor, which normally needs to be completed through the delivery connection position 11, that is, the outbound task executed according to "retrieval connection position 30 on the third floor 3F → hoist → delivery connection position 11 on the first floor 1F". When the delivery docking station 11 is idle, based on the one-way borrowing constraint mechanism and priority promotion mechanism, a tidal borrowing ticket is issued to the currently pending task (such as an inbound task), making the currently pending task the current borrowing task, and locking the delivery docking station 11 as the borrowed delivery docking station. Subsequently, the handling unit (lurking robot or four-way shuttle) is guided to the corresponding waiting point to wait, and according to the status of the borrowed delivery docking station, the handling unit is controlled to move from the waiting point to the borrowed delivery docking station to execute the subsequent borrowing handling process, and the elevator is controlled to perform the picking action through the borrowed delivery docking station, realizing the borrowing use of the delivery docking station 11.

[0086] S205: During the process of controlling the hoist to execute the bypass transport process, if a request for occupancy is initiated using the original direction allocation task of the bypassed storage location, the bypass strategy for the current task to be executed is determined based on the hierarchical bypass mechanism. Here, the original direction allocation task refers to the task that requires the bypassed storage location to complete the delivery according to its original delivery function in normal working mode.

[0087] In this embodiment, after obtaining the tidal passage ticket, the scheduling system controls the hoist to move to the floor where the borrowed storage location is located and aligns the hoist with the location. Then, the hoist's chain tongue extends towards the side of the borrowed storage location and performs a pick-up action to move the pallet carrying goods from the location into the hoist. Compared to normal use of the delivery dock where the chain tongue pushes the pallet from the hoist to the delivery dock, in this passage process, the extension direction of the chain tongue remains unchanged, but the transfer action is reversed from a push-out action to a pick-up action. This allows the borrowed storage location to temporarily function as a pick-up dock during this passage process without changing the hardware structure.

[0088] In this embodiment, as Figure 3 The diagram illustrates a flowchart of the hierarchical yielding mechanism in an embodiment of the present invention. Based on the hierarchical yielding mechanism, the method for determining the yielding strategy for the currently pending task includes:

[0089] S301: Determine whether the physical connection action has started for the currently pending task.

[0090] S302: If the current task to be executed has not yet started the physical connection action, then the yielding strategy for the current task to be executed is to cancel the tidal passage ticket and release the borrowed cargo space for use by the task to be allocated in the original direction.

[0091] S303: If the current task to be executed has already started a physical connection action, then the yielding strategy for the current task to be executed is to keep the tidal passage ticket valid, allow the current physical connection action to continue, and release the tidal passage ticket and the borrowed storage space after the current physical connection action is completed.

[0092] In this embodiment, during the process of controlling the hoist to execute the bypass transport process, the occupancy status of the bypassed storage location is continuously monitored, and it is determined whether an occupancy request initiated by the original direction allocation task using the bypassed storage location has been received. If, when an occupancy request from the original direction allocation task is received, the transport unit carrying the pallet is still in a waiting state, or the transport unit is on its way to the bypassed storage location and has not yet started the physical handover between the chain tongue and the pallet, it is determined that the current task to be executed has not yet started the physical connection action. The bypass strategy for the current task to be executed is to cancel the tidal bypass ticket issued for the current task to be executed, reassign the current task to be executed to the normal task queue corresponding to the pickup connection location on its starting floor, or return the current task to the waiting task queue to wait for reallocation, and release the bypassed storage location for use by the original direction allocation task.

[0093] In this embodiment, if, upon receiving a request to occupy a task assigned in the original direction, the pallet-carrying transport unit has already arrived at the designated storage location, and the hoist's chain tongue has begun extending towards the side of the designated storage location, or the pallet has already entered the process of physical handover with the hoist, then it is determined that the current task to be executed has begun its physical connection action. Since it is not advisable to forcibly interrupt the physical handover of the chain tongue and pallet, the yielding strategy for the current task to be executed is to keep the tidal passage pass valid, allowing the hoist to continue executing this physical connection action until the pallet is completely moved into the hoist. After this physical connection action is completed, the tidal passage pass and the designated storage location are released for use by the task assigned in the original direction.

[0094] In this embodiment, a position sensor is installed at the beginning of the chain tongue's extension stroke. The position sensor is used to detect whether the tongue has entered a preset starting position. The determination method for whether the physical connection action has started includes any one or a combination of the following methods:

[0095] (1) Detect whether the chain tongue has reached the preset starting position by the position sensor: if the chain tongue has reached the preset starting position, it is determined that the physical connection action has started; if the chain tongue has not reached the preset starting position, it is determined that the physical connection action has not started.

[0096] (2) Obtain the transfer drive status or transfer start command issuance status corresponding to the chain tongue: If the transfer drive is enabled, it is determined that the physical connection action has started; otherwise, it is determined that the physical connection action has not started. Alternatively, obtain the transfer start command issuance status. If the transfer start command is successfully issued, it is determined that the physical connection action has started; otherwise, it is determined that the physical connection action has not started.

[0097] (3) Whether the status of the current task to be executed is set to physical connection status: If the status of the current task to be executed is set to physical connection status, it is determined that the physical connection action has started; if the status of the current task to be executed is not set to physical connection status, it is determined that the physical connection action has not started.

[0098] In this embodiment, when the occupancy request for the original direction allocation task and the physical connection start signal arrive simultaneously or close to each other, if the status of the current task to be executed has been set to physical connection status, it is determined that the physical connection action has started. The process follows the strategy of keeping the tidal passage ticket valid, allowing the current physical connection action to continue, and releasing the tidal passage ticket and the borrowed storage space after the current physical connection action is completed. If the status of the current task to be executed has not been set, and the transport unit has not yet arrived at the borrowed storage space, it is determined that the physical connection action has not started. The process follows the strategy of canceling the tidal passage ticket and releasing the borrowed storage space for use by the original direction allocation task. If it cannot be confirmed that the current task to be executed has not started the physical connection action, it is processed as if the physical connection action has started to avoid forcibly interrupting the physical handover due to misjudgment.

[0099] In this embodiment, the method further includes: when exiting the tidal passage mode, stopping the issuance of new tidal passage tickets and identifying the issued and not yet expired tidal passage tickets as existing passage tickets; and performing a ticket convergence operation on the existing passage tickets based on a graded yielding mechanism.

[0100] In this embodiment, when exiting the tidal lane borrowing mode, the issuance of new tidal lane borrowing tickets is stopped. Before exiting the tidal lane borrowing mode, the tidal lane borrowing tickets that have already been issued and have not yet expired are identified as existing borrowing tickets. The scheduling system does not uniformly cancel all existing borrowing tickets, but continues to monitor whether the currently pending tasks corresponding to each existing borrowing ticket have started physical connection actions, and whether it has received an occupation request from the original direction allocation task for the borrowed storage space, and performs ticket convergence operation according to the hierarchical yielding mechanism.

[0101] In this embodiment, specifically, if a request to occupy a task allocated in the original direction is received, and the corresponding task to be executed has not yet started physical connection, the corresponding existing detour ticket is revoked and the borrowed storage space is released. If the corresponding task to be executed has started physical connection, the corresponding existing detour ticket remains valid, and the existing detour ticket and the borrowed storage space are released after the physical connection is completed. If no request to occupy a task allocated in the original direction is received, the corresponding task to be executed is allowed to complete one detour before the corresponding existing detour ticket is released. Since no new tidal detour tickets are issued after exiting the tidal detour mode, and each existing detour ticket supports at most one detour, the number of existing detour tickets gradually decreases until it reaches zero. Before all existing detour tickets expire, the one-way detour constraint mechanism continues to be executed to avoid tidal detour tickets in different directions being valid simultaneously.

[0102] In this embodiment, it further includes: a placeholder scene self-resolving mechanism, the placeholder scene self-resolving mechanism including:

[0103] (1) During the execution of the original direction allocation task, if it is detected that the cargo delivery docking position of the target floor corresponding to the original direction allocation task is occupied, the hoist is controlled to return to the starting floor corresponding to the original direction allocation task, and the cargo currently being carried is transferred to the cargo delivery docking position of the starting floor, and then the hoist is controlled to execute the bypass transport process.

[0104] (2) After the detour transport process is completed, control the hoist to return to the starting floor corresponding to the original task allocation, retrieve the goods again, and execute the normal transport process.

[0105] In this embodiment, in extreme cases, a scenario may occur where a transport unit occupies the target delivery docking position, while the hoist carrying the original-direction pallet also needs to place it into the same target delivery docking position. After the hoist executes the original-direction allocation task and moves the corresponding goods to the target floor, if it detects that the delivery docking position of the target floor corresponding to the original-direction allocation task is occupied by a transport unit executing the current borrowing task (the currently pending task), preventing the hoist from transferring the currently carried goods to that delivery docking position, then the occupation scenario self-resolvement mechanism is triggered. The scheduling system controls the hoist to return to the starting floor corresponding to the original-direction allocation task, temporarily transfers the currently carried goods to the delivery docking position of that starting floor, and controls the hoist to return to execute the current borrowing task which is in a waiting state, so as to release the current borrowing task from occupying the delivery docking position of the target floor. After the current detour task's detour handling process is completed, and the corresponding tidal detour ticket and the detoured cargo space are released, the dispatching system controls the hoist to return to the starting floor corresponding to the original task assignment. It then retrieves the previously temporarily stored goods from the corresponding cargo release dock and transports them to the target floor corresponding to the original task assignment. The cargo is then released through the cargo release dock on the target floor. This self-resolving process is completed by the hoist's own lifting and transfer mechanisms, requiring no additional handling equipment.

[0106] It is worth noting that the tidal lane-borrowing scheduling method for hoists of the present invention has the following advantages:

[0107] (1) Improve the utilization rate of connection resources and the throughput capacity of handling in imbalance scenarios: Based on the number of inbound and outbound tasks, control the current scheduling mode to switch between normal working mode and tidal diversion mode. In tidal diversion mode, the idle delivery connection position on the starting floor is temporarily locked as the borrowed delivery position, so that it can undertake the picking function. As a result, the effective picking connection position in the imbalance direction can be expanded from one to two, releasing the physical connection capacity of the idle delivery connection position on the same floor, alleviating the queuing backlog and throughput bottleneck of a single picking connection position, and improving the efficiency of cross-floor handling by the elevator.

[0108] (2) Increase the initial usage priority of the original direction allocation task: By setting the bypass task as the initial low priority task, the original direction allocation task will have a higher connection position usage priority under normal circumstances. At the same time, the waiting bonus mechanism will prevent the bypass task from being unable to be executed for a long time.

[0109] (3) Improve the security of the physical connection process: When a task in the original direction initiates a request for occupancy, the yielding strategy is determined based on whether the borrowing task has started physical connection. For borrowing tasks that have not yet started physical connection, the tidal borrowing ticket is cancelled and the borrowed storage space is released. For borrowing tasks that have started physical connection, they are allowed to complete the physical connection before the corresponding resources are released, thereby avoiding the forced interruption of the chain and pallet handover process, reducing the possibility of jammed goods, cargo damage, inconsistency between task status and equipment status, and deadlock of connection positions, and realizing orderly release after resource grabbing.

[0110] (4) Improve the stability and activity of the scheduling system: By using the one-way borrowing constraint mechanism, only one task direction is allowed to borrow at the same time, and the inbound and outbound directions are prohibited from borrowing connection positions from each other at the same time. This cuts off the conditions for bidirectional borrowing to form a circular waiting from the scheduling architecture, reduces the possibility of deadlock and unbounded waiting, and enables the borrowing task and the original direction assigned task to be executed continuously in the determined resource release order.

[0111] In summary, the tidal lane-sharing scheduling method for hoists of the present invention achieves safe and dynamic reuse of cargo delivery docking stations in scenarios of task imbalance through the coordinated operation of tidal lane-sharing mode, lane-sharing ticket issuance mechanism and graded lane-sharing mechanism. While improving the utilization rate of docking resources and cross-floor handling throughput, it also takes into account the priority of tasks in the original direction, the safety of physical handover, the integrity of resource release and the stability of the scheduling system operation.

[0112] Figure 4 This is a schematic block diagram of the tidal lane-borrowing scheduling system provided in the embodiments of this application. Figure 4 As shown, the tidal flow diversion scheduling system 400 includes:

[0113] The mode switching module 401 is used to obtain the number of inbound tasks and the number of outbound tasks in the task queue to be assigned, and control the current scheduling mode to switch between normal working mode and tidal bypass mode according to the number of inbound tasks and the number of outbound tasks.

[0114] The resource scheduling module 402 is used to determine whether the pickup docking station on the starting floor corresponding to the current task is idle if the current scheduling mode is the tidal bypass mode; if the pickup docking station on the starting floor corresponding to the current task is idle, a normal handling ticket is issued to control the hoist to execute the normal handling process; if the pickup docking station on the starting floor corresponding to the current task is not idle, it determines whether the delivery docking station on the same floor is idle; if the delivery docking station on the same floor is idle, a tidal bypass ticket is issued based on the bypass ticket issuance mechanism, and the delivery docking station on the same floor is locked as the delivery location to be borrowed, so as to control the hoist to execute the bypass handling process; during the process of controlling the hoist to execute the bypass handling process, if a task is assigned to the original direction of the delivery location to be borrowed and a request for occupation is initiated, the bypass strategy for the current task is determined based on the hierarchical bypass mechanism.

[0115] It should be understood that the specific process of each module performing the above-mentioned steps has been described in detail in the above method embodiments, and will not be repeated here for the sake of brevity.

[0116] It should also be understood that the module division in the embodiments of this application is illustrative and only represents a logical functional division; in actual implementation, there may be other division methods. Furthermore, the functional modules in the various embodiments of this application can be integrated into a single processor, exist as separate physical entities, or be integrated into a single module. The integrated modules described above can be implemented in hardware or as software functional modules.

[0117] According to the method provided in the embodiments of this application, this application also provides a computer-readable storage medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the method of any of the embodiments described above.

[0118] As used in this specification, the terms "component," "module," "system," etc., are used to refer to computer-related entities, hardware, firmware, combinations of hardware and software, software, or software in execution. For example, a component can be, but is not limited to, a process running on a processor, a processor, an object, an executable file, an execution thread, a program, and / or a computer. As illustrated, applications running on computing devices and computing devices can both be components. One or more components may reside in a process and / or an execution thread, and components may be located on a single computer and / or distributed among two or more computers. Furthermore, these components can be executed from various computer-readable media on which various data structures are stored. Components can communicate, for example, via local and / or remote processes based on signals having one or more data packets (e.g., data from two components interacting with another component between a local system, a distributed system, and / or a network, such as the Internet interacting with other systems via signals).

[0119] Those skilled in the art will recognize that the various illustrative logical blocks and steps described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementations should not be considered beyond the scope of this application.

[0120] Those skilled in the art will understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.

[0121] In the several embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between apparatuses or units may be electrical, mechanical, or other forms.

[0122] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0123] In addition, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.

[0124] In the above embodiments, the functions of each functional unit can be implemented entirely or partially through software, hardware, firmware, or any combination thereof. When implemented using software, it can be implemented entirely or partially in the form of a computer program product. A computer program product includes one or more computer instructions (programs). When the computer program instructions (programs) are loaded and executed on a computer, all or part of the flow or function according to the embodiments of this application is generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. Computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wired (e.g., coaxial cable, fiber optic, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) means. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that integrates one or more available media. Available media can be magnetic media (e.g., floppy disks, hard disks, magnetic tapes), optical media (e.g., high-density digital video discs (DVDs)), or semiconductor media (e.g., solid-state disks (SSDs)).

[0125] If a function is implemented as a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or a part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods of the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0126] In summary, this application provides a tidal lane-sharing scheduling method, system, and medium for hoists. By statistically analyzing the number of inbound and outbound tasks in the task queue, the current scheduling mode is switched between normal operation mode and tidal lane-sharing mode. In tidal lane-sharing mode, corresponding tickets are issued based on the idle status of the pick-up and drop-off docking positions on the starting floor, and idle drop-off docking positions are locked as the designated drop-off positions. When a task assigned in the original direction initiates a occupancy request, a yielding strategy is determined based on whether the task has already started physical connection, thereby improving the utilization rate of docking resources and cross-floor handling throughput, ensuring physical connection safety and scheduling stability. Therefore, this application effectively overcomes the various shortcomings of existing technologies and has high industrial application value.

[0127] The above embodiments are merely illustrative of the principles and effects of this application and are not intended to limit this application. Any person skilled in the art can modify or alter the above embodiments without departing from the spirit and scope of this application. Therefore, all equivalent modifications or alterations made by those skilled in the art without departing from the spirit and technical concept disclosed in this application should still be covered by the claims of this application.

Claims

1. A tidal borrowing scheduling method for an elevator, applied to a tidal borrowing scheduling system, the tidal borrowing scheduling system being in communication connection with an elevator arranged in a stereoscopic warehouse, the stereoscopic warehouse comprising a plurality of floors, each floor being respectively provided with a pick-up connection position and a drop-off connection position, and the method comprising the steps of: The tidal bypass scheduling method for hoists includes: ​ The system obtains the number of inbound tasks and outbound tasks in the task queue to be assigned, and controls the current scheduling mode to switch between normal working mode and tidal flow mode based on the number of inbound tasks and the number of outbound tasks. The method includes: determining the proportion of inbound tasks and the proportion of outbound tasks based on the number of inbound tasks and the number of outbound tasks; and controlling the current scheduling mode to switch between normal working mode and tidal flow mode based on the proportion of inbound tasks and the proportion of outbound tasks and a preset mode switching rule. If the current scheduling mode is the tidal bypass mode, then determine whether the pickup and transfer position of the starting floor corresponding to the current task to be executed is in an idle state. If the pickup and transfer station on the starting floor corresponding to the current task to be executed is idle, a normal handling ticket is issued to control the hoist to execute the normal handling process; If the pickup docking station on the starting floor corresponding to the current task to be executed is not idle, then it is determined whether the delivery docking station on the same floor is idle. If the delivery docking station on the same floor is idle, then a tidal delivery ticket is issued based on the detour ticket issuance mechanism, and the delivery docking station on the same floor is locked as the delivery location to be borrowed, so as to control the hoist to execute the detour transportation process. The detour ticket issuance mechanism includes a one-way detour constraint mechanism, which allows only one task direction to detour at the same time. During the process of controlling the hoist to perform the borrowing and transportation process, if a task is assigned to the borrowed location in the original direction to initiate an occupation request, the yielding strategy for the current task to be executed is determined based on the hierarchical yielding mechanism. The hierarchical yielding mechanism includes: determining whether the current task to be executed has started physical connection action, and determining the yielding strategy for the current task to be executed based on the determination result.

2. The hoist-oriented tidal borrow scheduling method of claim 1, wherein, The tidal flow mode includes an inbound flow mode and an outbound flow mode; wherein, the preset mode switching rules include any one or more of the following combinations: If the current scheduling mode is normal working mode, and the proportion of the inbound tasks is greater than or equal to the preset bypass entry threshold, then the current scheduling mode will be switched from normal working mode to inbound bypass mode. If the current scheduling mode is normal working mode, and the proportion of outbound tasks is greater than or equal to the preset bypass entry threshold, then the current scheduling mode will be switched from normal working mode to outbound bypass mode. If the current scheduling mode is the inbound detour mode, and the proportion of inbound tasks is less than or equal to the preset detour exit threshold, then the current scheduling mode will be switched from the inbound detour mode to the normal working mode. If the current scheduling mode is outbound bypass mode, and the proportion of outbound tasks is less than or equal to the preset bypass exit threshold, then the current scheduling mode will be switched from outbound bypass mode to normal working mode. If there are no tasks to be executed in the task queue, maintain or switch back to normal working mode.

3. The hoist-oriented tidal borrow scheduling method of claim 2, wherein, The tidal passage tickets include inbound passage tickets and outbound passage tickets; wherein, the one-way passage constraint mechanism includes: If the current scheduling mode is the inbound detour mode, then only inbound detour tickets will be issued; If the current scheduling mode is outbound detour mode, only outbound detour tickets will be issued; Once the borrowed storage location is locked, it is prohibited to assign the borrowed storage location to other pending tasks that require passageway access and have a different type of pending task than the current pending task, until the inbound passageway ticket or outbound passageway ticket expires.

4. The hoist-oriented tidal borrow scheduling method of claim 1, wherein, The mechanism for issuing transit tickets includes a priority enhancement mechanism, which includes: Get the waiting time of the original direction assigned task using the same floor delivery dock and the waiting time of the current task to be executed that needs to borrow a route, and determine the actual priority of the original direction assigned task and the actual priority of the current task to be executed based on the preset time threshold. If the actual priority of the task assigned in the original direction is greater than or equal to the actual priority of the task to be executed, then no tidal passage ticket will be issued. If the actual priority of the task assigned in the original direction is lower than the actual priority of the task to be executed, then a tidal passage ticket will be issued.

5. The hoist-oriented tidal borrow scheduling method of claim 1, wherein, The methods for determining whether a currently pending task has started physical connection operations and, based on the determination result, for determining the yielding strategy for the currently pending task include: If the current task to be executed has not yet started physical connection, the yielding strategy for the current task to be executed is to cancel the tidal passage ticket and release the borrowed cargo space for use by the task to be allocated in the original direction. If the current task to be executed has already started a physical connection action, then the yielding strategy for the current task to be executed is to keep the tidal passage ticket valid, allow the current physical connection action to continue, and release the tidal passage ticket and the borrowed storage space after the current physical connection action is completed.

6. The hoist-oriented tidal borrow scheduling method of claim 1, wherein, Also includes: When exiting the tidal passage mode, the issuance of new tidal passage tickets will be stopped, and the issued and not yet expired tidal passage tickets will be identified as existing passage tickets. Based on the tiered yielding mechanism, a bill convergence operation is performed on the existing borrowing bills. The methods for performing bill convergence operations include: If a request to occupy a task assigned in the original direction is received, and the corresponding task to be executed has not yet started physical connection, then the corresponding existing borrowing tickets will be cancelled and the borrowed storage space will be released. If the physical connection action has already started for the corresponding task to be executed, the corresponding existing borrowing tickets remain valid. After the physical connection action is completed, the existing borrowing tickets and the borrowed storage space are released. If no request to occupy the task assigned in the original direction is received, the corresponding existing borrowing tickets will be released after the corresponding currently pending task completes one borrowing action.

7. The hoist-oriented tidal borrow scheduling method of claim 1, wherein, Also includes: The self-resolved space-occupying scenario handling mechanism includes: During the execution of the original direction allocation task, if it is detected that the cargo delivery docking position of the target floor corresponding to the original direction allocation task is occupied, the hoist is controlled to return to the starting floor corresponding to the original direction allocation task, and the currently carried goods are transferred to the cargo delivery docking position of the starting floor. Then, the hoist is controlled to execute the bypass transport process. After the detour transport process is completed, the hoist is controlled to return to the starting floor corresponding to the original task assignment, retrieve the goods again, and execute the normal transport process.

8. A tidal borrowing scheduling system, characterized by, include: The mode switching module is used to obtain the number of inbound tasks and the number of outbound tasks in the task queue to be assigned, and control the current scheduling mode to switch between normal working mode and tidal bypass mode based on the number of inbound tasks and the number of outbound tasks. The method includes: determining the proportion of inbound tasks and the proportion of outbound tasks based on the number of inbound tasks and the number of outbound tasks; and controlling the current scheduling mode to switch between normal working mode and tidal bypass mode based on the proportion of inbound tasks, the proportion of outbound tasks, and a preset mode switching rule. The resource scheduling module is used to determine whether the pickup docking station on the starting floor corresponding to the current task is idle if the current scheduling mode is the tidal passage mode; if the pickup docking station on the starting floor corresponding to the current task is idle, a normal handling ticket is issued to control the hoist to execute the normal handling process; if the pickup docking station on the starting floor corresponding to the current task is not idle, it determines whether the delivery docking station on the same floor is idle; if the delivery docking station on the same floor is idle, a tidal passage ticket is issued based on the passage ticket issuance mechanism, and the delivery docking station on the same floor is moved to the next floor. The first-floor cargo receiving and receiving position is locked as the borrowed cargo receiving position to control the hoist to execute the borrowing and handling process; the borrowing ticket issuance mechanism includes a one-way borrowing constraint mechanism, which allows only one task direction to borrow the space at any given time; during the process of controlling the hoist to execute the borrowing and handling process, if a task is assigned to the borrowed cargo receiving position in the original direction to initiate an occupation request, the yielding strategy for the current task to be executed is determined based on a hierarchical yielding mechanism; the hierarchical yielding mechanism includes: determining whether the current task to be executed has started physical connection action, and determining the yielding strategy for the current task to be executed based on the determination result.

9. A computer readable storage medium having stored thereon a computer program, characterized in that, When the computer program is executed by the processor, it implements the tidal bypass scheduling method for the hoist as described in any one of claims 1 to 7.