RFID jewelry tag reading system and method

Abstract

The present invention discloses an RFID jewelry tag reading system and method, which relates to the field of jewelry tag reading technology. A plurality of reading schemes are generated based on a database. After Monte Carlo simulation is performed on each reading scheme, a performance function is used to calculate the performance value of each reading scheme. If there is a reading scheme with a performance value greater than a performance threshold, the reading scheme with the largest performance value is selected as the final scheme of the reading system. Otherwise, some reading schemes are selected for content optimization iteration until there is a reading scheme with a performance value greater than the performance threshold, and the iteration is stopped, and the final scheme is output for use by the reading system. The reading system introduces Monte Carlo simulation, and evaluates the performance values ​​of different reading schemes through randomized experiments. After comprehensively measuring the schemes, the optimal scheme can be selected for use by the reading system, and the reading performance can be gradually improved to ensure the efficiency and reliability of the final scheme.

Description

Technical Field

[0001] The present invention relates to the technical field of jewelry tag reading, and in particular to an RFID jewelry tag reading system and method. Background Art

[0002] With the rapid development of the jewelry industry, the types, styles and quantities of jewelry are increasing day by day. The traditional manual management method can hardly meet the efficiency and accuracy requirements of modern jewelry stores, high-end jewelry exhibitions and jewelry warehouse management. In order to solve the problems of low inventory efficiency, difficulty in finding goods, inaccurate entry and exit records, and difficulty in preventing theft and loss in jewelry management, the jewelry tag reading system based on radio frequency identification (RFID) technology came into being;

[0003] The reading system installs a uniquely coded RFID electronic tag on each piece of jewelry to achieve contactless rapid identification and accurate tracking management of jewelry. The system relies on the linkage of RFID reading and writing equipment, antennas and background management software, and can efficiently read tag information and update the database in real time without direct contact with the jewelry.

[0004] The prior art has the following deficiencies:

[0005] The existing technology usually relies on fixed rules to select reading strategies and lacks a scientific performance evaluation mechanism, which makes it difficult to ensure the quality of the reading solution. Problems such as inefficiency or missed reading may occur. In addition, the system usually only formulates plans in the initial stage and lacks optimization and adaptability in subsequent operations, making it difficult to deal with problems such as low reading efficiency or reader-writer conflicts.

[0006] Based on this, the present invention proposes an RFID jewelry tag reading system and method, introduces Monte Carlo simulation, and evaluates the performance values ​​of different reading schemes through randomized experiments. After comprehensively weighing the schemes, the optimal scheme can be selected for use by the reading system, and the reading performance can be gradually improved to ensure the efficiency and reliability of the final scheme. Summary of the invention

[0007] The purpose of the present invention is to provide an RFID jewelry tag reading system and method to solve the deficiencies in the background technology.

[0008] In order to achieve the above object, the present invention provides the following technical solution: an RFID jewelry tag reading system and method, the reading method comprising the following steps:

[0009] After the reading system is connected to the jewelry warehouse management platform through the API interface, it obtains the RFID reader information and jewelry tag information in the warehouse, generates several reading schemes based on the database, performs Monte Carlo simulation on each reading scheme, and uses the performance function to calculate the performance value of each reading scheme;

[0010] If there is a reading solution with a performance value greater than the performance threshold, the reading solution with the largest performance value is selected as the final solution of the reading system. Otherwise, some reading solutions are selected for content optimization iteration until a reading solution with a performance value greater than the performance threshold is found, and the iteration is stopped, and the final solution is output for use by the reading system.

[0011] In a preferred embodiment, a Monte Carlo simulation is performed on each reading scheme, including the following steps: simulating the response probability of the tag, simulating the performance of the reader, including coverage, reading frequency, and probability of conflict with other readers;

[0012] Tag quantity and distribution,Based on the actual tag distribution in the warehouse, a set of simulated data is randomly generated as input to simulate the working status of the RFID reader in the warehouse environment, including coverage and tag distribution density;

[0013] Obtain the content parameters of each reading scheme, including reader / writer partitioning, time slot allocation, and dynamic adjustment rules. For each reading scheme, randomly generate multiple reading scenarios.

[0014] Record each simulation result, perform statistical analysis on all simulation results, and obtain the success rate, conflict rate, coverage rate, and reading efficiency of the Monte Carlo simulation of the reading solution.

[0015] In a preferred embodiment, calculating the performance value of each reading scheme using a performance function comprises the following steps:

[0016] After normalizing the success rate, conflict rate, coverage rate, and reading efficiency, the performance value of the reading solution is obtained by comprehensive calculation. The expression is: , where is the performance value, For the success rate, For reading efficiency, is the conflict rate, is the coverage rate, , , , is the weight coefficient, and .

[0017] In a preferred embodiment, if there is a reading scheme with a performance value greater than the performance threshold, the reading scheme with the largest performance value is selected as the final scheme of the reading system, including the following steps:

[0018] After obtaining the performance values ​​of all reading schemes, the performance values ​​are compared with a preset performance threshold. The performance threshold is used to determine whether there is a reading scheme that meets the tag reading requirements among all reading schemes. If the performance value is less than or equal to the performance threshold, it is determined that there is no reading scheme that meets the tag reading requirements among all reading schemes. If the performance value is greater than the performance threshold, it is determined that there is a reading scheme that meets the tag reading requirements among all reading schemes.

[0019] When it is determined that there is a reading scheme that meets the tag reading requirements among all reading schemes, all reading schemes with performance values ​​greater than the performance threshold are sorted from large to small according to the performance values, and the reading scheme ranked first is selected as the final scheme of the reading system.

[0020] In a preferred embodiment, some reading solutions are selected for content optimization iteration until a reading solution with a performance value greater than a performance threshold is found, and the iteration is stopped, and a final solution is output for use by a reading system, including the following steps:

[0021] When it is determined that there is no reading scheme that meets the tag reading requirements among all reading schemes, all reading schemes with performance values ​​less than or equal to the performance threshold are sorted from large to small according to the performance value, and the same number of reading schemes as the quantity threshold are selected in positive order for content optimization, which includes reader partition optimization, time slot allocation optimization, and dynamic allocation strategy optimization;

[0022] Repeat the content optimization steps to iterate. When there is a reading scheme with a performance value greater than the performance threshold in any output reading scheme, all reading schemes with a performance value greater than the performance threshold are sorted from large to small according to the performance value, and the reading scheme ranked first is selected as the final scheme of the reading system.

[0023] In a preferred embodiment, the reader / writer partition optimization includes the following steps: obtaining the tag density, environmental signal attenuation index and signal conflict interference index in each reader / writer reading area, normalizing the tag density, environmental signal attenuation index and signal conflict interference index, so that the value range of the tag density, environmental signal attenuation index and signal conflict interference index is mapped to [0,1], obtaining the normalized value of the tag density, the normalized value of the environmental signal attenuation index and the normalized value of the signal conflict interference index, and summing the normalized value of the tag density, the normalized value of the environmental signal attenuation index and the normalized value of the signal conflict interference index to obtain the correction coefficient of the reader / writer;

[0024] The correction coefficient is compared with the preset correction threshold. The correction threshold is used to determine whether the reading area of ​​the reader needs to be corrected. If the correction coefficient of the reader is less than or equal to the correction threshold, it is determined that the reading area of ​​the reader does not need to be corrected. If the correction coefficient of the reader is greater than the correction threshold, it is determined that the reading area of ​​the reader needs to be corrected. The reading area of ​​each reader is corrected according to the correction coefficient. The expression is: , where is the corrected reading area, is the initial reading area, is the correction factor;

[0025] After the read area area of ​​all readers is corrected, the position coordinates of the read uncovered area are obtained, the distance between the read uncovered area and the reader whose correction coefficient is less than or equal to the correction threshold is calculated, and the read uncovered area is assigned to the reader with the smallest distance.

[0026] In a preferred embodiment, the time slot allocation optimization comprises the following steps:

[0027] Through reading range calculation, it can identify whether there is overlap in the coverage area of ​​the reader / writer. In the overlapping area, the number of tags and distribution density are counted, the probability of reader / writer signal interference in the overlapping area is estimated, and the conflict hotspot area is marked to dynamically allocate time slots;

[0028] The time slots are dynamically adjusted according to the tag density or conflict risk detected in real time. When the number of tags in a certain area increases, the time slot allocation of the area is increased. When the conflict in a certain area decreases, the time slot allocation of the area is shortened. The alternating allocation rule is introduced to enable multiple readers to cover the same area in different time periods.

[0029] In a preferred embodiment, the RFID reader / writer information includes the number of RFID readers / writers and the tag reading range of each RFID reader / writer, and the jewelry tag information includes the number of tags.

[0030] RFID jewelry tag reading system, including data acquisition module, simulation module, and solution output module;

[0031] Data acquisition module: After connecting to the jewelry warehouse management platform through the API interface, it obtains the RFID reader information and jewelry tag information in the warehouse;

[0032] Simulation module: Generates several reading schemes based on the database, performs Monte Carlo simulation on each reading scheme, and uses the performance function to calculate the performance value of each reading scheme;

[0033] Solution output module: If there is a reading solution with a performance value greater than the performance threshold, the reading solution with the largest performance value is selected as the final solution. Otherwise, some reading solutions are selected for content optimization iteration until a reading solution with a performance value greater than the performance threshold is found, and the iteration is stopped, and the final solution is output for use.

[0034] In the above technical solution, the technical effects and advantages provided by the present invention are:

[0035] The present invention generates several reading schemes based on a database, performs Monte Carlo simulation on each reading scheme, and then uses a performance function to calculate the performance value of each reading scheme. If there is a reading scheme with a performance value greater than a performance threshold, the reading scheme with the largest performance value is selected as the final scheme of the reading system. Otherwise, some reading schemes are selected for content optimization iteration until there is a reading scheme with a performance value greater than the performance threshold, then the iteration is stopped and the final scheme is output for use by the reading system. The reading system introduces Monte Carlo simulation, evaluates the performance values ​​of different reading schemes through randomized experiments, and can comprehensively measure the schemes, select the optimal scheme for use by the reading system, and gradually improve the reading performance to ensure the efficiency and reliability of the final scheme. BRIEF DESCRIPTION OF THE DRAWINGS

[0036] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments recorded in the present invention. For ordinary technicians in this field, other drawings can also be obtained based on these drawings.

[0037] Figure 1 The figure is a flow chart of the method of the present invention. DETAILED DESCRIPTION

[0038] In order to make the purpose, technical solution and advantages of the embodiments of the present invention clearer, the technical solution in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0039] Example 1: Please refer to Figure 1 As shown, the RFID jewelry tag reading method described in this embodiment includes the following steps:

[0040] After the reading system is connected to the jewelry warehouse management platform through the API interface, it obtains the RFID reader information and jewelry tag information in the warehouse. The RFID reader information includes the number of RFID readers and the tag reading range of each RFID reader. The jewelry tag information includes the number of tags. Several reading schemes are generated based on the database. After Monte Carlo simulation of each reading scheme, the performance value of each reading scheme is calculated using the performance function. If there is a reading scheme with a performance value greater than the performance threshold, the reading scheme with the largest performance value is selected as the final scheme of the reading system. Otherwise, some reading schemes are selected for content optimization iteration until a reading scheme with a performance value greater than the performance threshold is found, and the iteration is stopped, and the final scheme is output for use by the reading system.

[0041] This application generates several reading schemes based on the database, performs Monte Carlo simulation on each reading scheme, and uses the performance function to calculate the performance value of each reading scheme. If there is a reading scheme with a performance value greater than the performance threshold, the reading scheme with the largest performance value is selected as the final scheme of the reading system. Otherwise, some reading schemes are selected for content optimization iteration until there is a reading scheme with a performance value greater than the performance threshold, then the iteration is stopped and the final scheme is output for use by the reading system. The reading system introduces Monte Carlo simulation and evaluates the performance values ​​of different reading schemes through randomized experiments. After comprehensively measuring the schemes, it can select the optimal scheme for use by the reading system, and gradually improve the reading performance to ensure the efficiency and reliability of the final scheme.

[0042] Example 2: After the reading system is connected to the jewelry warehouse management platform through the API interface, the RFID reader information and jewelry tag information in the warehouse are obtained, including the following steps:

[0043] Call the API interface of the jewelry warehouse management platform to obtain detailed information of the RFID readers in the current warehouse in real time, including: Number of RFID readers: Determine the total number of RFID readers configured in the current warehouse to facilitate subsequent solution design. Reading range of each reader: Includes the physical location and coverage of the reader (usually expressed as a radius or area range), which is used to analyze tag coverage and avoid conflicts in overlapping areas.

[0044] Get the distribution information of jewelry tags in the current warehouse, including: record the number of jewelry tags that need to be read as an important indicator to measure the success rate of the solution. Tag location distribution (if available): Some systems may provide spatial distribution coordinate information of tags in the warehouse to facilitate more accurate generation of reading solutions.

[0045] Initialize the core parameters of the system, including read priority, parallel processing capability, etc., based on the number of readers and tags. Set basic operation strategies, such as read frequency, fault tolerance mechanism, and data cache size, to ensure that the system can operate efficiently in complex environments. Ensure that the system can continuously obtain the latest reader status and tag change information to provide support for dynamic adjustment of reading solutions.

[0046] Generate several reading plans based on the database, including the following steps:

[0047] Partition scheme generation:

[0048] According to the physical space of the warehouse, the areas are graded based on the density of label distribution:

[0049] High priority area: The tag density is high and more reader resources are allocated first.

[0050] Medium and low priority areas: The tag density is low and can be covered with fewer resources.

[0051] Reader / writer allocation strategy:

[0052] Fixed allocation: Each reader is responsible for a specific area to avoid overlapping coverage.

[0053] Dynamic allocation: Dynamically adjust the coverage and priority of readers based on the real-time distribution of tags.

[0054] For readers with overlapping coverage, a time slot allocation scheme is generated to ensure that they work in different time periods to reduce signal conflicts.

[0055] Combining partitioning, dynamic allocation and time slot allocation strategies, a variety of hybrid solutions are generated to meet the needs of different warehouse environments. The core parameters of each candidate solution are modeled as follows:

[0056] Coverage: The assigned range of each reader and the number of tags it is responsible for.

[0057] Signal conflict rate: Analyze possible signal interference between readers and writers.

[0058] Read Priority: Assign priorities based on tag density and importance.

[0059] Parallelism: Consider the situation where multiple readers and writers work at the same time and configure the number of parallel operations reasonably.

[0060] For example, suppose the following conditions exist in a jewelry warehouse:

[0061] Number of RFID readers: 5, numbered R1, R2, R3, R4, R5. Total number of jewelry tags: 1000.

[0062] The warehouse is divided into four areas: A, B, C, and D. Areas A and B are densely populated with 400 and 350 tags, respectively. Areas C and D are sparsely populated with 150 and 100 tags, respectively. According to the physical space of the warehouse and the density of tag distribution, the warehouse is divided into high-priority areas and medium- and low-priority areas: High-priority areas: A (400 tags), B (350 tags). Allocate more reader resources. Medium- and low-priority areas: C (150 tags), D (100 tags). Allocate fewer reader resources.

[0063] Example of generated partition scheme:

[0064] Solution 1 (even distribution): R1 and R2 cover A, R3 covers B, R4 covers C, and R5 covers D.

[0065] Solution 2 (dense area first): R1, R2, and R3 cover A and B (dense area shared), R4 covers C, and R5 covers D.

[0066] Solution 3: R1 is responsible for the left half of A, R2 is responsible for the right half of A, reducing the overlapping coverage. R3 is fixedly responsible for B. R4 is responsible for C, and R5 is responsible for D, evenly dividing the medium and low priority areas.

[0067] Solution 4: Dynamic adjustment based on real-time movement and distribution of tags: If tags are concentrated in a certain sub-area in a high-priority area, add readers temporarily. If there are omissions in medium- and low-priority areas, flexibly adjust the reader coverage.

[0068] Solution 5: For readers with overlapping coverage (such as R1 and R2 covering the overlapping area of ​​A and B in Solution 2), design a read time slot allocation strategy: R1 is responsible for time slot 1 (0-10 seconds), and R2 is responsible for time slot 2 (10-20 seconds) to avoid conflicts. R3, R4, and R5 continue to operate because their coverage areas do not overlap.

[0069] Solution 6: Combine partitioning, dynamic allocation, and time slot allocation to generate a more flexible solution: R1 covers A (left half) + dynamically takes charge of the high-density part of B. R2 covers A (right half) + time slots share the edge area of ​​B. R3 focuses on B (core area). R4 and R5 respectively cover C and D, and dynamically respond to read requests from abnormal tags.

[0070] After performing Monte Carlo simulation on each reading scheme, the performance function is used to calculate the performance value of each reading scheme, including the following steps:

[0071] The response probability of the simulated tag is considered to account for the probability that the tag may not be successfully read due to distance, obstacles, or signal interference (for example, the response rate is 80% to 95%).

[0072] Simulate the performance of the reader, including coverage, reading frequency, probability of conflict with other readers, etc.

[0073] Number and distribution of labels,Based on the actual label distribution in the warehouse, a set of simulated data is randomly,generated as input.

[0074] Simulate the working status of RFID readers in a warehouse environment, including coverage, tag distribution density, etc.

[0075] Obtain content parameters of each reading scheme, including reader / writer partitions, time slot allocation, and dynamic adjustment rules.

[0076] For each reading scheme, multiple possible reading scenarios (such as success and failure of tag response, signal conflict) are randomly generated.

[0077] Scenario example: A tag is within the coverage of the reader and responds successfully. A tag is not read successfully due to interference or coverage blind area. The same tag is read by multiple readers and a conflict occurs.

[0078] A large number (e.g., 10,000) of simulations were repeated for each scenario to ensure that the results were statistically significant.

[0079] Record the results of each simulation: including the number of tags successfully read (success rate), the number of tags not read (missing rate), the number of times multiple readers read the same tag at the same time (conflict rate), and the total reading time of all tags (reading efficiency).

[0080] Statistical analysis of all simulation results yielded the following indicators:

[0081] Success rate: The probability that a tag is successfully read.

[0082] Conflict rate: The reading failure rate caused by signal conflict.

[0083] Coverage: The percentage of all tags that have been successfully read at least once.

[0084] Reading efficiency: The total reading time of all tags, that is, the total reading time of all tags is obtained by subtracting the time when the last tag is read from the time when the first tag starts to be read.

[0085] Specific examples are:

[0086] The following conditions exist in a jewelry warehouse environment: 3 RFID readers, numbered R1, R2, and R3. 300 tags, distributed in different areas: 180 tags in the high-density area (Area A), 80 tags in the medium-density area (Area B), and 40 tags in the low-density area (Area C).

[0087] Reader coverage: R1 is responsible for area A, R2 is responsible for area B, and R3 is responsible for area C.

[0088] Reading scheme 1: fixed allocation, readers and writers are divided by area, without dynamic adjustment.

[0089] Reading solution 2: Dynamic allocation allows increased reader coverage in high-density areas and reduced conflict rates.

[0090] Simulation parameters: The success probability of each tag response is 85% to 95%. The coverage areas are A (R1), B (R2), and C (R3); the reading frequency is 50 times / second. If two readers cover overlapping areas, the conflict probability is 20% to 30%. The positions and priorities of 300 tags are generated according to the actual area.

[0091] Get read scheme parameters

[0092] Scenario 1:

[0093] R1 covers area A, R2 covers area B, and R3 covers area C. They are fixed partitions with no crossover. Time slot allocation: No adjustment is required, and the readers and writers operate independently.

[0094] Scenario 2:

[0095] R1 mainly covers area A, but dynamically shares some high-density areas (30 tags at the border between A and B) with R2. Time slot allocation: R1 concentrates on reading the central tags of area A in 0 to 10 seconds, and assists R2 in covering the border area in 10 to 20 seconds. R3 continuously covers area C without time slot changes.

[0096] Scenario 1: All tags are evenly distributed and no tags move. Scenario 2: Some tags are located at the reader boundary, resulting in overlapping coverage. Scenario 3: Introducing obstacles into the simulated environment to reduce the probability of tag response in certain areas. Example:

[0097] Tag T1 is located in the center of area A and is successfully read by R1 (successful response). Tag T2 is located at the junction of A and B and is covered by both R1 and R2, resulting in signal conflict. Tag T3 is located in the corner of area C and is not successfully read by R3 due to interference from obstacles.

[0098] 10,000 simulations were performed for both Scenario 1 and Scenario 2, and the following results were recorded each time:

[0099] The number of tags that were successfully read. The number of tags that were not read. The number of conflicts (the same tag was read by multiple readers at the same time). The total reading time (the time from the start of reading the first tag to the completion of reading the last tag).

[0100] Statistical results of Solution 1: Success rate: 90%. Conflict rate: 0% (because fixed partitions have no overlap).

[0101] Coverage: 95%. Reading efficiency: Total reading time is 30 seconds.

[0102] Statistical results of Solution 2: Success rate: 92%. Conflict rate: 5% (dynamic allocation leads to partial overlap). Coverage rate: 98%. Reading efficiency: The total reading time is 25 seconds.

[0103] After normalizing the success rate, conflict rate, coverage rate, and reading efficiency, the performance value of the reading solution is obtained by comprehensive calculation. The expression is: , where is the performance value, For the success rate, For reading efficiency, is the conflict rate, is the coverage rate, , , , is the weight coefficient, and .

[0104] If there is a reading scheme with a performance value greater than the performance threshold, the reading scheme with the largest performance value is selected as the final scheme of the reading system, including the following steps:

[0105] After obtaining the performance values ​​of all reading schemes, the performance values ​​are compared with the preset performance threshold. The performance threshold is used to determine whether there is a reading scheme that meets the tag reading requirements among all reading schemes. If the performance value is less than or equal to the performance threshold, it is determined that there is no reading scheme that meets the tag reading requirements among all reading schemes. If the performance value is greater than the performance threshold, it is determined that there is a reading scheme that meets the tag reading requirements among all reading schemes.

[0106] When it is determined that there is a reading scheme that meets the tag reading requirements among all reading schemes, all reading schemes with performance values ​​greater than the performance threshold are sorted from large to small according to the performance values, and the reading scheme ranked first is selected as the final scheme of the reading system.

[0107] Select some reading solutions for content optimization iteration until a reading solution with a performance value greater than a performance threshold is found, and then stop the iteration and output the final solution for use by the reading system, including the following steps:

[0108] When it is determined that there is no reading scheme that meets the tag reading requirements among all reading schemes, all reading schemes with performance values ​​less than or equal to the performance threshold are sorted from large to small according to the performance values, and the same number of reading schemes as the quantity threshold are selected in positive order for content optimization. The content optimization includes reader / writer partition optimization, time slot allocation optimization, and dynamic allocation strategy optimization. The content optimization steps are repeated for iteration. When there is a reading scheme with a performance value greater than the performance threshold in any output reading scheme, all reading schemes with performance values ​​greater than the performance threshold are sorted from large to small according to the performance values, and the reading scheme ranked first is selected as the final scheme of the reading system.

[0109] In this application:

[0110] The reader / writer partition optimization includes the following steps: obtaining the tag density, environmental signal attenuation index and signal conflict interference index in the reading area of ​​each reader / writer, normalizing the tag density, environmental signal attenuation index and signal conflict interference index, so that the value range of the tag density, environmental signal attenuation index and signal conflict interference index is mapped to [0,1], obtaining the normalized value of the tag density, the normalized value of the environmental signal attenuation index and the normalized value of the signal conflict interference index, summing the normalized value of the tag density, the normalized value of the environmental signal attenuation index and the normalized value of the signal conflict interference index to obtain the correction coefficient of the reader / writer. The larger the correction coefficient, the more it is necessary to reduce the reading area area of ​​the reader / writer. The correction coefficient is compared with a preset correction threshold. The correction threshold is used to determine whether the reading area area of ​​the reader / writer needs to be corrected. If the correction coefficient of the reader / writer is less than or equal to the correction threshold, it is determined that the reading area area of ​​the reader / writer does not need to be corrected. If the correction coefficient of the reader / writer is greater than the correction threshold, it is determined that the reading area area of ​​the reader / writer needs to be corrected. The reading area area of ​​each reader / writer is corrected according to the correction coefficient. The expression is: , where is the corrected reading area, is the initial reading area, is the correction factor;

[0111] It should be noted that since the reading area of ​​some readers is reduced, in order to avoid missed reading problems in certain areas, after the reading area of ​​all readers is corrected, the position coordinates of the uncovered reading area are obtained, and the distance between the uncovered reading area and the reader with a correction coefficient less than or equal to the correction threshold is calculated. Then, the uncovered reading area is assigned to the reader with the shortest distance. If there is no reader with a correction coefficient less than or equal to the correction threshold, it is necessary to increase the number of readers in the area to avoid missed reading problems.

[0112] The calculation logic of tag density is: obtained by dividing the number of tags in the area by the area of ​​the area. The tag density is inversely related to the area size: as the area increases, the number of tags per unit area decreases relatively, that is, the density becomes lower. The higher the tag density, the more readers and writers need to be allocated and the smaller the coverage area is to ensure efficient reading.

[0113] The calculation logic of the environmental signal attenuation index is: , where is the environmental signal attenuation index, For signal propagation distance, in a larger area, the signal attenuation is more serious due to the increase in distance, especially in an environment with obstacles. The coverage range of the reader needs to be smaller, or the power needs to be increased to compensate for the attenuation effect.

[0114] The signal conflict interference index reflects the probability of signal interference when multiple readers work at the same time. Assuming that there are multiple readers in a certain area, their signal coverage may overlap. The calculation logic is: divide the number of working readers in the area by the area. The signal conflict interference index is usually inversely proportional to the area of ​​the area: the larger the area, the lower the density between readers, and the smaller the possibility of conflict and interference. In a smaller area, since there are more overlapping areas covered by multiple readers, the risk of conflict interference is higher, so it is necessary to optimize the time slot allocation or dynamically adjust the working area.

[0115] The time slot allocation optimization includes the following steps:

[0116] Obtain coverage overlap areas: Identify which readers have overlapping coverage areas through reading range calculation. Calculate tag density: Count the number and distribution density of tags in the overlapping area to assess the risk of conflict. Signal conflict judgment: Estimate the probability of reader signal interference in the overlapping area and mark the conflict hotspot area.

[0117] High-conflict area: allocate more time slots to reduce signal interference. Low-conflict area: time slot allocation can be appropriately reduced to increase system reading efficiency.

[0118] Assign a fixed time period for each reader to work in the conflict area, for example: Reader A: 0 to 5 seconds. Reader B: 5 to 10 seconds. Ensure that adjacent readers do not read tags in overlapping areas at the same time period.

[0119] Dynamically adjust the time slots based on the tag density or conflict risk detected in real time: when the number of tags in a certain area increases, increase the time slot allocation in that area. When the conflict in a certain area decreases, shorten the time slot allocation in that area. Introduce alternating allocation rules so that multiple readers cover the same area in different time periods: for example, readers A and B alternately use time slots of 0 to 10 seconds, but do not work at the same time. Avoid a single reader occupying resources for a long time.

[0120] Single tag reading time: Get the time required for the reader to read a single tag (e.g. 5ms). Total regional tag reading time: Calculate the total reading time required for each region based on the number of tags.

[0121] Ensure that each time slot length can cover all tag reading requirements in the current area. The total time slot allocated should meet the overall reading time limit of the system.

[0122] The following are some examples:

[0123] Assume that there are four RFID readers (A, B, C, D) in the warehouse, and their coverage is as follows:

[0124] Reader A: Covering area 1;

[0125] Reader B: covers area 2;

[0126] Reader C: covers area 3;

[0127] Reader D: covers area 4;

[0128] After calculation, it is found that the coverage areas of readers A and B overlap, and the tag density in the overlapping area is higher. Therefore, we need to further analyze the tag density and signal conflict risk in the overlapping area.

[0129] In the overlapping area, due to the high probability of signal conflict (30%), we mark this area as a "high conflict area". The high conflict area needs to allocate more time slots to reduce the impact of conflicts on reading efficiency.

[0130] In order to prevent reader A and B from reading tags in overlapping areas at the same time, we will assign fixed working time slots to the two readers to ensure that they work in different time periods: reader A: 0 to 5 seconds, reader B: 5 to 10 seconds. In this way, A and B will not read tags in overlapping areas at the same time, avoiding signal conflicts.

[0131] Assuming that the number of tags in a certain area is increased in real time (for example, the number of tags increases from 2,000 to 3,000), we will increase the time slot allocation in that area accordingly: if the number of tags in the overlapping area increases, we can extend the time slot to 10 seconds for each reader. For example: reader A: 0 to 10 seconds, reader B: 10 to 20 seconds. If the number of tags in a certain area decreases or the number of conflicts decreases, we can appropriately reduce the time slot allocation to improve the overall reading efficiency.

[0132] In order to avoid occupying resources for a long time, we can introduce an alternating time slot allocation strategy. For example, in the overlapping area, readers A and B work alternately: reader A: 0-5 seconds, reader B: 5-10 seconds, reader A: 10-15 seconds, reader B: 15-20 seconds. In this way, the two readers will not occupy the same resource in the same period and can read tags efficiently.

[0133] Assume that the read time of each tag is 5 milliseconds (ms), that is, the time required for each reader to read a tag. In the overlapping area, there are a total of 2000 tags that need to be read. Assuming that the read time of each tag is 5ms, the total read time in this area is 10 seconds.

[0134] Depending on the number of tags and the reading requirements, the total length of the time slot needs to be sufficient to cover the reading of all tags. For example, in the overlapping area, we need at least 10 seconds of time slots to complete the reading of 2000 tags. However, due to the existence of signal conflicts, we may need more time slots to ensure that each tag is successfully read.

[0135] Through the time slot allocation optimization strategy, we can effectively avoid signal conflicts and improve tag reading efficiency. In high-conflict areas, more time slots are allocated and dynamically adjusted, and alternating time slot allocation is used to ensure that each reader covers the same area at different time periods. Through such optimization, the RFID system can efficiently read tags in a warehouse environment while avoiding signal interference and improving the success rate and efficiency of reading.

[0136] Dynamic allocation strategy optimization includes the following steps:

[0137] Real-time tag density detection: Through sensors or data feedback, the tag distribution density of each area is monitored in real time. Areas with higher density require more reader resources, while areas with lower density can appropriately reduce resource allocation.

[0138] Signal strength and attenuation monitoring: Real-time measurement of RFID signal strength to assess each reader’s coverage and signal attenuation. When signal strength decreases, it may be necessary to adjust the reader’s power or reconfigure the coverage area.

[0139] Reader working status monitoring: Monitor the working status of each reader, including whether there are any failures, delays, interference, etc. When a reader fails or its efficiency decreases, other readers need to be dynamically adjusted to supplement its coverage.

[0140] Dynamic allocation based on tag density: Dynamically adjust the allocation of readers and writers based on the tag distribution detected in real time. For example, more reader resources are allocated to areas with dense tags, while fewer resources are allocated to areas with sparse tags.

[0141] Dynamic adjustment based on signal strength: In areas with severe signal attenuation, the reader power is automatically increased or the size of the coverage area is reduced to ensure adequate signal coverage.

[0142] Dynamic adjustment based on workload: When the tag reading demand in certain areas increases, the system automatically adjusts and allocates more time slots or additional reader resources.

[0143] Real-time time slot allocation: Dynamically adjust time slot allocation based on the number, density and conflict of tags in each area. For example, when the number of tags in a certain area increases, the time slot is automatically increased to complete the reading task; when the number of tags decreases, the time slot is shortened to improve efficiency.

[0144] Frequency adjustment: Dynamically adjust the reading frequency according to the load of the reader in the area. High-density areas and high-conflict areas can increase the reading frequency to reduce data transmission time, while low-density areas can appropriately reduce the frequency to reduce energy consumption.

[0145] Priority scheduling: Assign priorities to different areas or tags based on the importance of the tag, the urgency of reading, and other business needs. High-priority areas can get more reading resources or time slots, while low-priority areas can have their resources appropriately reduced.

[0146] Signal interference management: When signal interference occurs, dynamically adjust the resource allocation of the conflicting area. For example, through the time slot allocation strategy, avoid multiple readers reading tags in the same area at the same time, thereby reducing signal conflicts.

[0147] Embodiment 3: The RFID jewelry tag reading system described in this embodiment includes a data acquisition module, a simulation module, and a solution output module;

[0148] Data acquisition module: After connecting with the jewelry warehouse management platform through the API interface, the RFID reader information and jewelry tag information in the warehouse are obtained. The RFID reader information includes the number of RFID readers and the tag reading range of each RFID reader. The jewelry tag information includes the number of tags. The RFID reader information and jewelry tag information are sent to the simulation module;

[0149] Simulation module: Generates several reading schemes based on the database, performs Monte Carlo simulation on each reading scheme, and uses the performance function to calculate the performance value of each reading scheme, and the performance value is sent to the scheme output module;

[0150] Solution output module: If there is a reading solution with a performance value greater than the performance threshold, the reading solution with the largest performance value is selected as the final solution. Otherwise, some reading solutions are selected for content optimization iteration until a reading solution with a performance value greater than the performance threshold is found, and the iteration is stopped, and the final solution is output for use.

[0151] The above formulas are all dimensionless and numerical calculations. The formula is a formula for the most recent real situation obtained by collecting a large amount of data and performing software simulation. The preset parameters in the formula are set by technicians in this field according to actual conditions.

[0152] It should be understood that the term "and / or" in this article is only a description of the association relationship of associated objects, indicating that there can be three relationships. For example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone. A and B can be singular or plural. In addition, the character " / " in this article generally indicates that the associated objects before and after are in an "or" relationship, but it may also indicate an "and / or" relationship. Please refer to the context for specific understanding.

[0153] It should be understood that in the various embodiments of the present application, the size of the serial numbers of the above-mentioned processes does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.

[0154] Those of ordinary skill in the art will appreciate that the units and algorithm steps of each example 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 performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application. Those skilled in the art can clearly understand that for the convenience and simplicity of description, the specific working process of the above-described system, device and unit can refer to the corresponding process in the aforementioned method embodiment, and will not be repeated here.

[0155] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art who is familiar with the present technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

Claims

1. RFID jewelry tag reading method, characterized in that: The reading method comprises the following steps: After the reading system is connected to the jewelry warehouse management platform through the API interface, the RFID reader information and jewelry tag information in the warehouse are obtained, and several reading schemes are generated based on the database. Monte Carlo simulation is performed on each reading scheme, and the simulation results of each time are recorded. All simulation results are statistically analyzed to obtain the success rate, conflict rate, coverage rate and reading efficiency of the Monte Carlo simulation of the reading scheme, and the performance value of each reading scheme is calculated using the performance function, including the following steps: after normalizing the success rate, conflict rate, coverage rate and reading efficiency, the performance value of the reading scheme is obtained by comprehensive calculation; If there is a reading solution with a performance value greater than the performance threshold, the reading solution with the largest performance value is selected as the final solution of the reading system. Otherwise, some reading solutions are selected for content optimization iteration until a reading solution with a performance value greater than the performance threshold is found, and the iteration is stopped, and the final solution is output for use by the reading system.

2. The RFID jewelry tag reading method according to claim 1, characterized in that: Monte Carlo simulation is performed for each reading scheme, including the following steps: simulating the response probability of the tag and simulating the performance of the reader, including coverage, reading frequency, and probability of conflict with other readers; Tag quantity and distribution,Based on the actual tag distribution in the warehouse, a set of simulated data is randomly generated as input to simulate the working status of the RFID reader in the warehouse environment, including coverage and tag distribution density; Obtain the content parameters of each reading scheme, including reader / writer partitioning, time slot allocation, and dynamic adjustment rules. For each reading scheme, randomly generate multiple reading scenarios. Record each simulation result, perform statistical analysis on all simulation results, and obtain the success rate, conflict rate, coverage rate, and reading efficiency of the Monte Carlo simulation of the reading solution.

3. The RFID jewelry tag reading method according to claim 2, characterized in that: The performance function is used to calculate the performance value of each reading scheme, including the following steps: After normalizing the success rate, conflict rate, coverage rate, and reading efficiency, the performance value of the reading solution is obtained by comprehensive calculation. The expression is: , where is the performance value, For the success rate, For reading efficiency, is the conflict rate, is the coverage rate, , , , is the weight coefficient, and .

4. The RFID jewelry tag reading method according to claim 3, characterized in that: If there is a reading scheme with a performance value greater than the performance threshold, the reading scheme with the largest performance value is selected as the final scheme of the reading system, including the following steps: After obtaining the performance values ​​of all reading schemes, the performance values ​​are compared with a preset performance threshold. The performance threshold is used to determine whether there is a reading scheme that meets the tag reading requirements among all reading schemes. If the performance value is less than or equal to the performance threshold, it is determined that there is no reading scheme that meets the tag reading requirements among all reading schemes. If the performance value is greater than the performance threshold, it is determined that there is a reading scheme that meets the tag reading requirements among all reading schemes. When it is determined that there is a reading scheme that meets the tag reading requirements among all reading schemes, all reading schemes with performance values ​​greater than the performance threshold are sorted from large to small according to the performance values, and the reading scheme ranked first is selected as the final scheme of the reading system.

5. The RFID jewelry tag reading method according to claim 4, characterized in that: Select some reading solutions for content optimization iteration until a reading solution with a performance value greater than a performance threshold is found, and then stop the iteration and output the final solution for use by the reading system, including the following steps: When it is determined that there is no reading scheme that meets the tag reading requirements among all reading schemes, all reading schemes with performance values ​​less than or equal to the performance threshold are sorted from large to small according to the performance value, and the same number of reading schemes as the quantity threshold are selected in positive order for content optimization, which includes reader partition optimization, time slot allocation optimization, and dynamic allocation strategy optimization; Repeat the content optimization steps to iterate. When there is a reading scheme with a performance value greater than the performance threshold in any output reading scheme, all reading schemes with a performance value greater than the performance threshold are sorted from large to small according to the performance value, and the reading scheme ranked first is selected as the final scheme of the reading system.

6. The RFID jewelry tag reading method according to claim 5, characterized in that: The reader / writer partition optimization comprises the following steps: obtaining the tag density, the environmental signal attenuation index and the signal conflict interference index in the reading area of ​​each reader / writer, normalizing the tag density, the environmental signal attenuation index and the signal conflict interference index so that the value ranges of the tag density, the environmental signal attenuation index and the signal conflict interference index are mapped to between [0, 1], obtaining the normalized value of the tag density, the normalized value of the environmental signal attenuation index and the normalized value of the signal conflict interference index, and summing the normalized value of the tag density, the normalized value of the environmental signal attenuation index and the normalized value of the signal conflict interference index to obtain the correction coefficient of the reader / writer; The correction coefficient is compared with the preset correction threshold. The correction threshold is used to determine whether the reading area of ​​the reader needs to be corrected. If the correction coefficient of the reader is less than or equal to the correction threshold, it is determined that the reading area of ​​the reader does not need to be corrected. If the correction coefficient of the reader is greater than the correction threshold, it is determined that the reading area of ​​the reader needs to be corrected. The reading area of ​​each reader is corrected according to the correction coefficient. The expression is: , where is the corrected reading area, is the initial reading area, is the correction factor; After the reading area of ​​all readers is corrected, the position coordinates of the uncovered area are obtained, the distance between the position coordinates of the uncovered area and all readers whose correction coefficients are less than or equal to the correction threshold is calculated, and the uncovered area is assigned to the reader with the smallest distance.

7. The RFID jewelry tag reading method according to claim 6, characterized in that: The time slot allocation optimization comprises the following steps: Through reading range calculation, it can identify whether there is overlap in the coverage area of ​​the reader / writer. In the overlapping area, the number of tags and distribution density are counted, the probability of reader / writer signal interference in the overlapping area is estimated, and the conflict hotspot area is marked to dynamically allocate time slots; The time slots are dynamically adjusted according to the tag density or conflict risk detected in real time. When the number of tags in a certain area increases, the time slot allocation of the area is increased. When the conflict in a certain area decreases, the time slot allocation of the area is shortened. The alternating allocation rule is introduced to enable multiple readers to cover the same area in different time periods.

8. The RFID jewelry tag reading method according to claim 7, characterized in that: The RFID reader information includes the number of RFID readers and the tag reading range of each RFID reader, and the jewelry tag information includes the number of tags.

9. An RFID jewelry tag reading system, used to implement the reading method according to any one of claims 1 to 8, characterized in that: It includes data acquisition module, simulation module and solution output module; Data acquisition module: After connecting to the jewelry warehouse management platform through the API interface, it obtains the RFID reader information and jewelry tag information in the warehouse; Simulation module: Generates several reading schemes based on the database, performs Monte Carlo simulation on each reading scheme, and uses the performance function to calculate the performance value of each reading scheme; Solution output module: If there is a reading solution with a performance value greater than the performance threshold, the reading solution with the largest performance value is selected as the final solution. Otherwise, some reading solutions are selected for content optimization iteration until a reading solution with a performance value greater than the performance threshold is found, and the iteration is stopped, and the final solution is output for use.

Images