Dynamic luggage reservation virtual window debugging method and system

Abstract

The invention relates to a dynamic luggage reservation virtual window debugging method and system. The scheme comprises the following steps: setting a distance between adjacent luggage; measuring the length of the luggage to be transported; determining the length of a virtual window associated with the luggage according to the measured length of the luggage and a set distance between adjacent luggage; and applying to a system for the luggage to reserve a virtual window of the determined length on the collection conveyor. The method further comprises the following steps: dynamically adjusting check-in channel reservation virtual window time; the time for moving from the starting position to the putting position of the transition conveyor is dynamically adjusted by changing the starting position of the check-in channel reservation virtual window, and the time for completely putting luggage on the transition conveyor is dynamically adjusted by changing the conveying speed of the check-in channel transition conveyor.

Description

Technical Field

[0001] The present application relates to the field of airport terminal baggage sorting system reservation, and in particular to a dynamic baggage reservation virtual window debugging method and system. Background Art

[0002] In airport check-in areas, check-in islands consist of multiple check-in counters. Each counter includes a check-in counter, an adjacent check-in conveyor for checked baggage, and a take-away conveyor in the back, which transports checked baggage to the sorting area. The check-in conveyor consists of three sections: weighing, security screening, and inbound conveyors. Airport check-in counters are typically uniform in size and spacing, and are typically fixed once the layout is complete.

[0003] When passengers check in and check in at the check-in counters on the island, their baggage must be transported from the counters to the sorting area. Baggage received by the check-in conveyor at the check-in counter undergoes weighing and security screening before being transported to the sorting area via the induction conveyor and take-away conveyor. Because multiple check-in counters often check baggage simultaneously on the island, a (virtual) baggage window reservation mechanism is typically implemented to avoid conflicts during baggage transportation. Specifically, each piece of baggage is weighed and screened before being transported on the induction conveyor to the baggage window waiting area to wait for its reserved window. Only after arriving at the reserved window is the baggage allowed onto the take-away conveyor for further transportation and processing. This technology, known as "windowing" in the baggage handling system, prevents collisions and stacking of baggage on the take-away conveyor.

[0004] In traditional check-in counter technology, baggage check-in counter applications are generally processed on a first-come, first-served basis. However, this principle can lead to varying check-in efficiency at each check-in counter due to factors such as the uneven number of check-in counters available per unit time. In particular, check-in lanes further downstream experience lower efficiency.

[0005] Many people have tried to improve the existing baggage conveying mechanism of the baggage handling system of the check-in counter to improve the channel efficiency.

[0006] For example, patent document CN 115860367 A discloses a debugging method for balanced window allocation on a baggage collection line. The method is used to schedule multiple baggage window waiting areas on a transition conveyor, allocating windows to each baggage window waiting area within each window application interval. After the window allocation, the baggage on the baggage window waiting area enters the collection conveyor for subsequent processing, with the collection conveyor transporting the baggage from the first end to the second end. Specifically, the debugging method includes the following steps: dividing the multiple baggage window waiting areas into two areas along a dividing line: a first window waiting area and a second window waiting area; the first window waiting area is located near the first end of the collection conveyor, and the second window waiting area is located near the second end of the collection conveyor; allocating windows to the baggage window waiting areas in the first window waiting area using an alternating odd-even window allocation method to reserve free windows for the baggage window waiting areas in the second window waiting area; and allocating the free windows to the baggage window waiting areas in the second window waiting area. This method can achieve more balanced window allocation, thereby improving check-in efficiency at the counter.

[0007] However, in the aforementioned patent document, to ensure uniform check-in efficiency at all check-in counters along a check-in island, that is, to ensure that bags checked in at each check-in lane are delivered to the subsequent take-away conveyor with equal probability, the virtual window length of each check-in lane is fixed. Since the virtual window length for a shorter bag is the same as that for a longer bag, this reduces the efficiency of the take-away conveyor, leading to lower processing efficiency at the check-in lane and increased passenger check-in wait times.

[0008] Therefore, there is a demand for providing a more flexible and efficient dynamic baggage reservation virtual window debugging mechanism. Summary of the Invention

[0009] According to a first aspect of the present application, a method for dynamically debugging a baggage reservation virtual window is provided, comprising:

[0010] Set the distance between adjacent bags;

[0011] Measuring the length of luggage awaiting transport;

[0012] determining a length of a virtual window associated with the bag based on the measured length of the bag and a set distance between adjacent bags; and

[0013] A virtual window with a determined length on the take-away conveyor is requested to be reserved for the baggage from the system.

[0014] According to a second aspect of the present application, a system for dynamically debugging a baggage reservation virtual window is provided, comprising:

[0015] The reservation virtual window length adjustment module is configured to dynamically adjust the length of the corresponding reservation virtual window according to the length of the luggage waiting to be transported. The reservation virtual window length adjustment module includes:

[0016] a baggage length detector configured to measure the length of baggage waiting for transportation at each check-in counter;

[0017] an adjacent baggage distance detector configured to measure the distance between the baggage and adjacent baggage, and

[0018] The first processor is configured to determine a length of a reservation virtual window at a corresponding baggage window waiting end based on the length of the baggage at each check-in counter and the distance between the baggage and adjacent baggage.

[0019] This Summary is provided to introduce some concepts in a simplified form that are further described below in the Detailed Description. This Summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter. BRIEF DESCRIPTION OF THE DRAWINGS

[0020] To illustrate the manner in which the above-recited and other advantages and features of the present invention can be obtained, a more particular description of the invention briefly described above will be rendered by reference to specific embodiments of the invention that are illustrated in the accompanying drawings. Understanding that these drawings depict only typical embodiments of the invention and are not therefore to be considered limiting of its scope, the invention will be described and explained with additional specificity and detail through the use of the accompanying drawings, in which:

[0021] Figure 1 A schematic diagram showing the equal division of a baggage virtual window on a conventional baggage collection conveyor belt is shown.

[0022] Figure 2 A schematic diagram of dynamic row division of a virtual window of a collecting conveyor belt according to an embodiment of the present application is shown.

[0023] Figure 3 A partial schematic flow chart of a method for dynamically debugging a baggage reservation virtual window according to an embodiment of the present application is shown.

[0024] Figure 4 A schematic structural diagram of a system for dynamically debugging a baggage reservation virtual window according to an embodiment of the present application is shown.

[0025] Figure 5 A schematic structural diagram of a virtual luggage reservation window length adjustment module in a system for dynamically debugging a virtual luggage reservation window according to an embodiment of the present application is shown.

[0026] Figure 6 A schematic structural diagram of a check-in channel reservation virtual window time adjustment module in a system for dynamically debugging a baggage reservation virtual window according to an embodiment of the present application is shown.

[0027] Figure 7 A schematic structural diagram of a check-in channel reservation virtual window starting position adjustment module in a system for dynamically debugging a baggage reservation virtual window according to an embodiment of the present application is shown.

[0028] Figure 8 A schematic structural diagram of a check-in channel transition conveyor conveying speed adjustment module in a system for dynamically debugging a baggage reservation virtual window according to an embodiment of the present application is shown. DETAILED DESCRIPTION

[0029] In this application, to overcome the various drawbacks of existing virtual baggage reservation windows, which typically have fixed virtual baggage reservation windows for each piece of luggage, a dynamic virtual baggage reservation window adjustment mechanism is proposed. Overall, this dynamic virtual baggage reservation window adjustment mechanism not only dynamically adjusts the length of the corresponding virtual baggage reservation window based on the length of each piece of luggage, but also periodically adjusts the virtual baggage reservation window times, the starting positions of the virtual baggage reservation windows, and the conveyor speeds of the transition conveyors at various check-in lanes during different time periods based on the actual busyness of each check-in counter on the check-in island. This maximizes check-in lane efficiency and reduces passenger waiting time.

[0030] Before describing the solution of the present application, the basic principle of determining the length of the virtual window is first understood by explaining the traditional baggage reservation virtual window technology.

[0031] like Figure 1 As shown in FIG, the traditional baggage reservation virtual window technology divides the collection conveyor belt into several windows of length L. Figure 1 In the figure, the check-in conveyors corresponding to the ten counters are shown. According to the traditional industry layout, these counters are placed in groups of two along the running direction of the baggage collection conveyor, that is, (check-in conveyor 1 + service counter 1 + service counter 2 + check-in conveyor 2) + (check-in conveyor 3 + service counter 3 + service counter 4 + check-in conveyor 4) ... and so on. It should be understood that the service counter is not the focus of this application, so in Figure 1 Only the check-in conveyors are shown, and the blank spaces between them are the service counters. In traditional baggage reservation virtual window technology, one virtual window is generally assigned to a group of counters (i.e., two service counters + two check-in conveyors).

[0032] In reality, there could be more counters and windows, but they are not shown for simplicity. It should be understood that the counter layout shown is for illustrative purposes only and is not intended to be limiting. Layouts with more or fewer counters can also apply the solutions of this application and fall within the scope of protection of this application.

[0033] For this equal division scheme, the efficiency of the collection conveyor can be quantitatively analyzed as follows:

[0034] Assume that as the collection conveyor belt moves forward, the full efficiency of the collection conveyor belt in unit time T is that there is one piece of luggage in each window of length L, where the length L must meet the maximum standard luggage specifications. According to the regulations of the Civil Aviation Administration, the maximum standard luggage specifications (a max ) is generally 1 meter. Figure 1 The equal-division length L of the traditional virtual window is the width of a group of counters (i.e., two service counters + two check-in conveyors), which is generally more than 3 meters.

[0035] Therefore, when the speed of the collection conveyor is fixed at V, the efficiency of the collection conveyor is .

[0036] From the above explanation, it can be understood that since the width of the two check-in conveyors plus the width of the two service counters is much larger than the maximum standard baggage specifications, and in actual operation, most of the luggage does not meet this maximum standard baggage specifications, a large part of the window length L is empty during transportation, resulting in low efficiency of the take-away conveyor.

[0037] To overcome these shortcomings, we propose a dynamic baggage reservation virtual window technology. In this technology, the length L of each virtual window is no longer fixed, but virtual windows of different lengths are dynamically reserved according to different baggage lengths.

[0038] Specifically, as in Figure 2 As shown, in the solution of the present application, the length L1 of the virtual window is set to the sum of the length a of the luggage and the distance b between adjacent luggage, that is:

[0039] L1= a + b.

[0040] Since the length of each piece of luggage to be transported is different, the L1 of the virtual window is also dynamically adjusted according to the actual length of the luggage.

[0041] According to the regulations of the Civil Aviation Administration, the minimum length of checked baggage is min is 25 cm, and the maximum length a max is 1 meter, so the value range of a is generally between 25 centimeters and 1 meter.

[0042] However, the spacing b between adjacent pieces of luggage is not clearly defined in the industry and mainly depends on the sorting equipment in the subsequent process. That is, in actual applications, it is set according to the performance of the sorting equipment. The performance of the sorting equipment in different projects is different, and the general value range is 30 cm - 80 cm.

[0043] Since the length a of each piece of luggage must be less than or equal to a max , and the spacing b between adjacent pieces of luggage is within the range of 30 cm - 80 cm. Therefore, the range of L1 is generally between 55 cm and 180 cm, which is much smaller than more than 3 meters of L. In particular, for luggage with a shorter length, the length L1 of the virtual window for reservation application is smaller. Thus, the number of windows that can be divided by the length of the collection conveyor belt is more, which means that the number of pieces of luggage that can be transported simultaneously is more.

[0044] Therefore, the efficiency of the collection conveyor using the dynamic debugging luggage reservation virtual window technology of the present application is . Since L1 < L, this technology can significantly improve the operating efficiency of the collection conveyor.

[0045] Accordingly, in Figure 3 is disclosed a schematic flowchart of a part (processing 1) for dynamically adjusting the length of the reservation virtual window of a method for dynamically debugging the luggage reservation virtual window according to an embodiment of the present application.

[0046] As shown in the figure, first, at step 310, before running the luggage sorting system, the staff sets the distance b between adjacent pieces of luggage according to the performance of the sorting equipment. Once set, as long as the sorting equipment is not updated, this distance b does not need to be changed. That is, in the subsequent operation of the luggage sorting system, this step does not need to be executed again.

[0047] Next, at step 320, when the check-in counter receives the checked luggage, the length a of the luggage waiting for transportation is measured. This can be achieved by a luggage length sensor installed above the transfer conveyor.

[0048] Subsequently, at step 330, according to the measured length a of the luggage and the set distance b between adjacent pieces of luggage, the length L1 of the virtual window associated with this luggage is determined, where L1 = a + b.

[0049] Next, at step 340, an application is made to the system for reserving a virtual window with a length L1 on the collection conveyor for this piece of luggage.

[0050] Subsequently, at step 350, this piece of luggage waits at the rear end (i.e., the waiting end) of the transfer conveyor for the arrival of the reserved virtual window.

[0051] Finally, at step 360 , when the reserved virtual window on the take-away conveyor reaches the rear end of the induction conveyor, the baggage is allowed to enter the take-away conveyor for subsequent conveyance and processing.

[0052] In this way, by dynamically adjusting the length of the corresponding reserved virtual window according to the actual length of the luggage waiting to be transported, the present application can divide more virtual windows on the same collection conveyor belt and transport more pieces of luggage at the same time, significantly improving the transportation efficiency of the collection conveyor belt.

[0053] In order to further improve the conveying efficiency of the collection conveyor belt, in addition to dynamically adjusting the length of the reservation virtual window (process 1), the method of dynamically debugging the baggage reservation virtual window of the present application can further provide more debugging means. For example, dynamically adjusting the check-in channel reservation virtual window time (T c1 , Processing 2), by changing the starting position of the virtual window for check-in channel reservation to dynamically adjust the time (T c2 , process 3) and dynamically adjust the time (T) for baggage to be completely dropped on the transition conveyor by changing the conveying speed of the transition conveyor of the check-in channel. c3 , process 4).

[0054] First, assuming that the time it takes for a piece of baggage to enter the security inspection machine and be released is T, this time can be broken down into three parts. The first part is the time it takes for the baggage to enter the security inspection machine and reach the photoelectric position of the transition conveyor, T a The second part is the waiting time for the security inspection machine to judge the image T b The third part is the time T from receiving the image recognition signal from the security inspection machine to the time when the luggage is completely put away. c .

[0055] Right now:

[0056] Due to T a , T b The two values ​​are relatively fixed during actual use at the same airport, so the debugging method of this application is only for T c The value of is improved, that is, the debugging method of the present application only further optimizes the period from receiving the image judgment signal from the security inspection machine to the complete delivery of the luggage.

[0057] And T c It can also be decomposed into three parts. The first part is the time from receiving the image recognition signal from the security inspection machine to starting the reservation of the virtual window, hereinafter referred to as the reservation virtual window time T c1 The second part is the time T from the starting position of the appointment virtual window to the position where the transition conveyor can be placed c2The third part is the time T when the baggage is completely put on the transition conveyor. c3 .

[0058] Right now:

[0059] Targeting T c1 、T c2 、T c3 For these three time periods, the debugging method of this application provides corresponding optimization processes respectively.

[0060] However, it should be understood that before executing the optimization process, the system will first determine whether the airport is entering peak hours based on the number of flights or baggage handled at the same check-in island during different time periods. Since check-in numbers are low when flights are not very busy, people will automatically queue at less crowded counters. Therefore, the effect of the further optimization process during off-peak hours is limited. Therefore, processes 2-4 of the method of this application are generally not invoked during off-peak hours, and the default values ​​are directly used. However, this does not mean that these subsequent optimization processes cannot be used during off-peak hours; it simply means that the optimization effect after use is not proportional to the cost.

[0061] When the airport enters the peak period, first, the time T from receiving the image judgment signal from the security inspection machine to starting to reserve the virtual window is calculated. c1 Based on the optimization, a mechanism is proposed to dynamically adjust the corresponding check-in channel reservation virtual window time according to the number of baggage handled by each check-in counter, namely processing 2.

[0062] Specifically, the existing virtual window technology has fixed appointment times, meaning each check-in channel has a fixed virtual window appointment time during different time periods. However, in reality, due to peak and off-peak flight times, the number of checked bags handled at different check-in channels at the same check-in island during the same time period can vary significantly. Similarly, the number of checked bags handled at the same check-in channel at the same check-in island during different time periods can also vary significantly.

[0063] Therefore, the dynamic baggage reservation virtual window technology of this application can dynamically adjust the lane reservation virtual window time, thereby reducing the difference in the number of bags handled at different check-in lanes on the same check-in island within a predetermined time period (e.g., half-hour units) during peak hours, thereby alleviating the problem of varying passenger waiting times due to different check-in counter efficiency. As previously mentioned, in actual operation, different check-in counters handle different amounts of baggage (especially during peak hours, where this difference is more pronounced). To reduce this difference, the reservation virtual window time for a single piece of baggage at a check-in counter with a smaller number of bags, from the time it enters the security check machine to the time it is released, needs to be shortened.

[0064] Understandably, the low number of bags handled is due to the long processing time per bag at that check-in counter. The reality is that if every check-in counter operates at full efficiency, without dynamic time adjustments, the check-in counters closer to the upstream of the take-away conveyor will have a shorter processing time per bag, resulting in a significant discrepancy between the number of bags handled by downstream check-in counters and those handled by upstream check-in counters. Therefore, to reduce this discrepancy in processing volume, it's necessary to shorten the virtual window time between bags entering the security checkpoint and being released at downstream check-in counters, thereby increasing their handling volume.

[0065] In this embodiment, the predetermined time period is set to half-hour units. It should be understood that this "half-hour" is provided for illustrative purposes only; longer or shorter units are also feasible and fall within the scope of this art. For example, during extremely busy times (such as holidays), the predetermined time period could be set to 15 minutes to further improve baggage handling efficiency.

[0066] The ideal optimization result is that within a half-hour period, the difference in the number of bags handled at different check-in lanes on the same check-in island is less than 5%. However, achieving this goal may require multiple optimizations.

[0067] In order to achieve the above goals, in this embodiment, it is assumed that within a half-hour time period, the time T of the unit luggage at different check-in counters from entering the security inspection machine to being put away is

[0068] 1. The maximum value (i.e. the check-in counter that handles the least luggage) is T max ;

[0069] 2. The minimum value (i.e. the check-in counter that handles the most luggage) is T min ;

[0070] 3. The average value is .

[0071] Then, the scheduled virtual window time T to be adjusted for the check-in channel with less luggage (for example, less than the average) in process 2 c1 The ideal change is , and the new appointment virtual window time of the check-in channel is calculated as .

[0072] However, in actual application, we found that the new appointment virtual window time T in this debugging method c1 In practice, it cannot be less than half of the initial value, that is, This is because in actual operation, if the new appointment virtual window time is adjusted to less than If you miss this time, you may not be able to make an appointment at the window. The main reason is that due to the design performance and safety requirements of the baggage handling system, unilaterally and significantly adjusting a parameter is only theoretically possible and difficult to achieve in practice.

[0073] Therefore, in the actual operation process, T c1 The adjustment is divided into two cases:

[0074] Case 1: Ideal change Less than or equal to , so the new appointment virtual window time is changed to In this case, there is no need to perform subsequent steps 3 and 4.

[0075] The second case: ideal change Greater than Therefore, the new appointment virtual window time can only be changed to At this point, because the reduced time does not meet the ideal change, process 2 only partially optimizes the difference in the number of bags handled at each counter. Subsequent processes 3 and 4 are needed to further optimize other aspects.

[0076] Process 3: Dynamically adjust the time T from the starting position to the transfer conveyor available position by changing the starting position of the virtual window for check-in channel reservation c2 .

[0077] The original virtual window technology has a fixed starting position for the reservation virtual window, and the relative distance between each check-in channel and its reservation virtual window is fixed.

[0078] However, when the second situation occurs in process 2, in order to further optimize, the dynamic baggage reservation virtual window technology of the present application can change the time T from the starting position to the position where the transition conveyor can be dropped by dynamically adjusting the starting position of the channel reservation virtual window. c2 , thereby further eliminating the difference in the number of baggage handled by different check-in channels in process 2.

[0079] Specifically, based on the actual installation location on site, it is assumed that the location of different check-in channels is fixed at a distance of L from the downstream exit of the collection belt conveyor line. x The initial reservation virtual window starting position is L away from the downstream exit of the collection belt conveyor line. y The running speed of the collection belt conveyor is V, and the time from the starting position of the appointment virtual window to the position where the transition conveyor can be placed is ,

[0080] Among them, if the second situation in treatment 2 occurs, that is, T c1The change in does not satisfy the ideal change, that is, Greater than In order to ensure the success of the reservation, the new T c1 Forced to be At this point, the new T, which should have been optimized even more c1 In fact, only optimized The remaining parts are not optimized. These remaining parts to be optimized can be expressed as .

[0081] It can be seen that T in treatment 3 c2 The ideal change is to digest these remaining parts to be optimized, that is, .

[0082] According to the above formula, we can get: L y The corresponding ideal change , from which we can calculate that the starting position of the new reservation virtual window of the check-in channel is .

[0083] In theory, when the virtual window start position is changed to The time T for the baggage to move from the new starting position to the position where the transition conveyor can be placed is c2 The change in T is just enough to completely digest the remaining parts to be optimized in process 2, thus obtaining the best T c Value (ie T c minimum value).

[0084] However, for the same reason as in Process 2, in actual operation on site, if the starting position of the new reservation virtual window is adjusted to be less than half of the initial value position difference, that is, , it may lead to the problem of not being able to make an appointment at the window. Therefore, in the actual operation process, T c2 The adjustment can be divided into two cases:

[0085] Case 1: Ideal change Less than or equal to When , the starting position of the new reservation virtual window changes to , and subsequent processing 4 does not need to be performed.

[0086] The second case: ideal change Greater than When Can only take , so that the corresponding new reservation virtual window starting position changes to At the same time, because the time reduced by the starting position change still does not meet the ideal change amount, process 4 needs to be executed.

[0087] Process 4: Dynamically adjust the time T for baggage to be completely dropped on the transition conveyor by changing the conveying speed of the transition conveyor at the check-in channel. c3 .

[0088] The conveying speed of the transition conveyor in the original virtual window technology is fixed, which results in different times for baggage of different lengths to be fully placed in their reserved windows.

[0089] If the time it takes for bags to be fully delivered to their designated check-in windows at different check-in lanes can be kept as consistent as possible, the differences in check-in lane efficiency caused by baggage length can be reduced. Therefore, the dynamic baggage reservation virtual window technology of this application can further improve efficiency by dynamically adjusting the conveyor speed of the check-in lane transition conveyor based on the optimization of processes 2 and 3.

[0090] For process 4, it mainly changes the time T for the baggage to be completely dropped on the induction conveyor by changing the conveying speed of the induction conveyor. c3 Specifically, the processing includes:

[0091] Assume that the initial transition conveyor conveying speed is V A , the luggage length is L A Therefore, the time it takes for the baggage to be completely dropped on the induction conveyor is ,

[0092] If the second situation occurs in treatment 3, that is, T c2 The change amount does not meet the ideal change amount In order to ensure a successful reservation, Forced to be At this point, the new T, which should have been optimized even more c2 In fact, only part of it is optimized. The rest of it is not optimized. These remaining parts to be optimized can be expressed as .

[0093] It can be seen that in process 4 The ideal change is to digest these remaining parts to be optimized, that is, .

[0094] According to the above formula, the ideal change in the conveying speed of the corresponding transition conveyor is:

[0095] ;

[0096] Therefore, the conveying speed of the new transition conveyor of the check-in channel can be calculated as:

[0097] ;

[0098] Among them, V A is the initial transition conveyor speed, L A is the luggage length

[0099] Because the baggage reservation virtual window dynamic debugging technology of the present application has already undergone two rounds of baggage quantity difference optimization in processes 2 and 3 before executing process 4, in actual application, the remaining baggage quantity difference to be optimized is actually very small. This results in a very small change rate of the indirect conveyor conveying speed, and there is no need to discuss restrictions on a case-by-case basis.

[0100] It should be understood that process 1 is performed when all check-in counters are operating, and therefore, the length of the reservation virtual window for each piece of luggage processed by each check-in counter is different.

[0101] On the other hand, as previously mentioned, processes 2-4 are generally only performed during peak hours. In a preferred embodiment, the method for dynamically debugging the virtual baggage reservation window may further include, after determining that the airport has entered peak hours, calculating an average number of baggage handled by each check-in counter, and then performing processes 2-4 only for check-in counters whose baggage handling figures fall below this average. After a predetermined time interval (e.g., ten minutes), the method rechecks the average number of baggage handled, and then performs processes 2-4 again for check-in counters whose baggage handling figures fall below this average, and so on, until the airport passes the peak hours. After the peak hours have passed, the various virtual baggage reservation window data (reservation time, starting location, and conveying speed) for all check-in counters returns to their initial values, and processes 2-4 are no longer performed, saving resources and costs.

[0102] According to the actual project debugging results, after continuously executing processes 2-4, during the peak period, the difference in the number of baggage handled by different check-in channels on the same check-in island can be less than 5%.

[0103] As described above, the dynamic baggage reservation virtual window technology of the present application not only improves the baggage conveying efficiency of the collection conveyor belt, but also balances the baggage handling quantity of each check-in counter, thereby reducing the passenger check-in waiting time.

[0104] At the same time, Figure 4 2 shows a schematic structural diagram of a system for dynamically debugging a baggage reservation virtual window according to an embodiment of the present application.

[0105] As shown in the figure, the system includes a virtual reservation window length adjustment module 410, a check-in channel virtual reservation window time adjustment module 420, a check-in channel virtual reservation window starting position adjustment module 430, a check-in channel transition conveyor speed adjustment module 440, a baggage quantity counting module 450, and a processor 460. These modules are connected to each other and exchange data through various wired and wireless communication technologies.

[0106] The baggage quantity statistics module 450 is configured to count the quantity of baggage handled by each check-in channel and provide the counted quantity to each processor.

[0107] Among them, Figure 5 As shown, the reservation virtual window length adjustment module 410 is configured to dynamically adjust the length of the corresponding reservation virtual window according to the actual length of the luggage waiting to be transported, which includes:

[0108] The baggage length detector 412 is configured to measure the length of the baggage waiting for transportation at each check-in counter.

[0109] an adjacent baggage distance detector 414 configured to measure the distance between the baggage and adjacent baggage, and

[0110] The first processor 416 is configured to determine the length of a virtual window at a corresponding baggage window waiting end based on the length of the baggage at each check-in counter and the distance between the baggage and adjacent baggage, and to allow the baggage to enter a take-away conveyor for subsequent conveyance and processing when the scheduled virtual window time of the virtual window is reached.

[0111] In this way, by dynamically adjusting the length of the corresponding reservation virtual window through the reservation virtual window length adjustment module 410, the present application can divide more virtual windows on the same collection conveyor belt and convey more pieces of luggage at the same time, thereby significantly improving the conveying efficiency of the collection conveyor belt.

[0112] In addition, the system also provides more optimization modules to further optimize the conveying efficiency of the collection conveyor belt.

[0113] Specifically, when the processor 460 determines that the airport has entered the peak period based on the number of flights or the baggage statistics provided by the baggage quantity statistics module 450, it will further start the check-in channel reservation virtual window time adjustment module 420, the check-in channel reservation virtual window starting position adjustment module 430 and the check-in channel transition conveyor conveying speed adjustment module 440 as needed to further optimize the conveying efficiency.

[0114] Among them, Figure 6As shown, the check-in channel reservation virtual window time adjustment module 420 is configured to dynamically adjust the corresponding check-in channel reservation virtual window time T according to the number of baggage processed by each check-in counter within a predetermined time period (e.g., half an hour). c1 , which includes:

[0115] The time detection module 422 is configured to detect the time T of each check-in counter's unit luggage from entering the security inspection machine to being put away, and

[0116] The second processor 424 is configured to dynamically adjust the virtual window time T for check-in channel reservation for handling a small number of baggage (less than the average) according to the detected time T. c1 .

[0117] Among them, the virtual window time T of the check-in channel with less luggage is dynamically adjusted according to the detected time T. c1 Specifically include:

[0118] The maximum value T of the time T is determined based on the time T of the unit luggage of each check-in counter from entering the security inspection machine to being put away, which is detected by the time detection module 422. max , minimum value T min and the average .

[0119] Judgment time T c1 The ideal change Is it greater than :

[0120] If the ideal change Less than or equal to , then the new appointment virtual window time T c1 was changed to ,

[0121] If the ideal change Greater than , then the new appointment virtual window time T c1 was changed to , and at the same time start the check-in channel reservation virtual window starting position adjustment module 430.

[0122] like Figure 7 As shown, the check-in channel reservation virtual window starting position adjustment module 430 is configured to dynamically adjust the time T from the starting position to the transition conveyor drop-in position by changing the starting position of the check-in channel reservation virtual window. c2 , which includes:

[0123] The position distance determination module 432 is configured to determine the distance L between the position of the check-in channel and the position of the downstream exit of the collection belt conveyor line. x , and the distance L between the initial reservation virtual window starting position of the check-in channel and the downstream exit position of the collection belt conveyor line y .

[0124] The starting position controller 434 is configured to adjust the starting position of the check-in channel reservation virtual window accordingly according to the position control instruction.

[0125] The third processor 436 is configured to calculate the time T from the starting position to the position where the induction conveyor can be placed. c2 The ideal change , and generate corresponding position control instructions accordingly.

[0126] The time T for moving from the starting position to the position where the transition conveyor can be placed is dynamically adjusted by changing the starting position of the virtual window for booking the check-in channel. c2 include:

[0127] Judgment time T c2 The ideal change Is it greater than , where V is the running speed of the collection belt conveyor:

[0128] If the ideal change Less than or equal to , then the starting position of the new reservation virtual window changes to ,

[0129] If the ideal change Greater than , then the starting position of the new reservation virtual window changes to , and at the same time start the check-in channel transition conveyor conveying speed adjustment module 440.

[0130] like Figure 8 As shown, the check-in channel transition conveyor conveying speed adjustment module 440 is configured to dynamically adjust the time T for the baggage to be completely dropped on the transition conveyor by changing the conveying speed of the check-in channel transition conveyor. c3 , which includes:

[0131] an infeed conveyor conveying speed controller 442 configured to adjust the conveying speed of the infeed conveyor according to the speed control instruction; and

[0132] The fourth processor 444 is configured to calculate the time T when the baggage is completely dropped on the induction conveyor. c3 The ideal change , and generate corresponding speed control instructions accordingly.

[0133] Among them, the time T for the baggage to be completely put on the transition conveyor is dynamically adjusted by changing the conveying speed of the transition conveyor of the check-in channel. c3 include:

[0134] Calculate the time T according to the following formula c3 The ideal change is:

[0135] ,

[0136] Then, the ideal change in the corresponding transition conveyor speed is calculated according to the following formula:

[0137] ;

[0138] Finally, the new transition conveyor speed of the check-in channel is calculated as:

[0139] ;

[0140] Among them, V A is the initial transition conveyor speed, L A is the luggage length.

[0141] Based on this, the transition conveyor conveying speed controller 442 can adjust the conveying speed of the check-in channel transition conveyor accordingly.

[0142] The processor 460 is configured to determine whether the airport is in a peak period according to the number of flights or the number of bags from the baggage number statistics module 450, and if the airport is in a peak period, calculate the average number of bags handled by each check-in counter.

[0143] If it is determined that the airport is in peak period, the processor 460 starts the check-in channel reservation virtual window time adjustment module 420 for further optimization. Otherwise, the check-in channel reservation virtual window time adjustment module 420 is not started.

[0144] Based on the calculated average baggage quantity, the processor 460 can further determine which check-in counters require further optimization. For example, the processor 460 can assign check-in counters that handle baggage quantities lower than the average baggage quantity to the check-in channel reservation virtual window time adjustment module 420 for further optimization.

[0145] In summary, the method and system for dynamically debugging the baggage reservation virtual window of the present application improves the baggage handling efficiency of the check-in channel by dynamically adjusting the length, time, starting position and conveying speed of the transition conveyor of the reservation virtual window, thereby reducing the processing cost and time of the airport, improving the passenger check-in experience and reducing their check-in waiting time.

[0146] It should be understood that the various modules and processors described above can actually be implemented using various existing sensors, detectors, processors or through programming.

[0147] Although the techniques have been described in language specific to structural features and / or methodological acts, it should be understood that the appended claims are not necessarily limited to the described features or acts. Rather, these features and acts are described as example forms of implementing the techniques.

[0148] The operations of the example processes are shown in separate blocks and are summarized with reference to these blocks. These processes are illustrated as a flow of logical blocks, each of which may represent one or more operations that can be implemented using hardware, software, or a combination thereof. In the context of software, these operations represent computer-executable instructions stored on one or more computer-readable media that, when executed by one or more processors, cause the one or more processors to perform the specified operations. Generally speaking, computer-executable instructions include routines, programs, objects, modules, components, data structures, etc. that perform specific functions or implement specific abstract data types. The order in which the operations are described is not intended to be construed as limiting, and any number of the described operations may be performed in any order, combined in any order, subdivided into multiple sub-operations, and / or performed in parallel to implement the described processes. The described processes may be performed by resources associated with one or more computing devices (such as one or more internal or external CPUs or GPUs) and / or one or more pieces of hardware logic (such as FPGAs, DSPs, or other types of accelerators).

[0149] All of the above methods and processes can be embodied in software code modules executed by one or more general-purpose computers or processors, and can be fully automated via these software code modules. These code modules can be stored in any type of computer-executable storage medium or other computer storage device. These codes can also be packaged into corresponding computer program products. Some or all of these methods can alternatively be embodied in dedicated computer hardware.

[0150] Any routine description, element or box in the flowcharts described herein and / or in the accompanying drawings should be understood to potentially represent a module, segment or portion of code including one or more executable instructions for implementing the specific logical functions or elements in the routine. Alternative implementations are included within the scope of the examples described herein, in which various elements or functions may be deleted, or executed inconsistently with the order shown or discussed, including substantially synchronously or in reverse order, depending on the functions involved, as will be understood by those skilled in the art.

[0151] Although various embodiments have been described above, it should be understood that they are intended to be illustrative only and not limiting. Persons skilled in the relevant art(s) will appreciate that various changes in form and details may be made without departing from the spirit and scope of the present invention as defined by the appended claims. Therefore, the breadth and scope of the present invention disclosed herein should not be limited by the exemplary embodiments disclosed above, but should be defined only in accordance with the following claims and their equivalents.

Claims

1. A method for dynamically debugging a baggage reservation virtual window, comprising: Set the distance between adjacent bags; Measuring the length of luggage awaiting transport; determining a length of a virtual window associated with the baggage according to the measured length of the baggage and a set distance between adjacent bags; as well as A virtual window with a determined length on the take-away conveyor is requested to be reserved for the baggage from the system.

2. The method according to claim 1, wherein Determining the length of the virtual window associated with the luggage according to the measured length of the luggage and the set distance between adjacent luggage includes: The length of the virtual window is set to the sum of the length of the luggage and the distance between the adjacent luggage.

3. The method according to claim 1, wherein When the airport is at peak hours, the method further includes: dynamically adjusting the virtual window time T for check-in channel reservation c1 ,include: Count the number of baggage handled at each check-in channel; Detect the time T from the time the luggage at each check-in counter enters the security check machine to the time it is put away, and Dynamically adjust the virtual window time T for the check-in channel with a small number of luggage according to the detected time T c1 ,include: Determine the maximum value T of the time T max , minimum value T min and the average ; Determine the time T c1 The ideal change Is it greater than : If the ideal change Less than or equal to , the new appointment virtual window time is changed to , If the ideal change Greater than , the new appointment virtual window time is changed to , and execute the processing of dynamically adjusting the starting position of the check-in channel reservation virtual window.

4. The method according to claim 3, wherein It also includes dynamically adjusting the time T of moving from the starting position to the transfer conveyor available position by changing the starting position of the virtual window for check-in channel reservation. c2 ,include: Determine the distance L between the check-in channel and the downstream exit of the collection belt conveyor line x The distance L between the initial reservation virtual window starting position of the check-in channel and the downstream exit of the collection belt conveyor line y , and the running speed V of the collection belt conveyor; Determine the time T c2 The ideal change Is it greater than : If the ideal change Less than or equal to , then the starting position of the new reservation virtual window changes to , If the ideal change Greater than , then the starting position of the new reservation virtual window changes to , and performs processing to dynamically adjust the conveying speed of the check-in channel transition conveyor.

5. The method according to claim 4, wherein It also includes dynamically adjusting the time T for the baggage to be completely dropped on the transition conveyor by changing the conveying speed of the transition conveyor of the check-in channel. c3 ,include: Calculate the time T for the baggage to be completely dropped onto the induction conveyor according to the following formula c3 The ideal change : ， Then, the ideal change in the corresponding transition conveyor speed is calculated according to the following formula: ; The new transition conveyor speed of the check-in channel is calculated as follows: ； Among them, V A is the initial transition conveyor speed, L A is the luggage length.

6. The method according to claim 3, wherein Determine when an airport is at peak times based on the number of flights or the total number of bags handled at all check-in counters, and When the airport is at peak hours, the average number of baggage handled by each check-in counter is calculated, and the step of dynamically adjusting the virtual window time for check-in channel reservation is performed only for check-in counters whose baggage handled number is lower than the average number of baggage.

7. A system for dynamically debugging a baggage reservation virtual window, comprising: The reservation virtual window length adjustment module is configured to dynamically adjust the length of the corresponding reservation virtual window according to the length of the luggage waiting to be transported. The reservation virtual window length adjustment module includes: a baggage length detector configured to measure the length of baggage waiting for transportation at each check-in counter; an adjacent baggage distance detector configured to measure the distance between the baggage and adjacent baggage, and The first processor is configured to determine a length of a reservation virtual window at a corresponding baggage window waiting end based on the length of the baggage at each check-in counter and the distance between the baggage and adjacent baggage.

8. The system according to claim 7, wherein: Also includes: The baggage quantity statistics module is configured to count the quantity of baggage handled by each check-in channel and provide the counted quantity to the processor.

9. The system according to claim 8, wherein Also includes: The check-in channel reservation virtual window time adjustment module is configured to dynamically adjust the corresponding check-in channel reservation virtual window time T according to the number of baggage processed by each check-in counter within a predetermined time period. c1 The check-in channel reservation virtual window time adjustment module includes: The time detection module is configured to detect the time T from the time the luggage at each check-in counter enters the security inspection machine to the time it is put away, and The second processor is configured to dynamically adjust the virtual window time T for the check-in channel reservation for handling a small number of luggage according to the detected time T. c1 ; The virtual window time T for booking a check-in channel with a small number of luggage is dynamically adjusted according to the detected time T. c1 include: Determine the maximum value T of the time T max , minimum value T min and the average ; Determine the time T c1 The ideal change Is it greater than : If the ideal change Less than or equal to , the new appointment virtual window time is changed to , If the ideal change Greater than , the new appointment virtual window time is changed to , and at the same time start the check-in channel reservation virtual window starting position adjustment module.

10. The system according to claim 9, wherein: Also includes: The check-in channel reservation virtual window starting position adjustment module is configured to dynamically adjust the time T from the starting position to the transfer conveyor available position by changing the starting position of the check-in channel reservation virtual window c2 The check-in channel reservation virtual window starting position adjustment module includes: The position distance determination module is configured to determine the distance L between the position of the check-in channel and the position of the downstream exit of the collection belt conveyor line x , and the distance L between the initial reservation virtual window starting position of the check-in channel and the downstream exit position of the collection belt conveyor line y ; A starting position controller is configured to adjust the starting position of the check-in channel reservation virtual window accordingly according to the position control instruction; The third processor is configured to calculate the time T for moving from the starting position to the position where the induction conveyor can be placed. c2 The ideal change , and generate corresponding position control instructions accordingly; The time T for moving from the starting position to the position where the transition conveyor can be placed is dynamically adjusted by changing the starting position of the virtual window for booking the check-in channel. c2 include: Determine the time T c2 The ideal change Is it greater than , where V is the operating speed of the take-away conveyor: If the ideal change Less than or equal to , then the starting position of the new reservation virtual window changes to , If the ideal change Greater than , then the starting position of the new reservation virtual window changes to , and at the same time start the check-in channel transition conveyor conveying speed adjustment module.

11. The system according to claim 10, wherein: Also includes: The check-in channel transition conveyor conveying speed adjustment module is configured to dynamically adjust the time T for the baggage to be completely dropped on the transition conveyor by changing the conveying speed of the check-in channel transition conveyor. c3 The check-in channel transition conveyor conveying speed adjustment module includes: an infeed conveyor conveying speed controller configured to adjust the conveying speed of the infeed conveyor according to the speed control instruction; and The fourth processor is configured to calculate the time T when the baggage is completely dropped on the induction conveyor. c3 The ideal change , and generate corresponding speed control instructions accordingly, The time T for the baggage to be completely put on the transition conveyor is dynamically adjusted by changing the conveying speed of the transition conveyor of the check-in channel. c3 include: Calculate the time T according to the following formula c3 The ideal change is: ， Then, the ideal change in the corresponding transition conveyor speed is calculated according to the following formula: ; The new transition conveyor speed of the check-in channel is calculated as follows: ； Among them, V A is the initial transition conveyor speed, L A is the luggage length.

12. The system according to claim 9, wherein Also included is a processor configured to: Determine whether the airport is in peak period based on the number of luggage from the luggage number counting module, and When the airport is in peak hours, the average number of baggage handled by each check-in counter is calculated. When the airport is in peak hours, the average number of baggage handled by each check-in counter is calculated, and the check-in channel reservation virtual window time adjustment module is activated only for the check-in counters whose baggage handling number is lower than the average number of baggage.

Images