A dynamic baggage reservation virtual window commissioning method and system

Abstract

The present application relates to a dynamic baggage reservation virtual window adjustment method and system. The scheme includes: setting the distance between adjacent bags; measuring the length of the bags waiting for transportation; determining the length of the virtual window associated with the bag according to the measured length of the bag and the set distance between adjacent bags; and applying for a reservation for the bag to the system for a virtual window with the determined length on the collection conveyor. The method also includes dynamically adjusting the check-in channel reservation virtual window time, dynamically adjusting the time from the start position of the check-in channel reservation virtual window to the fully dropped position of the transition conveyor by changing the start position of the check-in channel reservation virtual window, and dynamically adjusting the time for the bag to fully drop on the transition conveyor by changing the conveying speed of the check-in channel transition conveyor.

Description

Technical Field

[0001] This application relates to the field of airport terminal baggage sorting system reservation, and more specifically, to a method and system for debugging a dynamic baggage reservation virtual window. Background Technology

[0002] In the airport check-in area, the check-in island consists of multiple check-in counters. Each check-in counter includes a service counter for issuing boarding passes, a baggage drop-off conveyor next to it, and a collection conveyor located in the back to transport baggage to the sorting area. The check-in conveyor consists of three parts: weighing, security screening, and transition conveyors. The size and spacing between airport check-in counters are generally the same and usually remain unchanged after the layout is completed.

[0003] When passengers check in and drop off their luggage at the check-in counters on the check-in islands, their luggage needs to be sent from the counters to the sorting area. This means that luggage received by the check-in counter conveyor belts is weighed and screened before being transported to the sorting area via a transfer conveyor and a collection conveyor belt. Because multiple check-in counters typically handle luggage simultaneously on the check-in islands, a (virtual) window reservation mechanism is generally used to avoid conflicts during luggage transport. Specifically, each piece of luggage, after being weighed and screened, is first transported on a transfer conveyor belt to the luggage window waiting area to await the arrival of its reserved window. Only when the reserved window arrives is the luggage allowed to enter the collection conveyor for further transport and processing. This technology, known as "window" technology in the luggage handling system, prevents luggage from colliding or piling up when entering the collection conveyor.

[0004] In traditional check-in technology, baggage claim reservations are generally processed on a "first-come, first-served" basis. However, this principle can lead to varying check-in efficiency at each counter due to uneven availability of baggage claim slots within a given time period, particularly with check-in lanes further downstream experiencing lower efficiency.

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

[0006] For example, patent document CN 115860367 A discloses a debugging method for balanced allocation of baggage collection line windows. This method is used to schedule multiple baggage window waiting areas on a transition conveyor, allocating windows to each waiting area within a window application interval. After window allocation, the baggage at the waiting area enters the collection conveyor for further processing. The transport direction of the collection conveyor is 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 regions by a dividing line, namely 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 and even window allocation method to reserve empty windows for the baggage window waiting areas in the second window waiting area; and allocating the empty windows to the baggage window waiting areas in the second window waiting area. This method can achieve a more balanced window allocation, thereby improving counter check-in efficiency.

[0007] However, in the aforementioned patent documents, to ensure uniform check-in efficiency across all check-in counters on a single check-in island—that is, to ensure that baggage checked in at each check-in lane is placed onto the subsequent collection conveyor belt with equal probability—the virtual window length for each check-in lane is fixed. Since the virtual window length for shorter baggage is the same as the virtual window length for longer baggage, the efficiency of the baggage collection conveyor decreases, leading to reduced processing efficiency at the check-in lanes and increased passenger waiting time.

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

[0009] According to a first aspect of this application, a method for dynamically adjusting a virtual window for baggage reservations is provided, comprising:

[0010] Set the distance between adjacent luggage;

[0011] Measure the length of luggage awaiting transport;

[0012] The length of the virtual window associated with the luggage is determined based on the measured length of the luggage and the set distance between adjacent luggage; and

[0013] The system requests a reservation for the baggage in a virtual window of a defined length on the collection conveyor.

[0014] According to a second aspect of this application, a system for dynamically adjusting a virtual window for baggage reservations is provided, comprising:

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

[0016] A baggage length detector is configured to measure the length of baggage waiting to be transported at each check-in counter;

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

[0018] A first processor is configured to determine the length of a reservation virtual window at the 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 overview is provided to introduce, in a simplified form, some of the concepts further described in the detailed description below. This overview is not intended to identify key or essential features of the claimed subject matter, nor is it intended to limit the scope of the claimed subject matter. Attached Figure Description

[0020] To describe how the above and other advantages and features of the invention are obtained, a more detailed description of the invention, which has been briefly described above, will be presented with reference to specific embodiments of the invention shown in the accompanying drawings. It will be understood that these drawings depict only exemplary embodiments of the invention and are therefore not intended to limit its scope. The invention will be described and explained using the drawings and with the aid of additional features and details, in which:

[0021] Figure 1 A schematic diagram of a traditional baggage collection conveyor belt with equally divided virtual windows is shown.

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

[0023] Figure 3 A partial schematic flowchart of a method for dynamically adjusting a virtual window for baggage reservations according to an embodiment of this application is shown.

[0024] Figure 4 A schematic structural diagram of a system for dynamically adjusting a virtual window for baggage reservations, according to an embodiment of this application, is shown.

[0025] Figure 5 A schematic structural diagram of a reservation virtual window length adjustment module in a system for dynamically adjusting a baggage reservation virtual window according to an embodiment of this 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 adjusting baggage reservation virtual windows according to an embodiment of this application is shown.

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

[0028] Figure 8 A schematic structural diagram of a check-in lane transition conveyor speed adjustment module in a system for dynamically adjusting a baggage reservation virtual window, according to an embodiment of this application, is shown. Detailed Implementation

[0029] In this application, to overcome the various shortcomings caused by the relatively fixed virtual reservation window for each piece of luggage in existing virtual luggage reservation windows, a dynamic virtual luggage reservation window debugging mechanism is proposed. In general, this dynamic virtual luggage reservation window debugging mechanism can not only dynamically adjust the length of the corresponding virtual reservation window according to the length of each piece of luggage, but also adjust the virtual reservation window time, the starting position of the virtual reservation window, and the conveyor speed of the transition conveyor in stages according to the actual busyness of each check-in counter on the check-in island, thereby maximizing the efficiency of the check-in channels and reducing passenger waiting time.

[0030] Before describing the solution proposed in this application, let's first understand the basic principle of determining the length of a virtual window by explaining the traditional virtual window technology for baggage reservations.

[0031] like Figure 1 As shown, traditional baggage reservation virtual window technology divides the collection conveyor belt into several windows of length L. Figure 1 The image shows ten check-in conveyors corresponding to each counter. Following traditional industry layout, these counters are placed in pairs along the direction of the baggage collection conveyor, i.e., (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 counters are not the focus of this application; therefore, in... Figure 1 The image only shows the individual check-in conveyors, with the blank spaces between them representing the service counter locations. In traditional virtual baggage reservation technology, a virtual window is typically 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 the sake of simplicity. It should be understood that the counter layout shown is for illustrative purposes only and is not a limitation. Layouts with more or fewer counters can also utilize the scheme of this application and are all 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] Assuming that the collection conveyor belt moves forward, the full efficiency of the collection conveyor belt per unit time T is such that there is one piece of baggage for each window of length L, where length L must meet the maximum standard baggage size requirement. According to the Civil Aviation Administration of China's regulations, the maximum standard baggage size (a max It is generally 1 meter. Figure 1 The length L of the traditional virtual window is the width of a set of counters (i.e., two service desks + two check-in conveyors), which is generally more than 3 meters.

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

[0036] As can be understood from the above explanation, 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 size, and in actual operation, most baggage does not meet this maximum standard baggage size, a large part of the window length L is left empty during transportation, resulting in low efficiency of the collection conveyor.

[0037] To overcome the aforementioned 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 rather different length virtual windows are dynamically reserved based on the length of different baggage.

[0038] Specifically, such as in Figure 2 As shown, in the solution of this 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 Civil Aviation Administration's regulations, the minimum length 'a' of checked baggage... min It is 25 centimeters, while the maximum length a max Since the value is 1 meter, the value of 'a' generally ranges from 25 centimeters to 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 collecting conveyor belt is more, which means that the number of pieces of luggage that can be conveyed simultaneously is more.

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

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

[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, the length L1 of the virtual window associated with this piece of luggage is determined according to the measured length a of the luggage and the set distance b between adjacent pieces of luggage, where L1 = a + b. <00001​​​​​​Finally, at step 360, when the reserved virtual window on the collection conveyor reaches the rear end of the transition conveyor, the baggage is allowed to enter the collection conveyor for subsequent transport and processing.

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

[0053] To further improve the conveyor efficiency of the baggage reservation system, in addition to dynamically adjusting the length of the virtual reservation window (process 1), the method for dynamically adjusting the baggage reservation virtual window in this application can provide more adjustment methods. For example, dynamically adjusting the check-in channel reservation virtual window time (T c1 Processing 2) Dynamically adjust the time (T) from the starting position of the virtual window for check-in channel reservation to the available placement position of the transition conveyor by changing the starting position of the virtual window. c2 (3) and dynamically adjust the time it takes for baggage to be completely dropped onto the transfer conveyor by changing the conveyor speed of the check-in lane transfer conveyor (T). c3 Processing 4).

[0054] First, assuming the time from when the baggage enters the security scanner to when it is released is T, this time can be divided into three parts. The first part is the time T from when the baggage enters the security scanner to when it reaches the photoelectric sensor on the transfer conveyor. a The second part is the waiting time T for the security screening machine to interpret the image. b The third part is the time T from receiving the image recognition signal from the security scanner to the complete release of the baggage. c .

[0055] Right now:

[0056] Because of T a T b Since the two values ​​are relatively fixed during actual use at the same airport, the debugging method in this application only applies to T. c The value is improved, that is, the debugging method of this application only optimizes the time from receiving the security inspection machine's image judgment signal to the complete release of the baggage.

[0057] And T c It can also be broken down into three parts. The first part is the time from receiving the image recognition signal from the security scanner to starting the virtual window reservation, hereinafter referred to as the virtual window reservation time T. c1 The second part is the time T for moving from the starting position of the reservation virtual window to the available placement position of the transition conveyor. c2The third part is the time T during which the luggage is completely dropped onto the transfer conveyor. c3 .

[0058] Right now:

[0059] For T c1 T c2 T c3 For each of these three time periods, the debugging method in this application provides a corresponding optimization process.

[0060] However, it should be understood that before executing the optimization process, the system first determines whether the airport is entering peak season based on the number of flights or baggage handled at different times on the same check-in island. Since there are fewer check-in passengers when flights are not busy, people will automatically seek out less crowded counters. Therefore, the further optimization process has limited effect during off-peak hours. Thus, processes 2-4 of the method in this application are generally not invoked during off-peak hours, but rather default values ​​are used directly. 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 does not match the cost.

[0061] When the airport enters peak hours, firstly, consider the time T from receiving the security screening signal to starting the virtual window reservation process. c1 The optimization proposes a mechanism to dynamically adjust the virtual window time for the corresponding check-in channel reservation based on the number of bags processed by each check-in counter, i.e., processing 2.

[0062] Specifically, the original virtual window technology had fixed reservation times, meaning that the virtual window reservation time for each check-in channel was fixed at different times. However, in reality, due to peak and off-peak flight periods within a day, the number of baggage checked through different check-in channels at the same check-in island can vary greatly within the same time period, and the number of baggage checked through the same check-in channel at the same check-in island can also vary greatly at different times.

[0063] Therefore, the dynamic baggage reservation virtual window technology of this application can dynamically adjust the virtual window time for channel reservations, thereby reducing the difference in the number of bags processed at different check-in channels on the same check-in island within a predetermined time period during peak hours (e.g., in half-hour increments), thus reducing the problem of passenger waiting time differences caused by the efficiency of different check-in counters. As mentioned earlier, in actual operation, different check-in counters handle different numbers of bags (especially during peak hours when this difference is more pronounced). To reduce this difference, the virtual window reservation time for a single piece of baggage at check-in counters handling fewer bags needs to be shortened from entering the security scanner to being dropped off.

[0064] It's understandable that the low baggage throughput is due to the long processing time per piece of baggage at this check-in counter. In reality, if all check-in counters operate at full efficiency without dynamic time adjustments, the closer a check-in counter is to the upstream of the collection conveyor, the shorter the processing time per piece of baggage. This leads to a significant difference in baggage throughput between downstream and upstream check-in counters. Therefore, to reduce this gap, it's necessary to shorten the time from when baggage enters the security screening machine to when it's dropped off at the designated virtual window at downstream check-in counters, thereby increasing their baggage throughput.

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

[0066] An ideal optimized result would be that, within a half-hour timeframe, the difference in the number of bags handled by different check-in lanes on the same check-in island would be less than 5%. However, this goal may require multiple optimizations to achieve.

[0067] To achieve the above objectives, in this embodiment, it is assumed that within a time period of half an hour, the time T for each piece of baggage at different check-in counters from entering the security scanner to being dropped off is...

[0068] 1. The maximum number of check-in counters (i.e., the fewest check-in counters handling baggage) is T. max ;

[0069] 2. The minimum number of check-in counters (i.e., the counters handling the most baggage) is T. min ;

[0070] 3. The average value is .

[0071] Therefore, in process 2, the virtual reservation window time T to be adjusted for check-in lanes with less baggage (e.g., less than average) is... c1 The ideal change is Therefore, the new virtual reservation window time for this check-in channel is calculated to be... .

[0072] However, in practical applications, we found that the new reservation virtual window time T in this debugging method... c1 In practice, it cannot be less than one-half of the initial value, that is... This is because, in actual operation, if the new virtual appointment window time is adjusted to less than... At this time, it may be impossible to make a reservation at the counter. The main reason is that the design performance and safety requirements of the baggage handling system limit its ability to unilaterally and significantly adjust a single parameter, which is only theoretically possible and difficult to implement in practice.

[0073] Therefore, in actual operation, for T c1 The adjustments can be divided into two situations:

[0074] First scenario: Ideal change Less than or equal to Therefore, the new virtual appointment window time has been changed to At this point, there is no need to perform subsequent processing steps 3 and 4.

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

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

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

[0078] However, when the second scenario occurs in process 2, in order to further optimize the process, the dynamic baggage reservation virtual window technology of this application can change the time T for moving from the starting position to the drop-off position of the transition conveyor by dynamically adjusting the starting position of the channel reservation virtual window. c2 This further eliminates the difference in the number of bags processed 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 outlet of the collection belt conveyor line. x The initial position of the virtual window for initial reservation is L, which is located at the downstream exit of the collection belt conveyor line. y If the speed of the collection conveyor is V, then the time required to move from the starting position of the reservation virtual window to the available placement position of the transition conveyor is... ,

[0080] If the second case in process 2 occurs, i.e., T c1The change does not meet the ideal change, that is... Greater than In order to ensure a successful reservation, the new T c1 Forced to be limited to At this point, the new T, which should have been further optimized, c1 In reality, only optimizations were made. The remaining parts were not optimized. These remaining parts to be optimized can be represented as... .

[0081] Therefore, it can be seen that processing 3 types of T... c2 The ideal change is to absorb these remaining parts that need optimization, that is... .

[0082] According to the above formula, we can obtain: L y The corresponding ideal change Therefore, the starting position of the new virtual reservation window for this check-in channel can be calculated as follows: .

[0083] Theoretically speaking, when the starting position of the virtual reservation window is changed to... The time T during which luggage moves from the new starting position to the drop-off position of the transition conveyor. c2 The change in T is just enough to completely digest the remaining parts to be optimized in process 2, thus obtaining the optimal T. c Value (i.e., T) c Minimum value).

[0084] However, for the same reason as in processing 2, in actual operation, if the starting position of the new reservation virtual window is adjusted to be less than half the difference between the initial position and the previous position, that is... This could lead to problems with not being able to book an appointment at the window. Therefore, in actual operation, T c2 The adjustments can be divided into two categories:

[0085] First scenario: Ideal change Less than or equal to When this happens, the starting position of the new appointment virtual window will change to... Furthermore, subsequent processing step 4 is also unnecessary.

[0086] Second scenario: Ideal change Greater than At that time, Only take In this way, the starting position of the corresponding new appointment virtual window is changed to Meanwhile, since the time reduction due to the change in the starting position still does not meet the ideal change amount, further processing step 4 is required.

[0087] Solution 4: Dynamically adjust the time T for baggage to be completely dropped onto the transfer conveyor by changing the conveyor speed of the check-in lane transfer conveyor. c3 .

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

[0089] If baggage from different check-in lanes can be fully loaded into their reserved window at the same time as much 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, the main method is to change the conveyor speed of the transition conveyor, thereby altering the time T it takes for the luggage to be completely placed on the transition conveyor. c3 Specifically, the process includes:

[0091] Assume the initial conveyor speed is V. A The length of the luggage is L A Therefore, the time it takes for luggage to be completely dropped onto the transfer conveyor ,

[0092] If the second case occurs in process 3, i.e., T c2 The change amount does not meet the ideal change amount In order to ensure a successful appointment, Forced to be limited to At this point, the new T, which should have been further optimized, c2 In reality, only a portion was optimized. The remaining portion was not optimized. These remaining unoptimized parts can be represented as... .

[0093] Therefore, in processing 4... The ideal change is to absorb these remaining parts that need optimization, that is... .

[0094] Based on the above formula, the ideal change in the conveying speed of the transition conveyor can be obtained as follows:

[0095] ;

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

[0097] ;

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

[0099] Since the baggage reservation virtual window dynamic debugging technology of this application has already undergone two rounds of baggage quantity difference optimization in processes 2 and 3 before executing process 4, in practical applications, the remaining baggage quantity difference to be optimized is actually very small at this time. This results in a small rate of change in the conveyor speed of the transition conveyor, and there is no need to discuss the limitations separately.

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

[0101] On the other hand, as mentioned earlier, processes 2-4 are generally only executed during peak hours. In a preferred embodiment, the method for dynamically adjusting the baggage reservation virtual window may further include, after determining that the airport has entered its peak period, first calculating an average number of bags processed at each check-in counter, and then executing processes 2-4 only for check-in counters where the number of bags is below the average. Furthermore, after a predetermined time interval (e.g., ten minutes), the method will again detect the average number of bags processed, and then again execute processes 2-4 for check-in counters where the number of bags is below the average, and so on, until the airport has passed its peak period. Once the airport has passed its peak period, all reservation virtual window data (reservation time, starting position, and conveyor speed) for all check-in counters return to their initial values, and processes 2-4 are no longer executed to save resources and costs.

[0102] Based on the actual project debugging results, after continuous execution of processing 2-4, the difference in the number of bags handled by different check-in channels on the same check-in island can be less than 5% within a unit time period during peak hours.

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

[0104] At the same time, Figure 4 The diagram shows a schematic structural diagram of a system for dynamically adjusting a virtual window for baggage reservations according to an embodiment of this application.

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

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

[0107] Among them, such as 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, and includes:

[0108] Baggage length detector 412 is configured to measure the length of baggage waiting to be transported at each check-in counter.

[0109] An adjacent baggage distance detector 414 is configured to measure the distance between the baggage and adjacent baggage.

[0110] The first processor 416 is configured to determine the length of a virtual window at the 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 the collection conveyor for subsequent transport and processing when the scheduled virtual window time arrives at the virtual window.

[0111] Thus, by dynamically adjusting the length of the corresponding virtual reservation window through the virtual reservation window length adjustment module 410, this 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 conveying efficiency of the collection conveyor belt.

[0112] In addition, the system 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 is entering its peak period based on the baggage statistics provided by the flight number or baggage number statistics module 450, it will further activate the check-in channel reservation virtual window time adjustment module 420, the check-in channel reservation virtual window start position adjustment module 430, and the check-in channel transition conveyor speed adjustment module 440 as needed to further optimize the conveying efficiency.

[0114] Among them, such as Figure 6As shown, the virtual window time adjustment module 420 for check-in lane reservations is configured to dynamically adjust the corresponding virtual window time T for check-in lane reservations based on the number of bags processed at each check-in counter within a predetermined time period (e.g., half an hour). c1 It includes:

[0115] Time detection module 422 is configured to detect the time T of each unit of baggage at each check-in counter from entering the security scanner to being dropped off, and

[0116] The second processor 424 is configured to dynamically adjust the virtual window time T for check-in lane reservations for check-in lanes with fewer (less than average) baggage processing volumes based on the detected time T. c1 .

[0117] Among them, the virtual window reservation time T for check-in channels with fewer bags is dynamically adjusted based on the detected time T. c1 Specifically, it includes:

[0118] The maximum value T of the time T is determined based on the time T of each unit of baggage at each check-in counter from entering the security scanner to being dropped off, as detected by the time detection module 422. max Minimum value T min and average value .

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

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

[0121] If the ideal change Greater than Then the new virtual window time T c1 changed to At the same time, the virtual window start position adjustment module 430 for check-in channel reservation is activated.

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

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

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

[0125] The third processor 436 is configured to calculate the time T for moving from the starting position to the deployable position of the transition conveyor. c2 Ideal change And based on this, generate corresponding position control commands.

[0126] Specifically, the time T for moving from the starting position of the virtual window for check-in channel reservation to the available placement position of the transition conveyor is dynamically adjusted by changing the starting position of the virtual window. c2 include:

[0127] Judgment time T c2 Ideal change Is it greater than Where V is the operating speed of the collecting belt conveyor:

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

[0129] If the ideal change Greater than The starting position of the new appointment virtual window will then change to At the same time, the speed adjustment module 440 of the transition conveyor in the check-in channel is activated.

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

[0131] The transition conveyor speed controller 442 is configured to adjust the conveying speed of the transition conveyor according to speed control commands; and

[0132] The fourth processor 444 is configured to calculate the time T when the luggage is completely dropped onto the transfer conveyor. c3 Ideal change Based on this, corresponding speed control commands are generated.

[0133] Specifically, the time T for baggage to be completely dropped onto the transition conveyor is dynamically adjusted by changing the conveyor speed of the check-in lane transition conveyor. c3 include:

[0134] Calculate time T using the following formula. c3 Ideal change amount:

[0135] ,

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

[0137] ;

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

[0139] ;

[0140] Among them, V A This is the initial transition conveyor speed, L. A It refers to the length of the luggage.

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

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

[0143] If it is determined that the airport is in peak period, the processor 460 activates the virtual window time adjustment module 420 for check-in lane reservations for further optimization. Otherwise, the virtual window time adjustment module 420 is not activated.

[0144] Based on the calculated average number of bags, processor 460 can further determine which check-in counters require further optimization. For example, check-in counters handling fewer bags than the average number of bags may be assigned to check-in lane reservation virtual window time adjustment module 420 for further optimization.

[0145] In summary, the method and system for dynamically adjusting the virtual baggage reservation window of this application improve the baggage handling efficiency of the check-in channel by dynamically adjusting the length, time, starting position of the virtual reservation window and the conveying speed of the transition conveyor. This reduces the airport's processing costs and time, while 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 existing sensors, detectors, processors, or through programming.

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

[0148] The operations of the example processes are shown in separate boxes and are summarized with reference to these boxes. These processes are shown as a flow of logical boxes, 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 one or more processors to perform a given operation. Generally, computer-executable instructions include routines, programs, objects, modules, components, data structures, etc., that perform a particular function or implement a particular abstract data type. The order in which the operations are described is not intended to be construed as limiting, and any number of the operations may be executed in any order, combined in any order, subdivided into multiple sub-operations, and / or executed in parallel to implement the described process. The described process may be executed 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 methods and processes described above 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 on any type of computer-executable storage medium or other computer storage device. This code 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 as potentially representing a module, segment, or portion of code comprising one or more executable instructions for implementing a specific logical function or element in that routine. Alternative implementations are included within the scope of the examples described herein, wherein elements or functions may be removed or performed inconsistently with the order shown or discussed, including substantially synchronous or reverse order execution, depending on the functionality involved, as will be understood by those skilled in the art.

[0151] While different embodiments have been described above, it should be understood that they are merely examples and not limitations. Those skilled in the art will appreciate that various modifications in form and detail may be made without departing from the spirit and scope of the invention as defined in the appended claims. Therefore, the breadth and scope of the invention disclosed herein should not be limited by the exemplary embodiments disclosed above, but should be defined solely by the appended claims and their equivalents.

Claims

1. A method for dynamically adjusting a virtual window for baggage reservation, comprising: Set the distance between adjacent luggage; Measure the length of luggage awaiting transport; The length of the virtual window associated with the luggage is determined based on the measured length of the luggage and the set distance between adjacent luggage. as well as The system requests a reservation for the baggage in a virtual window of a defined length on the collection conveyor belt; The method further includes: When the airport is at its peak: The virtual window time for each check-in lane is dynamically adjusted based on the number of bags handled at each check-in counter within the predetermined time period. c1 ,include: The number of bags processed at each check-in lane during the predetermined time period is recorded. The time T for each unit of baggage at each check-in counter from entering the security screening machine to being released is detected, wherein the time T includes the time from receiving the image judgment signal from the security screening machine to the complete release of the baggage. c , T c1 The virtual window reservation time is the period from receiving the image recognition signal from the security scanner to the start of the virtual window reservation process; T c2 T is the time it takes to move from the starting position of the reservation virtual window to the available placement position on the transition conveyor. c3 The time it takes for the luggage to be completely dropped onto the transition conveyor; Based on the detected time T c The virtual window reservation time T for check-in lanes with fewer baggage is dynamically adjusted. c1 ,include: Determine the maximum value T of the time T. max Minimum value T min and average value ; Determine the time T c1 First ideal change Is it greater than : If the first ideal change amount Less than or equal to The new virtual appointment window time is then changed to , If the first ideal change amount Greater than The new virtual appointment window time is then changed to And further perform the following steps: The time T for moving from the starting position of the virtual window for check-in channel reservations to the available placement position on the transition conveyor is dynamically adjusted by changing the starting position of the virtual window. c2 ,include: Determine the distance L between the location of the check-in aisle and the downstream outlet of the collection belt conveyor. x The distance L between the starting position of the initial reservation virtual window of the check-in channel and the position of the downstream exit of the collection belt conveyor. y And the operating speed V of the collection belt conveyor; Determine the time T c2 The second ideal change Is it greater than : If the second ideal change amount Less than or equal to The starting position of the new appointment virtual window will then change to , If the second ideal change amount Greater than The starting position of the new appointment virtual window will then change to And further perform the following steps: The time T for baggage to be completely dropped onto the transfer conveyor is dynamically adjusted by changing the conveyor speed of the transfer conveyor in the check-in lane. c3 .

2. The method as described in claim 1, characterized in that, The process of determining the length of the virtual window associated with the luggage based on 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 adjacent luggage.

3. The method as described in claim 1, characterized in that, The time T for baggage to be completely dropped onto the transition conveyor is dynamically adjusted by changing the conveyor speed of the check-in channel transition conveyor. c3 include: Calculate the time T for the luggage to be completely dropped onto the transfer conveyor using the following formula. c3 Ideal change : ， The ideal change in the conveying speed of the transition conveyor is then calculated using the following formula: ; The calculated conveying speed of the new transition conveyor in the check-in channel is: ； Among them, V A This is the initial transition conveyor speed, L. A It refers to the length of the luggage.

4. The method as described in claim 1, characterized in that, Airport peak hours are determined by the number of flights or the total number of bags handled by all check-in counters. When the airport is in peak hours, the average number of bags handled by each check-in counter is calculated, and the step of dynamically adjusting the virtual window reservation time for check-in lanes is only performed for check-in counters that handle fewer bags than the average number of bags.

5. A system for dynamically adjusting a virtual window for baggage reservations, comprising: A virtual reservation window length adjustment module is configured to dynamically adjust the length of the corresponding virtual reservation window based on the length of the luggage waiting to be transported. The virtual reservation window length adjustment module includes: A baggage length detector is configured to measure the length of baggage waiting to be transported at each check-in counter; An adjacent baggage distance detector is configured to measure the distance between the baggage and adjacent baggage, and A first processor is configured to determine the length of a reservation virtual window at the 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. The system also includes: The virtual window time adjustment module for check-in lane reservations is configured to dynamically adjust the virtual window time for the corresponding check-in lane based on the number of bags processed at each check-in counter within a predetermined time period. The check-in channel reservation virtual window start position adjustment module is configured to dynamically adjust the time T for moving from the start position to the available placement position on the transition conveyor by changing the start position of the check-in channel reservation virtual window. c2 ; The check-in lane transition conveyor speed adjustment module is configured to dynamically adjust the time T for baggage to be fully disembarked on the transition conveyor by changing the conveyor speed of the check-in lane transition conveyor. c3 ; The virtual window time adjustment module for check-in channel reservation includes: The time detection module is configured to detect the time T from when a unit of baggage at each check-in counter enters the security scanner to when it is dropped off, wherein the time T includes the time from receiving the image judgment signal from the security scanner to when the baggage is completely dropped off. c , T c1 The virtual window reservation time is the period from receiving the image recognition signal from the security scanner to the start of the virtual window reservation process; T c2 T is the time it takes to move from the starting position of the reservation virtual window to the available placement position on the transition conveyor. c3 The time it takes for the luggage to be completely dropped onto the transition conveyor; and The second processor is configured to dynamically adjust the virtual reservation window time T for check-in lanes with fewer baggage requests based on the detected time T. c1 ,include: Determine the maximum value T of the time T. max Minimum value T min and average value ; Determine the time T c1 First ideal change Is it greater than : If the first ideal change amount Less than or equal to The new virtual appointment window time is then changed to , If the first ideal change amount Greater than The new virtual appointment window time is then changed to At the same time, the virtual window start position adjustment module for check-in channel reservation is activated; The virtual window start position adjustment module for check-in channel reservation includes: The location distance determination module is configured to determine the distance L between the location of the check-in channel and the location of the downstream outlet of the collection belt conveyor. x And the distance L between the starting position of the initial reservation virtual window of the check-in channel and the position of the downstream exit of the collection belt conveyor. y ; The starting position controller is configured to adjust the starting position of the virtual window for check-in channel reservations accordingly based on position control commands. A third processor is configured to calculate the time T for moving from the starting position to the deployable position of the transition conveyor. c2 Ideal change And based on this, generate corresponding position control commands; Specifically, the time T for moving from the starting position of the virtual window for check-in channel reservation to the available placement position of the transition conveyor is dynamically adjusted by changing the starting position of the virtual window. c2 include: Determine the time T c2 The second ideal change Is it greater than Where V is the operating speed of the collecting belt conveyor: If the second ideal change amount Less than or equal to The starting position of the new appointment virtual window will then change to , If the second ideal change amount Greater than The starting position of the new appointment virtual window will then change to At the same time, the speed adjustment module of the transition conveyor in the check-in channel is activated.

6. The system as described in claim 5, characterized in that, Also includes: The baggage quantity statistics module is configured to count the number of bags processed at each check-in lane and provide the count to the processor.

7. The system as described in claim 5, characterized in that, The speed adjustment module for the transition conveyor in the check-in channel includes: A transition conveyor speed controller is configured to adjust the conveying speed of the transition conveyor according to speed control commands; and A fourth processor is configured to calculate the time T when the luggage is completely dropped onto the transfer conveyor. c3 Ideal change Based on this, corresponding speed control commands are generated. Specifically, the time T for baggage to be completely dropped onto the transition conveyor is dynamically adjusted by changing the conveyor speed of the check-in lane transition conveyor. c3 include: Calculate time T using the following formula. c3 Ideal change amount: ， The ideal change in the conveying speed of the transition conveyor is then calculated using the following formula: ; The calculated conveying speed of the new transition conveyor in the check-in channel is: ； Among them, V A This is the initial transition conveyor speed, L. A It refers to the length of the luggage.

8. The system as described in claim 5, characterized in that, It also includes a processor, configured for: Based on the number of bags from the baggage quantity statistics module, it is determined whether the airport is in peak season, and When the airport is in peak hours, the average number of bags handled by each check-in counter is calculated. When the airport is in peak hours, the average number of bags handled by each check-in counter is calculated, and the check-in channel reservation virtual window time adjustment module is activated only for check-in counters where the number of bags handled is lower than the average number of bags handled.

Images