Antenna polling order determination method and apparatus, electronic device, and storage medium
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- AISINO CORPORATION
- Filing Date
- 2022-11-21
- Publication Date
- 2026-06-02
Smart Images
Figure CN115860018B_ABST
Abstract
Description
Technical Field
[0001] This application relates to the field of transportation technology, and in particular to a method, apparatus, electronic device, and storage medium for determining antenna polling order. Background Technology
[0002] Radio Frequency Identification (RFID) is a type of automatic identification technology that uses wireless radio frequency for non-contact, two-way data communication. It reads and writes records (electronic tags or RFID cards) using radio frequency to achieve the purpose of identifying targets and exchanging data.
[0003] Currently, automated toll collection robots utilize radio frequency technology to achieve automatic toll collection.
[0004] However, the automatic toll collection robot is equipped with multiple sets of radio frequency antennas. Depending on the vehicle model, the multiple antennas will poll and search for radio frequency cards in a fixed order to complete the transaction. If no radio frequency card is detected on the polled antenna, the process will continue to switch to the next antenna and repeat the operation of searching for radio frequency cards, which results in a long time for the automatic toll collection operation. Summary of the Invention
[0005] In view of this, embodiments of this application provide an antenna polling order determination method, apparatus, electronic device, and storage medium to at least partially solve the above-mentioned problems.
[0006] According to a first aspect of the embodiments of this application, an antenna polling order determination method is provided. The method includes: acquiring historical antenna identification data of a target time combination, wherein the time combination includes at least one of a month, weekday, time period, and holiday, and the historical antenna identification data includes the number of times each of at least two antennas in the corresponding time combination has been successfully identified; determining the antenna polling order corresponding to the target time combination based on the historical antenna identification data; and upon entering the target time combination again, sequentially identifying the identification object through the at least two antennas according to the antenna polling order corresponding to the target time combination until the identification object is successfully identified.
[0007] In one possible implementation, determining the antenna polling order corresponding to the target time combination based on the historical antenna identification data includes: obtaining the number of times each antenna was successfully identified in the past Q target time combinations based on the historical antenna identification data, where Q is a positive integer greater than or equal to 3; and determining the antenna polling order corresponding to the target time combination based on the number of times each antenna was successfully identified in the past Q target time combinations.
[0008] In one possible implementation, determining the antenna polling order corresponding to the target time combination based on the number of times each antenna was successfully identified within the past Q target time combinations includes:
[0009] Based on the number of times each antenna successfully identified the target within the past Q target time combinations, the average number of times each antenna successfully identified the target within the past n target time combinations is calculated using the following formula; T j,(N-p) The average number of successful antenna recognitions for the j-th antenna corresponding to the Np-th target time combination in the past, where p is a positive integer greater than or equal to 0 and less than or equal to n-1, and the N-th target time combination is the most recent historical target time combination; S j,(N-p-i+1) Used to characterize the number of times the j-th antenna successfully identifies a target within the past Np-i+1 target time combination; m is a positive integer greater than or equal to 2, and Q = m + n - 1; α i Used to characterize the weighting coefficients; the antenna polling order corresponding to the target time combination is calculated based on the average number of successful identifications of each antenna within the past n target time combinations.
[0010] In one possible implementation, α i >α i+1 .
[0011] In one possible implementation, calculating the antenna polling order corresponding to the target time combination based on the average number of successful identifications of each antenna within the past n target time combinations includes: predicting the number of successful identifications of each antenna in the next target time combination using a simple smoothing prediction method based on the average number of successful identifications of each antenna within the past n target time combinations; sorting each antenna in descending order of the number of successful identifications of each antenna in the next target time combination; and determining the sorting result as the antenna polling order corresponding to the target time combination.
[0012] In one possible implementation, the method further includes, after the Np-i+1th target time combination ends, performing the steps of acquiring historical antenna identification data of the target time combination and determining the antenna polling order corresponding to the target time combination based on the historical antenna identification data.
[0013] According to a second aspect of the embodiments of this application, an antenna polling order determination device is provided, comprising: an acquisition module, configured to acquire historical antenna identification data of a target time combination, wherein the time combination includes at least one of a month, weekday, time period, and holiday, and the historical antenna identification data includes the number of times each of at least two antennas in the corresponding time combination has been successfully identified; a determination module, configured to determine the antenna polling order corresponding to the target time combination based on the historical antenna identification data; and an application module, configured to, upon entering the target time combination again, sequentially identify an object through the at least two antennas according to the antenna polling order corresponding to the target time combination until the object is successfully identified.
[0014] According to a third aspect of the embodiments of this application, an automatic toll collection robot is provided, including: an antenna polling order determination device as described in the second aspect of the embodiments of this application.
[0015] According to a fourth aspect of the present application, an electronic device is provided, comprising: a processor, a memory, a communication interface, and a communication bus, wherein the processor, the memory, and the communication interface communicate with each other via the communication bus; the memory is used to store at least one executable instruction, wherein the executable instruction causes the processor to perform an operation corresponding to the method described in the first aspect.
[0016] According to a fifth aspect of the embodiments of this application, a computer storage medium is provided having a computer program stored thereon, which, when executed by a processor, implements the method described in the first aspect.
[0017] According to the antenna polling order determination method provided in the embodiments of this application, the polling order of the antennas in the next target time combination can be determined by using the historical antenna identification data of the target time combination. This allows the antennas to be switched according to the determined antenna polling order when entering the target time combination again, thereby enabling some antennas in the target time combination to be identified first. After successful identification, the antenna polling stops, which optimizes the antenna polling order, reduces the number of antenna switching, and reduces the occurrence of multiple antenna switching when identifying the object, thereby reducing the time spent on identifying the object. Attached Figure Description
[0018] To more clearly illustrate the technical solutions in the embodiments of this application or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments recorded in the embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings.
[0019] Figure 1This is a flowchart of an antenna polling order determination method provided in an embodiment of this application;
[0020] Figure 2 This is a schematic diagram of an antenna connection relationship provided in an embodiment of this application;
[0021] Figure 3 This is a schematic diagram of an antenna polling order determination device provided in an embodiment of this application;
[0022] Figure 4 This is a schematic diagram of an automatic toll collection robot provided in an embodiment of this application;
[0023] Figure 5 This is a schematic diagram of the structure of an electronic device provided in an embodiment of this application. Detailed Implementation
[0024] To enable those skilled in the art to better understand the technical solutions in the embodiments of this application, the technical solutions in the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, and not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art should fall within the protection scope of the embodiments of this application.
[0025] The terminology used in this application is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. The singular forms “a,” “the,” and “the” used in this application and the appended claims are also intended to include the plural forms unless the context clearly indicates otherwise. It should also be understood that the term “and / or” as used herein refers to and includes any or all possible combinations of one or more of the associated listed items.
[0026] It should be understood that although the terms first, second, third, etc., may be used in this application to describe various information, such information should not be limited to these terms. These terms are only used to distinguish information of the same type from one another. For example, without departing from the scope of this application, first information may also be referred to as second information, and similarly, second information may also be referred to as first information. Depending on the context, the word "if" as used herein may be interpreted as "when," "when," or "in response to determination."
[0027] Figure 1 This is a flowchart of an antenna polling order determination method provided in an embodiment of this application, such as... Figure 1 As shown, the method includes the following steps 101 to 103:
[0028] Step 101: Obtain historical antenna identification data for the target time combination.
[0029] Time combinations include at least one of month, weekday, time period, and holiday. For example, Monday morning 8:00 to Monday night 10:00 is one time combination, Monday night 10:00 to Tuesday morning 8:00 is another time combination, and so on. For example, Table 1 shows date and time period combinations for a week, and Table 2 shows date and time period combinations for weekdays and holidays.
[0030] Table 1
[0031]
[0032] Table 2
[0033]
[0034] It should be understood that the above table is only an example of time combination division, and this application does not limit the specific division method. For example, Table 2 and Table 1 can be combined to perform three-dimensional division of time combinations, etc.
[0035] Historical antenna identification data includes the number of times each antenna in at least two antennas was successfully identified within a corresponding time combination. This historical identification data consists of multiple antenna identification data within the corresponding time combination. Taking combination 1 in Table 1 as an example, the historical antenna identification data for combination 1 includes the number of identifications for each antenna within the date and time period corresponding to combination 1, such as the identification data for each antenna from 22:00 to 06:00 last Monday, the identification data for each antenna from 22:00 to 06:00 the Monday before last, and so on. For example, Table 3 is a data aggregation table for several time period combinations, showing the historical antenna identification data for each antenna in different combinations. It should be understood that Table 3 is only an example and does not limit this application in any way.
[0036] Table 3
[0037]
[0038] Step 102: Determine the antenna polling order corresponding to the target time combination based on historical antenna identification data.
[0039] Based on the historical antenna identification data of the target time combination, the polling order of the antenna within the time corresponding to the target time combination is determined, and the polling order is stored in the storage medium (e.g., flash memory).
[0040] It should be understood that since the antenna polling order corresponding to the target time combination needs to be applied when entering the target time combination again, this determination process can be completed at any time after the end of the previous target time combination and before the next entry into the target time combination.
[0041] Step 103: After entering the target time combination again, the object to be identified is identified through at least two antennas in sequence according to the antenna polling order corresponding to the target time combination until the object to be identified is successfully identified.
[0042] Upon reaching the target time combination again, the antenna polling sequence is read from the storage medium and applied. Based on the antenna polling sequence corresponding to the target time combination, the object is identified sequentially through at least two antennas until it is successfully identified. For example, if there are four antennas and the calculated polling sequence is antenna 2, antenna 3, antenna 1, antenna 4, then upon reaching the target time combination again, each object will be polled using the sequence 2314. When identifying an object, once an antenna is polled (e.g., antenna 3 successfully identifies the object), the polling ends, and no further polling is performed on that object. The same applies to other objects.
[0043] For example, Figure 2 This is a schematic diagram of an antenna connection relationship provided in an embodiment of this application, as shown below. Figure 2 As shown, four antennas are connected to an antenna switcher, and a microcontroller is connected to the antenna switcher. The microcontroller is used to process and store antenna identification data. Each successful identification is recorded, including the identification date, identification time, and corresponding antenna. Upon reaching a specific time combination, the microcontroller reads the antenna polling sequence from the storage medium and controls the antenna switching controller to switch between multiple antennas. The antenna switching controller can switch between multiple antennas using methods such as inputting I / O levels; the specific switching method is not limited in this application. It should be understood that... Figure 2 This is merely an example of antenna control and does not limit the scope of this application.
[0044] In this embodiment, the polling order of the antennas for the next target time combination can be determined by using historical antenna identification data of the target time combination. This allows the antennas to be switched according to the determined antenna polling order when entering the target time combination again, thereby enabling some antennas within the target time combination to be identified first. After successful identification, the antenna polling stops, which optimizes the antenna polling order, reduces the number of antenna switching, and reduces the occurrence of multiple antenna switching when identifying the object, thus reducing the time spent on identifying the object.
[0045] In one possible implementation, when determining the antenna polling order corresponding to the target time combination based on historical antenna identification data, the number of times each antenna was successfully identified in the past Q target time combinations can be obtained from the historical antenna identification data, where Q is a positive integer greater than or equal to 3. Then, the antenna polling order corresponding to the target time combination is determined based on the number of times each antenna was successfully identified in the past Q target time combinations.
[0046] Based on the historical antenna identification data corresponding to the target time combination, select the number of times each antenna was successfully identified in at least three past target time combinations. For example, obtain the number of times each antenna was successfully identified in the last target time combination, the number of times each antenna was successfully identified in the target time combination two years ago, etc. Based on the number of times each antenna was successfully identified in the selected at least three target time combinations, determine the antenna polling order corresponding to the target time combination.
[0047] It should be noted that the time combination includes at least one of month, week, time period and holiday. Therefore, the same target time combination will be passed multiple times. Taking combination 1 in Table 1 of the above embodiment as an example, combination 1 will be passed once every week. After the antenna is successfully identified, the information of successful identification and the corresponding antenna will be stored. Therefore, the number of times the antenna was successfully identified corresponding to at least three target time combinations in the past can be obtained.
[0048] In this embodiment of the application, the number of times each antenna successfully identifies a target within at least three past time combinations is obtained. This allows the polling order of the antennas to be determined based on the number of times each antenna successfully identifies a target, thus realizing the determination of the antenna polling order. Furthermore, by determining the antenna polling order based on the number of times each antenna successfully identifies a target, some antennas can be prioritized for polling, improving the practicality of the polling order and reducing the time required to identify the target.
[0049] In one possible implementation, when determining the antenna polling order corresponding to the target time combination based on the number of times each antenna was successfully identified within the past Q target time combinations, the average number of successful identifications of each antenna within the past n target time combinations can be calculated using the following formula based on the number of successful identifications of each antenna within the past Q target time combinations.
[0050]
[0051] T j,(N-p) The average number of successful antenna recognitions for the j-th antenna corresponding to the Np-th target time combination in the past, where p is a positive integer greater than or equal to 0 and less than or equal to n-1, and the N-th target time combination is the most recent historical target time combination; S j,(N-p-i+1)Used to characterize the number of times the j-th antenna successfully identifies a target within the past Np-i+1 target time combination; m is a positive integer greater than or equal to 2, and Q = m + n - 1, α i Used to characterize weighting coefficients.
[0052] Then, based on the average number of successful identifications of each antenna within the past n target time combinations, the antenna polling order corresponding to the target time combination is calculated.
[0053] For example, when p is 0, that is This represents the average number of successful identifications of the j-th antenna corresponding to the N-th target time combination. In this case, if m is 4, then the number of successful identifications of the j-th antenna corresponding to the N-th target time combination, the (N-1)-th target time combination, the (N-2)-th target time combination, and the (N-3)-th target time combination are selected. That is, the average number of successful identifications of the j-th antenna is calculated by using the number of successful identifications of the j-th antenna in the past four times.
[0054] It should be understood that since the average value is generally calculated using more than two values, m is a positive integer greater than or equal to 2. Furthermore, since it is necessary to calculate the average number of successful identifications by each antenna within the past n target time combinations, each average value requires m data points. Therefore, the chosen value is Q = m + n - 1. For example, if three average values need to be calculated (n = 3), and each average value requires four data points (m = 4), then at least six target time combinations need to be selected, i.e., Q = m + n - 1 = 3 + 4 - 1 = 6. In this case, the first average value can be calculated from the 6th to the 3rd data point, the second average value from the 5th to the 2nd data point, the third average value from the 4th to the 1st data point, and so on.
[0055] In this embodiment, the average number of successful identifications of each antenna within the past n target time combinations is calculated using a pre-set formula, and the antenna polling order corresponding to the target time combination is calculated based on the n average values, thus determining the polling order. Furthermore, since the calculation is based on multiple sets of average values, the calculation results are more accurate, making the determined polling order more practical and reducing the occurrence of multiple antenna switching when identifying the object, thereby reducing the time required to identify the object.
[0056] In one possible implementation, α i >α i+1 .
[0057] The weights for recent periods are set to be greater than those for distant periods. Taking the formula in the above embodiment as an example, when p is 0, that is... When i = 1, the Nth target time combination is selected, and the corresponding weight coefficient is α1. When i = 2, the (N-1)th target time combination is selected, and the corresponding weight coefficient is α2. Since the time of the Nth target time combination is after the time of the (N-1)th target time combination, the weight coefficient α1 of the Nth target time combination that is closest to the next target time combination is greater than the weight coefficient α2 of the (N-1)th target time combination that is before the Nth target time combination, that is, α1 > α2.
[0058] In this embodiment of the application, α is set i >α i+1 The weighting coefficients for the number of successful identifications by each antenna within the target time combination are higher the closer to the next entry into the target time combination. This emphasizes that the reference significance of recent data is greater than that of long-term data. Therefore, the calculated antenna polling order is more practical, improving the usability of the polling order and reducing the occurrence of multiple antenna switching when identifying the object. This reduces the time required to identify the object.
[0059] In one possible implementation, when calculating the antenna polling order corresponding to the target time combination based on the average number of successful identifications of each antenna in the past n target time combinations, the average number of successful identifications of each antenna in the past n target time combinations can be used to predict the number of successful identifications of each antenna in the next target time combination using a simple smoothing prediction method. Then, the antennas are sorted in descending order of the number of successful identifications of each antenna in the next target time combination, and the sorting result is determined as the antenna polling order corresponding to the target time combination.
[0060] The average number of successful identifications of each antenna within n target time combinations is used to predict the predicted number of successful identifications of each antenna in the next target time combination using a simple smoothing prediction method. Since n averages are used, and each average uses multiple sets of historical antenna identification data, the predicted number of successful identifications of each antenna is meaningful. The antennas are sorted in descending order based on the predicted number of successful identifications, and the sorting result is used as the antenna polling order.
[0061] It should be understood that the number of successful identifications by each antenna varies depending on the location of the object being identified. Taking automatic toll collection on highways as an example, assuming that the number of large vehicles passing by is much greater than the number of small vehicles passing by in the time period included in the target time combination, the number of successful identifications by antennas set for the location of large vehicle cabs in this time combination is much greater than the number of successful identifications by antennas set for the location of small vehicle cabs in this time combination.
[0062] In this embodiment, the antenna polling order corresponding to the target time combination is determined based on the average number of successful identifications of each antenna within the past n target time combinations. The antenna with the highest average number of successful identifications is prioritized for identification, making the antenna polling order more scientific. This reduces the occurrence of multiple antenna switching during each identification, improves the efficiency of identifying the object, and reduces the time required for identifying the object.
[0063] In one possible implementation, when the Np-i+1th target time combination ends, the historical antenna identification data of the target time combination is obtained and the antenna polling order corresponding to the target time combination is determined based on the historical antenna identification data.
[0064] In this embodiment, the next antenna polling order for entering the target time combination is calculated immediately after the target time combination ends, ensuring the accuracy of the data and making the generated antenna polling order more scientific, thereby reducing the time for identifying the target.
[0065] Figure 3 This is a schematic diagram of an antenna polling order determination device provided in an embodiment of this application, as shown below. Figure 3 As shown, the device 300 includes:
[0066] The acquisition module 301 is used to acquire historical antenna identification data for a target time combination, wherein the time combination includes at least one of month, weekday, time period and holiday, and the historical antenna identification data includes the number of times each antenna in at least two antennas was successfully identified within the corresponding time combination.
[0067] The determination module 302 is used to determine the antenna polling order corresponding to the target time combination based on historical antenna identification data.
[0068] Application module 303 is used to identify the object through at least two antennas in sequence according to the antenna polling order corresponding to the target time combination after the next entry into the target time combination, until the object is successfully identified.
[0069] In this embodiment of the application, the acquisition module 301 can be used to execute step 101 in the above method embodiment, the determination module 302 can be used to execute step 102 in the above method embodiment, and the application module 303 can be used to execute step 103 in the above method embodiment.
[0070] In one possible implementation, the determining module 302 can be used to obtain, based on the historical antenna identification data, the number of times each antenna was successfully identified within the past Q target time combinations, where Q is a positive integer greater than or equal to 3; and to determine the antenna polling order corresponding to the target time combination based on the number of times each antenna was successfully identified within the past Q target time combinations.
[0071] In one possible implementation, the determining module 302 can be used to calculate the average number of successful identifications of each antenna in the past n target time combinations based on the number of successful identifications of each antenna in the past Q target time combinations using the following formula; T j,(N-p) The average number of successful antenna recognitions for the j-th antenna corresponding to the Np-th target time combination in the past, where p is a positive integer greater than or equal to 0 and less than or equal to n-1, and the N-th target time combination is the most recent historical target time combination; S j,(N-p-i+1) Used to characterize the number of times the j-th antenna successfully identifies a target within the past Np-i+1 target time combination; m is a positive integer greater than or equal to 2, and Q = m + n - 1; α i Used to characterize the weighting coefficients; the antenna polling order corresponding to the target time combination is calculated based on the average number of successful identifications of each antenna within the past n target time combinations.
[0072] In one possible implementation, α i >α i+1 .
[0073] In one possible implementation, the determining module 302 can be used to predict the number of times each antenna will be successfully identified in the next target time combination based on the average number of successful identifications of each antenna in the past n target time combinations using a simple smoothing prediction method; sort the antennas in descending order of the number of successful identifications of each antenna in the next target time combination; and determine the sorting result as the antenna polling order corresponding to the target time combination.
[0074] In one possible implementation, the determining module 302 can be used to perform the following steps after the Np-i+1th target time combination ends: obtaining historical antenna identification data of the target time combination and determining the antenna polling order corresponding to the target time combination based on the historical antenna identification data.
[0075] It should be noted that the information interaction and execution process between the modules in the above-mentioned antenna polling order determination device are based on the same concept as the aforementioned antenna polling order determination method embodiment. For details, please refer to the description in the aforementioned antenna polling order determination method embodiment, and will not be repeated here.
[0076] Figure 4 This is a schematic diagram of an automatic toll collection robot provided in an embodiment of this application, as shown below. Figure 4 As shown, the automatic toll collection robot 400 includes an antenna polling sequence determination device 300.
[0077] Reference Figure 5 This document illustrates a schematic diagram of an electronic device according to an embodiment of this application. The specific embodiments of this application do not limit the specific implementation of the electronic device.
[0078] like Figure 5 As shown, the electronic device may include: a processor 502, a communications interface 504, a memory 506, and a communications bus 508.
[0079] in:
[0080] The processor 502, communication interface 504, and memory 506 communicate with each other via communication bus 508.
[0081] Communication interface 504 is used to communicate with other electronic devices or servers.
[0082] The processor 502 is used to execute program 510, which can specifically execute the relevant steps in the above-described antenna polling order determination method embodiment.
[0083] Specifically, program 510 may include program code that includes computer operation instructions.
[0084] The processor 502 may be a central processing unit (CPU), a graphics processing unit (GPU), an application-specific integrated circuit (ASIC), or one or more integrated circuits configured to implement the embodiments of this application. The one or more processors included in the smart device may be processors of the same type, such as one or more CPUs; one or more GPUs; or they may be processors of different types, such as one or more CPUs, one or more GPUs, and one or more ASICs.
[0085] Memory 506 is used to store program 510. Memory 506 may include high-speed RAM memory, and may also include non-volatile memory, such as at least one disk storage device.
[0086] Specifically, program 510 can be used to cause processor 502 to execute the antenna polling order determination method in any of the foregoing embodiments.
[0087] The specific implementation of each step in procedure 510 can be found in the corresponding steps and units described in any of the aforementioned embodiments of the antenna polling order determination method, and will not be repeated here. Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working process of the devices and modules described above can be referred to the corresponding process descriptions in the aforementioned method embodiments, and will not be repeated here.
[0088] In this embodiment, the polling order of the antennas for the next target time combination can be determined by using historical antenna identification data of the target time combination. This allows the antennas to be switched according to the determined antenna polling order when entering the target time combination again, thereby enabling some antennas within the target time combination to be identified first. After successful identification, the antenna polling stops, which optimizes the antenna polling order, reduces the number of antenna switching, and reduces the occurrence of multiple antenna switching when identifying the object, thus reducing the time spent on identifying the object.
[0089] This application also provides a computer program product, including computer instructions that instruct a computing device to perform an operation corresponding to any of the methods in the above-described multiple method embodiments.
[0090] It should be noted that, depending on the implementation needs, the various components / steps described in the embodiments of this application can be broken down into more components / steps, or two or more components / steps or parts of the operation of components / steps can be combined into new components / steps to achieve the purpose of the embodiments of this application.
[0091] The methods described in the embodiments of this application can be implemented in hardware, firmware, or as software or computer code that can be stored in a recording medium (such as a CD-ROM, RAM, floppy disk, hard disk, or magneto-optical disk), or as computer code downloaded over a network that is originally stored in a remote recording medium or a non-transitory machine-readable medium and will be stored in a local recording medium. Thus, the methods described herein can be stored as software processing on a recording medium using a general-purpose computer, a dedicated processor, or programmable or dedicated hardware (such as an ASIC or FPGA). It is understood that the computer, processor, microprocessor controller, or programmable hardware includes storage components (e.g., RAM, ROM, flash memory, etc.) capable of storing or receiving software or computer code that, when accessed and executed by the computer, processor, or hardware, implements the antenna polling order determination method described herein. Furthermore, when a general-purpose computer accesses code used to implement the antenna polling order determination method shown herein, the execution of the code transforms the general-purpose computer into a dedicated computer for executing the antenna polling order determination method shown herein.
[0092] Those skilled in the art will recognize that the units and method steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of the embodiments of this application.
[0093] The above embodiments are only used to illustrate the embodiments of this application, and are not intended to limit the embodiments of this application. Those skilled in the art can make various changes and modifications without departing from the spirit and scope of the embodiments of this application. Therefore, all equivalent technical solutions also fall within the scope of the embodiments of this application, and the patent protection scope of the embodiments of this application should be defined by the claims.
Claims
1. A method for determining the antenna polling order, comprising: Acquire historical antenna identification data for a target time combination, wherein the time combination includes at least one of month, weekday, time period, and holiday, and the historical antenna identification data includes the number of times each antenna in at least two antennas was successfully identified within the corresponding time combination; Based on the historical antenna identification data, determine the antenna polling order corresponding to the target time combination; Upon entering the target time combination again, the identification object is sequentially identified through the at least two antennas according to the antenna polling order corresponding to the target time combination until the identification object is successfully identified. Determining the antenna polling order corresponding to the target time combination includes: obtaining the number of times each antenna was successfully identified in the past Q target time combinations based on the historical antenna identification data, where Q is a positive integer greater than or equal to 3; and calculating the average number of times each antenna was successfully identified in the past n target time combinations based on the number of times each antenna was successfully identified in the past Q target time combinations using the following formula. Used to characterize the past The average number of successful identifications by the j-th antenna corresponding to the target time combination. It is a positive integer greater than or equal to 0 and less than or equal to n-1, and the Nth target time combination is the most recent historical target time combination; Used to characterize the past The number of times the j-th antenna is successfully identified within the target time combination; m is a positive integer greater than or equal to 2, and Q = m + n - 1; Used to characterize weighting coefficients; The antenna polling order corresponding to the target time combination is calculated based on the average number of successful identifications of each antenna within the past n target time combinations.
2. The method according to claim 1, wherein, 。 3. The method according to claim 1, wherein, The step of calculating the antenna polling order corresponding to the target time combination based on the average number of successful identifications of each antenna within the past n target time combinations includes: Based on the average number of successful identifications of each antenna within the past n target time combinations, the number of successful identifications of each antenna within the next target time combination is predicted using a simple smoothing prediction method. The antennas are sorted in descending order of the number of times each antenna was successfully identified within the next target time combination. The sorting result is determined as the antenna polling order corresponding to the target time combination.
4. The method according to claim 1, wherein, The method further includes: When the After the target time combination is completed, the following steps are performed: obtaining historical antenna identification data for the target time combination and determining the antenna polling order corresponding to the target time combination based on the historical antenna identification data.
5. An antenna polling order determination device, comprising: The acquisition module is used to acquire historical antenna identification data for a target time combination, wherein the time combination includes at least one of month, weekday, time period and holiday, and the historical antenna identification data includes the number of times each antenna in at least two antennas was successfully identified within the corresponding time combination; The determination module is used to determine the antenna polling order corresponding to the target time combination based on the historical antenna identification data; The application module is used to identify the object through at least two antennas sequentially according to the antenna polling order corresponding to the target time combination after the next entry into the target time combination, until the object is successfully identified. The determining module is further configured to obtain, based on the historical antenna identification data, the number of times each antenna was successfully identified within the past Q target time combinations, where Q is a positive integer greater than or equal to 3; and to calculate, based on the number of times each antenna was successfully identified within the past Q target time combinations, the average number of times each antenna was successfully identified within the past n target time combinations using the following formula. Used to characterize the past The average number of successful identifications by the j-th antenna corresponding to the target time combination. It is a positive integer greater than or equal to 0 and less than or equal to n-1, and the Nth target time combination is the most recent historical target time combination; Used to characterize the past The number of times the j-th antenna is successfully identified within the target time combination; m is a positive integer greater than or equal to 2, and Q = m + n - 1; Used to characterize weighting coefficients; The antenna polling order corresponding to the target time combination is calculated based on the average number of successful identifications of each antenna within the past n target time combinations.
6. An automated toll collection robot, comprising: The antenna polling order determination device as described in claim 5.
7. An electronic device, comprising: The processor, memory, communication interface, and communication bus are provided, wherein the processor, memory, and communication interface communicate with each other via the communication bus. The memory is used to store at least one executable instruction that causes the processor to perform the antenna polling order determination method as described in any one of claims 1-4.
8. A computer storage medium having a computer program stored thereon, which, when executed by a processor, implements the antenna polling order determination method as described in any one of claims 1-4.