A dynamic method for calculating the number of queues

Abstract

The present invention provides a dynamic method for calculating the number of queues, which takes the current data identifier of the total exit queue as the starting calculation point, calculates the total number of identifiers from all entry queues that enter the sorting queue within the time zone from when the data identifier enters the sorting queue to when it leaves the sorting queue; and is provided with a proofreading mechanism module, when the total number of identifiers of the sorting queue is calculated, two consecutive data identifiers in the total exit queue are used as the judgment point, and the continuity of the two consecutive data identifiers in the main entrance queue is judged; when the proofreading mechanism module judges that the continuity is consistent, the total number of identifiers of the current sorting queue is output. Timely clearing, real-time calculation, and continuity proofreading methods avoid the possibility of accumulating historical errors, effectively improve the accuracy of quantity statistics, and greatly reduce the physical errors caused by the identification device.

Description

Technical Field

[0001] The invention relates to the field of queue calculation methods, and in particular to a dynamic queue quantity calculation method. Background Art

[0002] With the rapid development of society, people's sense of order has become stronger. Especially in many public places, people often need to queue up in order to achieve the purpose of queuing. In order to speed up the circulation of the queue, reduce the flow pressure per unit time, and effectively improve the control of on-site operations, it is particularly important to obtain the number of queues in the queue in a timely and accurate manner.

[0003] At present, the calculation method of the number of queues in the market is still mainly based on the traditional number calculation method, and the traditional calculation method is basically to directly add and subtract the number of data obtained at the beginning and end of the queue. Specifically, there are generally two traditional calculation methods: one is to issue a queue number to each person, which is also the current common practice. The problems caused by this calculation method are: 1) It is necessary to prepare a separate queue number; 2) It is necessary to have equipment for issuing queues at the entrance and equipment for recycling at the exit; 3) It is difficult to verify data for multiple entrances and exits. This calculation method not only increases the number of equipment and the paper or cards used for queue numbers, but also requires manual collection and sorting before it can be reused each time. This cost and inconvenience caused by more manpower and equipment are obviously not suitable for the needs of today's society, especially in the case of large circulation and fast queue passing. Another is to calculate the total amount of entry at the entrance and the total amount of entry at the exit, and obtain the real-time inventory by subtracting the total amount of entry from the total amount of entry. For example, the inventory quantity of many parking garages is calculated in this way. The errors generated by this calculation method mainly come from: 1) The collection equipment of the Internet of Things cannot be completely accurate. For example, the license plate recognition rate has an error of more than 1%. Since this error cannot be overcome by itself, it will accumulate over time. Especially for parking lots with frequent vehicle access, it is likely to accumulate an error of more than 10% within a day. 2) The problem of historical error accumulation. Since this calculation method cannot automatically calculate and clear, long-term data accumulation for total statistics will inevitably result in too much basic data for statistics, which will greatly increase the historical difference. 3) For this calculation method, if historical errors are to be avoided, inventory counts must be conducted, and this inventory count must require additional manual processing to be guaranteed. All of the above fully demonstrate that overly simple algorithms are obviously unable to meet the accuracy control requirements of the current society in terms of cost and convenience, especially for the sorting queues with large circulation and fast passing of single queues. The practicality is very low.

[0004] In view of this, it is necessary to improve the queue number in the prior art to solve the above problems. Summary of the invention

[0005] To achieve the above object, the present invention provides a dynamic queue quantity calculation method, comprising the following steps:

[0006] Step S1, a data identification module uses an identification device to obtain an entry data identification of a queue entering the sorting queue at an entry position, and obtains an exit data identification of a queue leaving the sorting queue at an exit position;

[0007] Step S2, queue arrangement module, the inlet data identifier forms an inlet queue, the outlet data identifier forms an outlet queue, the inlet queue is at least one, and one of them is preset as the inlet main queue, and the outlet queues are superimposed and merged into an outlet total queue;

[0008] Step S3, triggering mechanism module, triggering step S4 to calculate the total number of identifiers of the sorting queue according to the change of the data identifier in the fixed time moment or the total exit queue;

[0009] Step S4, the identifier quantity calculation module uses the current data identifier of the total exit queue as the starting point for calculation, and calculates the total number of identifiers that enter the sorting queue from all entry queues during the time period from when the data identifier enters the sorting queue to when it leaves the sorting queue;

[0010] Step S5, the proofreading mechanism module, when the total number of identifiers of the sorting queue is calculated in step S4, takes two consecutive data identifiers in the egress total queue as the decision point, and determines the continuity of the two consecutive data identifiers in the ingress main queue;

[0011] Step S6, the data output module, when the proofreading mechanism module of step S5 determines that the continuity is consistent, outputs the total number of identifiers of the current sorting queue.

[0012] As a further improvement of the present invention, the specific method for calculating the total number of identifiers of the sorting queue is: setting the current data identifier in the export total queue as a traceable unit, if the data identifier that is the same as the traceable unit is traced back from the import main queue, the tracing is valid, and further calculating the sum of the number of data identifiers identified by the import main queue at the import position and the number of data identifiers identified by all import insertion queues at the import position between the time when the data identifier is identified at the import position and the time when the data identifier is identified at the export position, which is the total number of identifiers of the current sorting queue.

[0013] As a further improvement of the present invention, in step S3, the trigger mechanism module sets at least one mode, or a fixed time moment trigger mechanism mode, or a logo change trigger mechanism mode, or a mixed trigger mechanism mode.

[0014] As a further improvement of the present invention, in step S4, if the traceability in the entry main queue fails for two consecutive times, it is necessary to return to step S2, re-execute the queue sorting module, and define a new entry main queue.

[0015] As a further improvement of the present invention, the condition for the establishment of the inlet main queue is that the number of data identifiers in the inlet queue is the largest and the change rate of the data identifiers identified by the corresponding inlet positions is the highest.

[0016] As a further improvement of the present invention, there is at least one method for presetting the inlet main queue, either a manual presetting method or an inlet main queue trial calculation method.

[0017] As a further improvement of the present invention, the ingress main queue trial calculation method is that when a certain ingress queue meets the ingress main queue trial calculation rule, the ingress queue is defined as the ingress main queue, and other ingress queues are defined as ingress insertion queues.

[0018] As a further improvement of the present invention, the hybrid trigger mechanism module cross-executes the fixed time moment trigger mechanism mode and the identification change trigger mechanism mode when a trigger condition is met.

[0019] As a further improvement of the present invention, the identification quantity calculation module satisfies the following rules: 1) the entry position and the exit position are both based on the principle of single passage; 2) the sorting queue should follow the single queue sorting principle; 3) each data identification entering the sorting queue from the entry position must leave the sorting queue from the exit position in sequence.

[0020] Compared with the prior art, the beneficial effects of the present invention are: timely clearing, real-time calculation, and continuous proofreading, which avoids the possibility of historical error accumulation, effectively improves the accuracy of quantitative statistics, and greatly reduces the physical errors caused by the identification device. BRIEF DESCRIPTION OF THE DRAWINGS

[0021] Figure 1 A schematic diagram of the implementation steps of a dynamic queue quantity calculation method of the present invention;

[0022] Figure 2 This is a schematic diagram of the specific implementation steps of the queue sorting module;

[0023] Figure 3 It is a schematic diagram of the specific implementation steps of the identification quantity calculation module;

[0024] Figure 4 It is a calculation logic diagram in the identification quantity calculation module;

[0025] Figure 5This is a schematic diagram of the specific implementation steps of the proofreading mechanism module. DETAILED DESCRIPTION

[0026] The present invention is described in detail below in conjunction with the various embodiments shown in the accompanying drawings, but it should be noted that these embodiments are not limitations of the present invention, and any equivalent transformations or substitutions in functions, methods, or structures made by ordinary technicians in the field based on these embodiments are all within the scope of protection of the present invention.

[0027] Please refer to Figure 1-5 As shown, a specific implementation of a dynamic queue-jumping inventory algorithm of the present invention is shown.

[0028] This dynamic queue-jumping inventory algorithm should meet the following rules in actual application scenarios: 1) Each queue entry and exit position should be based on the principle of a single individual passing through; 2) The sorting queue should follow the single queue sorting principle; 3) Each unit enters the sorting queue from the entry position and leaves the queue from the exit position in turn.

[0029] Step S1, executing the data identification acquisition module 100, using the identification device to acquire the entry data identification of the entering sorting queue at the entry position, and acquire the exit data identification of the leaving sorting queue at the exit position.

[0030] Step S2, execute the queue sorting module 200. Due to the different entry positions, several entry queues are formed. According to the trial calculation method of the preset main queue, there is an entry main queue, and other entry queues are entry insertion queues. There can be multiple exit positions to form several exit queues; because the order in which the data identifiers leave the sorting queue is fixed, multiple exit queues can be merged into an exit total queue according to the order of leaving time.

[0031] Step S3, the trigger mechanism module 300 has three modes, one is a fixed time moment trigger mechanism mode: a trigger mechanism mode based on the time difference reaching the set fixed time moment; one is an identifier change trigger mechanism mode: a trigger mechanism mode based on the change of individual data identifiers in the export total queue; and another is a mixed trigger mechanism mode: when the time difference between two individual data identifiers that have changed in the export total queue is greater than the set fixed time moment, the fixed time moment trigger mechanism mode is executed, otherwise, the identifier change trigger mechanism mode is executed.

[0032] Step S4, execute the identification quantity calculation module 400, refer to Figure 3, set the current data identifier in the exit total queue as a traceable unit. If the data identifier that is the same as the traceable unit is traced back from the entry main queue, then the traceability is valid. Further calculate the sum of the number of data identifiers identified by the entry main queue at the entry position and the number of data identifiers identified by all entry plug-in queues at the entry position between the time when the data identifier is identified at the entry position and the time when the data identifier is identified at the exit position, which is the total number of identifiers in the current sorting queue. If the data identifier that is the same as the traceable unit cannot be traced back from the entry main queue, then the traceability is invalid, and return to the exit total queue to locate the next data identifier as the traceable unit, and continue to match it with the data identifier of the entry main queue. If the traceability fails to be valid in the entry main queue for two consecutive times, it is necessary to return to step S2, re-execute the queue sorting module 200, and define a new entry main queue.

[0033] Step S5, when the total number of identifiers of the current sorting queue is calculated in step S4, the proofreading mechanism module 500 is executed, referring to Figure 5 According to the data identifier Y in the export total queue that can be traced back in step S4, extract the next data identifier Y1 in the export total queue, which can also be traced back in the inlet main queue, and then execute step S6. Otherwise, the total number of identifiers in the sorting queue is cleared and return to step S4.

[0034] Step S6, executing the data output module 600 to output the total number of identifiers of the queue.

[0035] Specifically, refer to Figure 2 In the queue sorting module 200 of step S2, the preset entry main queue needs to meet at least two conditions: 1) The entry queue has the largest number of data identifiers, and the change rate of the data identifiers identified by the corresponding entry position is the highest. There are two methods for presetting the entry main queue: 1) Manual presetting method: Among several entry queues, a certain entry queue is designated as the entry main queue. In particular, the designated entry main queue still needs to meet the above two conditions for the establishment of the entry main queue. 2) Entry main queue trial calculation method: Figure 2 As shown, if the manual preset method is not executed, the inlet main queue trial calculation method is executed. Through the quick matching of each inlet queue, if a certain inlet queue meets the inlet main queue trial calculation rule, it is defined as the inlet main queue, and the other inlet queues are defined as inlet insertion queues. Regarding the egress queue, since the sorting queue in this algorithm is a single queue mode, and the way to leave the sorting queue adopts the principle of passing through in sequence, all egress queues can be merged into the egress total queue according to the time sequence corresponding to their data identifiers.

[0036] Reference Figure 4, with regard to the specific operation method of the identification number calculation module 400, the data identification in the inlet main queue is defined as (X, T), the data identification in the inlet plug queue (0-n) is defined as (X(n)', T(n)'), and the data identification of the traceable unit in the egress total queue is defined as (Y, T"); the time T" of the data identification (Y, T") of the traceable unit in the egress total queue is used as the time node, and the data identification that last enters the sorting queue before the time T" in the inlet main queue is marked as (X0, T0), that is, i=0; the data identification that last enters the sorting queue before the time T" in the inlet plug queue is marked as (X(n)0', T(n)0'), that is, j=0. In the inlet main queue, the data identification X i Match the data identifier Y of the traceable unit of the egress main queue in sequence. If the match fails, execute the i=i+1 command to loop the match until the data identifier (X) of the traceable unit of the ingress and egress main queue is successfully matched. i ,T i ), and obtain the first identification number N0=i. Then, in other inlet insertion queues (0-n), the time T(n) in the data identification in the inlet insertion queue is used in turn. j 'The time T of the data identification of the traceability unit in the entry main queue i For comparison, if T(n) j '≥T i , then execute command j=j+1; if T(n) j '<T i , then execute the command N(n)'=j, and obtain the nth identification number N(n)'=j. Finally, through the addition operation, the total identification number is N=N0+N(1)'+N(2)'+…+N(n)'.

[0037] This calculation method has extremely high efficiency and accuracy when the entrance main queue has a large number of data identifiers and the entrance insertion queue has a very small number of data identifiers. It is very beneficial for applications in the field of public queuing.

[0038] The following is a scenario of a single entry and single exit: the incoming vehicles queue up at the airport pick-up area to further illustrate the implementation of this algorithm:

[0039] Example 1: A single-queue one-way channel for foreign vehicles is set up at the airport, with an entrance and an exit at the airport entrance area. Each foreign vehicle is sorted in the specified channel and leaves from the exit. For airport vehicle control, real-time acquisition of the number of foreign vehicles in the channel plays an important role in the airport's capacity control. This algorithm can be used to quickly and real-time obtain the actual number of foreign vehicles in the airport channel, that is, the inventory number. The specific implementation steps are as follows:

[0040] Step 1: Install license plate number recognition devices at the entrance and exit positions, and use the license plate number of each car as a data identifier.

[0041] Step 2: The queues that enter the channel from the entry position are the entry main queue, and the queues that leave the channel from the exit position are the exit total queue.

[0042] Step 3: When a new license plate number A is recognized at the exit, the corresponding time point is T".

[0043] Step 4: The total inventory quantity is cleared, and the new license plate number B identified at the entrance position is marked at the corresponding time point T0. Starting from the license plate number B in the entrance total queue, the license plate number A in the entrance total queue is traced back. The number of traced back is the number of data identifiers in the sorting queue, which is the inventory quantity in actual application. This real-time clearing and real-time inventory calculation method can effectively avoid the historical accumulation error rate in traditional algorithms and improve the timeliness and accuracy of real-time inventory quantity statistics.

[0044] Step 5, find the previous data license plate number C of license plate number A from the total queue of the exit. If the license plate number C is the same as the previous data license plate number D of license plate number A found by tracing back from the total queue of the entrance, the inventory quantity calculation is valid, and step 6 is executed. This method of using continuous identification number proofreading can effectively reduce the error rate caused by the immutable factor that the recognition rate of the recognition device cannot meet 100%. For example, if the single recognition accuracy rate is 97%, the error rate is 3%. Through this continuous identification number proofreading method, the error rate is reduced to 0.09%.

[0045] Step 6: Execute the command to output the inventory quantity, which is the real-time number of vehicles in the current airport channel.

[0046] Embodiment 2 is different from Embodiment 1 in that, in real application scenarios, there are generally cases of queue insertion at different positions in the sorting queue in the inlet queue. In view of this situation, in step 2, according to the number of circulations and the speed of circulation of all inlet queues, the inlet main queue and several inlet insertion queues are sorted. Among them, the one with the largest number of circulations and the fastest circulation speed is the inlet main queue, and the others are inlet insertion queues.

[0047] In step 4, the main entrance queue is used as the traceability object. If the license plate number identified from the exit position enters the sorting queue from the main entrance queue, it is a valid traceable unit. Otherwise, the next license plate number is defined from the exit queue as the traceable unit. The first inventory quantity of the main entrance queue is calculated using the license plate number identifier of the valid traceable unit. Then, the nth inventory quantity entering the sorting queue of each entrance insertion queue is calculated from the moment when the license plate number identifier of the traceable unit enters the sorting queue to the moment when the license plate number identifier leaves the sorting queue. Finally, the total inventory quantity from the total entrance queue and each entrance insertion queue is counted using addition operation.

[0048] Embodiment 3 is different from Embodiment 2 in that, in real application scenarios, in addition to the possibility of queue jumping at different positions in the sorting queue, in order to speed up the flow of the sorting queue, several exit queues can be added at the exit. In view of this situation, on the basis of step 2 of Embodiment 2, several exit queues are sorted and merged into an exit total queue in sequence according to the time when each data identifier leaves the sorting queue.

[0049] Embodiment 4 is different from the above embodiments in that, in addition to being applicable to physical queuing scenarios in public places, this algorithm can also be transplanted to virtual queuing scenarios.

[0050] The series of detailed descriptions listed above are only specific descriptions of feasible implementation methods of the present invention. They are not intended to limit the scope of protection of the present invention. Any equivalent implementation methods or changes that do not deviate from the technical spirit of the present invention should be included in the scope of protection of the present invention.

[0051] It will be apparent to those skilled in the art that the invention is not limited to the details of the exemplary embodiments described above and that the invention can be implemented in other specific forms without departing from the spirit or essential features of the invention. Therefore, the embodiments should be considered exemplary and non-limiting in all respects, and the scope of the invention is defined by the appended claims rather than the foregoing description, and it is intended that all variations falling within the meaning and scope of the equivalent elements of the claims be included in the invention. Any reference numeral in a claim should not be considered as limiting the claim to which it relates.

[0052] In addition, it should be understood that although the present specification is described according to implementation modes, not every implementation mode contains only one independent technical solution. This description of the specification is only for the sake of clarity. Those skilled in the art should regard the specification as a whole. The technical solutions in each embodiment may also be appropriately combined to form other implementation modes that can be understood by those skilled in the art.

Claims

1. A dynamic queuing quantity calculation method, characterized in that: The steps include: Step S1, a data identification module uses an identification device to obtain an entry data identification of a queue entering the sorting queue at an entry position, and obtains an exit data identification of a queue leaving the sorting queue at an exit position; Step S2, queue arrangement module, the inlet data identifier forms an inlet queue, the outlet data identifier forms an outlet queue, the inlet queue is at least one, and one of them is preset as the inlet main queue, and the outlet queues are superimposed and merged into an outlet total queue; Step S3, triggering mechanism module, triggering step S4 to calculate the total number of identifiers of the sorting queue according to the change of the data identifier in the fixed time moment or the total exit queue; Step S4, the identifier quantity calculation module uses the current data identifier of the total exit queue as the starting point for calculation, and calculates the total number of identifiers that enter the sorting queue from all entry queues during the time period from when the data identifier enters the sorting queue to when it leaves the sorting queue; Step S5, the proofreading mechanism module, when the total number of identifiers of the sorting queue is calculated in step S4, takes two consecutive data identifiers in the egress total queue as the decision point, and determines the continuity of the two consecutive data identifiers in the ingress main queue; Step S6, the data output module, when the proofreading mechanism module of step S5 determines that the continuity is consistent, outputs the total number of identifiers in the current sorting queue; The specific calculation method for the total number of identifiers of the sorting queue is: set the current data identifier in the export total queue as a traceable unit. If the data identifier that is the same as the traceable unit is traced back from the import main queue, the tracing is valid. Further calculate the sum of the number of data identifiers identified by the import main queue at the import position and the number of data identifiers identified by all import insertion queues at the import position between the time when the data identifier is identified at the import position and the time when the data identifier is identified at the export position, which is the total number of identifiers of the current sorting queue.

2. A dynamic queuing number calculation method according to claim 1, characterized in that: In step S3, the trigger mechanism module sets at least one mode, or a fixed time trigger mechanism mode, or a logo change trigger mechanism mode, or a mixed trigger mechanism mode.

3. A dynamic queuing number calculation method according to claim 1, characterized in that: In step S4, if the traceability fails to be effective in the entry main queue for two consecutive times, it is necessary to return to step S2, re-execute the queue arrangement module, and define a new entry main queue.

4. A dynamic queuing number calculation method according to claim 1, characterized in that: The establishment condition of the inlet main queue is that the number of data identifiers in the inlet queue is the largest and the change rate of the data identifiers identified by the corresponding inlet position is the highest.

5. A dynamic queuing number calculation method according to claim 4, characterized in that: There is at least one method for presetting the entry main queue, either a manual presetting method or an entry main queue trial calculation method.

6. A dynamic queuing number calculation method according to claim 5, characterized in that: The ingress main queue trial calculation method is that when a certain ingress queue meets the ingress main queue trial calculation rule, the ingress queue is defined as the ingress main queue, and other ingress queues are defined as ingress insertion queues.

7. A dynamic queuing number calculation method according to claim 2, characterized in that: The hybrid trigger mechanism mode is to cross-execute the fixed time moment trigger mechanism mode and the identification change trigger mechanism mode when the trigger condition is met.

8. A dynamic queuing number calculation method according to any one of claims 1 to 7, characterized in that: The identification quantity calculation module must meet the following rules at the same time: 1) the entry position and the exit position are both based on the principle of single pass; 2) the sorting queue should follow the single queue sorting principle; 3) each data identifier entering the sorting queue from the entry position must leave the sorting queue from the exit position in sequence.

Images