Inventory management method and device based on RFID

Abstract

The invention discloses an inventory management method and device based on RFID, and relates to the technical field of inventory management. Obtaining all the responded RFID tags, substituting the RFID tags into a preset query tree for query, and determining a tree node corresponding to each RFID tag; if more than two RFID tags are in the same tree node, detecting the RFID tags generating conflicts through conflict detection; and if the corresponding detection result of the RFID tag is unidentified, marking the RFID tag as an unregistered tag and writing the unregistered tag into the system, so that all the RFID tags in the first RFID tag set are successfully identified. According to the technical scheme, all the responded RFID tags are firstly obtained, one-by-one query is carried out according to the preset query tree, the tree node of each tag can be accurately determined, the system can identify the unidentified tags in time, tag identification is effectively avoided from being carried out all the time, and the query efficiency of the system is improved.

Description

Technical Field

[0001] The present invention belongs to the technical field of inventory management, and in particular relates to an inventory management method and device based on RFID. Background Art

[0002] In the RFID (radio frequency identification) system, the communication between tags and readers relies on the transmission and reception of radio signals. When multiple tags try to send signals to the reader at the same time, the signals may collide (i.e., signal overlap). This conflict phenomenon will cause the reader to be unable to clearly receive the unique identity information of each tag, making it impossible for the system to correctly identify each tag. To solve this problem, the existing solution is to avoid or reduce signal conflicts through multiple queries and signal retransmissions, thereby ensuring that all tags can be accurately identified by the system.

[0003] However, in actual applications, even if multiple queries and signal retransmissions are used to reduce conflicts, some tags may still not be registered or entered into the system in a timely manner. These tags may be new devices, inventory information that has not yet been updated, or tags that have not been added to the database in a timely manner for other reasons. Although these tags may be successfully identified through the reader's receiving process and obtain the relevant tag ID or other information, since they have not yet established corresponding records in the background database, the system still cannot further effectively manage them.

[0004] This situation usually causes these tags to be identified as unregistered tags, resulting in a longer system query time, thereby reducing the efficiency of the entire system. Summary of the invention

[0005] The purpose of the present invention is to solve the above problems and to provide an inventory management method and device based on RFID.

[0006] In a first aspect of the present invention, a method for inventory management based on RFID is first proposed, the method comprising: Obtain all responding RFID tags through the target query instruction to obtain a first RFID tag set; For each RFID tag in the first RFID tag set, substitute the tag into a preset query tree for query, and determine the tree node corresponding to each RFID tag; If there are more than two RFID tags in the same tree node, the conflicting RFID tags are detected through conflict detection; If the corresponding detection result of the RFID tag is not recognized, the RFID tag is recorded as an unregistered tag; All unregistered tags in the first RFID tag set are obtained, and the unregistered tags are written into the system so that all RFID tags in the first RFID tag set are successfully identified.

[0007] Optionally, substituting the tag into a preset query tree for querying includes: Step 1: Determine the longest common prefix of the IDs corresponding to all RFID tags in the first RFID tag set, intercept the longest common prefix, and use the longest common prefix as the root node; Step 2: For each RFID tag corresponding ID after the longest common prefix, generate a leaf node with the ID after the longest common prefix; Step 3: Take each leaf node as the main node, obtain the longest common prefix in turn, and use the longest common prefix as the current head node; Repeat steps 2 and 3 above until the last ID of the RFID tag is on a leaf node, and establish a preset query tree based on the root node and all leaf nodes.

[0008] Optionally, detecting the conflicting RFID tags through conflict detection includes: Obtain the common prefix corresponding to the current conflicting node, and if the length of the common prefix is ​​1, re-receive the RFID tag that currently generates the conflict; If the length of the common prefix is ​​greater than 1, the sub-leaves corresponding to the node where the common prefix is ​​located are reorganized until there is no more than one RFID tag at the same tree node.

[0009] Optionally, reorganizing the sub-leaves corresponding to the nodes where the common prefix is ​​located includes: Taking the first number in the common prefix as the current main node, generating a binary tree according to the current main node; Traversing the binary tree, identifying the node corresponding to the conflicting RFID tag when no collision occurs in the binary tree, and recording it as the initial target node; The current main node is split according to the initial target node so that all tree nodes correspond to at most one RFID tag.

[0010] Optionally, obtaining all unregistered tags in the first RFID tag set and writing the unregistered tags into the system includes: prohibiting all known tags in the first RFID tag set, and acquiring, for all unregistered tags in the first RFID tag set, an idle time slot corresponding to each unregistered tag; For each unregistered tag, the unregistered tag is written into the system in the idle time slot corresponding to the unregistered tag through the EDFSA algorithm.

[0011] In a second aspect of the present invention, an RFID-based inventory management device is provided, comprising: An RFID tag acquisition module, used to acquire all responding RFID tags through a target query instruction to obtain a first RFID tag set; A tag query module, configured to substitute each RFID tag in the first RFID tag set into a preset query tree for query, and determine a tree node corresponding to each RFID tag; The tag detection module is used to detect the conflicting RFID tags through conflict detection if there are more than two RFID tags in the same tree node; A tag identification module, used for recording the RFID tag as an unregistered tag if the corresponding detection result of the RFID tag is unidentified; The tag writing module is used to obtain all unregistered tags in the first RFID tag set and write the unregistered tags into the system so that all RFID tags in the first RFID tag set are successfully identified.

[0012] Optionally, the tag query module includes: A root node determination module, used to determine the longest common prefix of the IDs corresponding to all RFID tags in the first RFID tag set, intercept the longest common prefix, and use the longest common prefix as the root node; A leaf node generation module, for generating leaf nodes respectively according to the IDs after the longest common prefix for each RFID tag corresponding to the ID after the longest common prefix; A head node determination module is used to take each leaf node as a main node, obtain the longest common prefix in turn, and take the longest common prefix as the current head node; The preset query tree establishment module is used to repeat the leaf node generation module and the head node determination module until the last ID of the RFID tag is on the leaf node, and establish a preset query tree according to the root node and all leaf nodes.

[0013] Optionally, the tag detection module includes: A tag re-receiving module is used to obtain the common prefix corresponding to the current conflicting node, and if the length of the common prefix is ​​1, re-receive the RFID tag that currently generates the conflict; The reorganization module is used to reorganize the sub-leaves corresponding to the nodes where the common prefix is ​​located if the length of the common prefix is ​​greater than 1, until there is no more than one RFID tag at the same tree node.

[0014] Optionally, the recombination module comprises: A binary tree generation module, used to take the first number in the common prefix as the current main node and generate a binary tree according to the current main node; An initial target node determination module is used to traverse the binary tree and identify the node corresponding to the conflicting RFID tag when no collision occurs in the binary tree, and record it as the initial target node; The main node splitting module is used to split the current main node according to the initial target node so that all tree nodes correspond to at most one RFID tag.

[0015] Optionally, the label writing module includes: a tag prohibition module, configured to prohibit all known tags in the first RFID tag set, and obtain an idle time slot corresponding to each unregistered tag for all unregistered tags in the first RFID tag set; The tag writing time determination module is used to write each unregistered tag into the system in an idle time slot corresponding to the unregistered tag by using the EDFSA algorithm.

[0016] Beneficial effects of the present invention: The present invention proposes an inventory management method based on RFID, which obtains all responding RFID tags through a target query instruction to obtain a first RFID tag set; for each RFID tag in the first RFID tag set, substitute the tag into a preset query tree for query, and determine the tree node corresponding to each RFID tag; if there are more than two RFID tags in the same tree node, the conflicting RFID tags are detected through conflict detection; if the corresponding detection result of the RFID tag is unrecognized, the RFID tag is recorded as an unregistered tag; all unregistered tags in the first RFID tag set are obtained, and the unregistered tags are written into the system, so that all RFID tags in the first RFID tag set are successfully identified. By first obtaining all responding RFID tags and querying them one by one according to the preset query tree, the tree node of each tag can be accurately determined, thereby improving the recognition rate of the tag; if there are more than two RFID tags on the same tree node, they are processed through conflict detection to avoid recognition errors or confusion caused by tag conflicts. For unrecognized tags, the system can timely identify and effectively avoid tag recognition all the time, thereby improving the query efficiency of the system. BRIEF DESCRIPTION OF THE DRAWINGS

[0017] The present invention will be further described below in conjunction with the accompanying drawings.

[0018] Figure 1 A flowchart of an RFID-based inventory management method is provided for an embodiment of the present invention; Figure 2A schematic structural diagram of an RFID-based inventory management device is provided for an embodiment of the present invention. DETAILED DESCRIPTION

[0019] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. The term "and / or" herein is only a description of the association relationship of the associated objects, indicating that there can be three relationships. For example, A and B can represent: A exists alone, A and B exist at the same time, and B exists alone. In addition, in the present invention, the description of "first", "second", etc. is only used for descriptive purposes, and cannot be understood as indicating or implying its relative importance or implicitly indicating the number of technical features indicated. Therefore, the features defined as "first" and "second" can explicitly or implicitly include at least one of the features. In addition, the technical solutions between the various embodiments can be combined with each other, but it must be based on the ability of ordinary technicians in the field to implement. When the combination of technical solutions is contradictory or cannot be implemented, it should be considered that such a combination of technical solutions does not exist and is not within the scope of protection required by the present invention.

[0020] Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making any creative work shall fall within the scope of protection of the present invention.

[0021] The embodiment of the present invention provides an inventory management method based on RFID. Figure 1 , Figure 1 A flowchart of an RFID-based inventory management method provided by an embodiment of the present invention. The method comprises the following steps: S101, obtaining all responding RFID tags through a target query instruction to obtain a first RFID tag set; S102, for each RFID tag in the first RFID tag set, substitute the tag into a preset query tree for query, and determine the tree node corresponding to each RFID tag; S103, if there are more than two RFID tags in the same tree node, detect the conflicting RFID tags through conflict detection; S104, if the corresponding detection result of the RFID tag is unrecognized, the RFID tag is recorded as an unregistered tag; S105, acquiring all unregistered tags in the first RFID tag set, and writing the unregistered tags into the system, so that all RFID tags in the first RFID tag set are successfully identified.

[0022] An RFID-based inventory management method provided by an embodiment of the present invention first obtains all responding RFID tags and queries them one by one according to a preset query tree, so that the tree node of each tag can be accurately determined, thereby improving the recognition rate of the tag. If there are more than two RFID tags on the same tree node, they are processed through conflict detection to avoid recognition errors or confusion caused by tag conflicts. For unrecognized tags, the system can identify them in time and effectively avoid continuous tag recognition, thereby improving the query efficiency of the system.

[0023] In one implementation, by first acquiring all responding RFID tags and querying them one by one according to a preset query tree, the tree node of each tag can be accurately determined, thereby improving the recognition rate of the tags and avoiding missed recognition.

[0024] In one implementation, the target query instruction is an instruction sent by the reader; if there is only one RFID tag for the same tree node, it means that there is no collision at the node and no processing is required; if there is an RFID tag whose corresponding detection result is not recognized, it means that the current node could not be recognized before due to a collision, and if there is an RFID tag whose corresponding detection result is not recognized, it means that the node is not recorded in the system.

[0025] In one implementation, if there are more than two RFID tags on the same tree node, they are processed through conflict detection to avoid recognition errors or confusion caused by tag conflicts, which helps to improve the stability and accuracy of the system in complex environments, especially in scenarios with dense tags.

[0026] In one implementation, for unrecognized tags, the system can promptly identify and mark them as "unregistered tags", which can effectively avoid "blindly" identified tags in the system, thereby improving the accuracy and reliability of the data.

[0027] In one implementation, unregistered tags are recorded and written into the system in a timely manner to ensure that these tags can be identified by subsequent identification processes. The system can gradually optimize its own database and tag management process to avoid missing any valid RFID tags.

[0028] In one implementation, through the design of tree structure query and conflict detection, the system can adapt to RFID tag sets of different sizes and still maintain high accuracy when deployed on a large scale; the structure of the query tree is used for rapid positioning, avoiding global scanning, thereby speeding up the identification process of RFID tags and improving the response efficiency of the system.

[0029] In one embodiment, substituting the tag into a preset query tree for querying includes: Step 1: Determine the longest common prefix of the IDs corresponding to all RFID tags in the first RFID tag set, intercept the longest common prefix, and use the longest common prefix as the root node; Step 2: For each RFID tag corresponding ID after the longest common prefix, generate a leaf node with the ID after the longest common prefix; Step 3: Take each leaf node as the main node, obtain the longest common prefix in turn, and use the longest common prefix as the current head node; Repeat steps 2 and 3 above until the last ID of the RFID tag is on a leaf node, and establish a preset query tree based on the root node and all leaf nodes.

[0030] In one implementation, by determining the longest common prefix of all RFID tag IDs and using it as the root node of the tree, the path length during query can be greatly reduced. The common prefix part of the root node represents the shared characteristics of multiple tags. Therefore, when constructing the query tree, the tree level and number of nodes can be effectively shortened, making the query process more efficient.

[0031] In one implementation, the leaf nodes are generated respectively using the IDs after the longest common prefix. Specifically, the ID after the longest common prefix may be 0 or 1, and a leaf node is generated with 0 and a leaf node is generated with 1.

[0032] In one implementation, each leaf node is used as the main node, the longest common prefix is ​​obtained in turn, the longest common prefix is ​​intercepted, and the longest common prefix is ​​used as the root node; for each RFID tag corresponding to the ID after the longest common prefix, a leaf node is generated respectively with the ID after the longest common prefix; and this is repeated until the last ID of the RFID tag also corresponds to a leaf node in the above steps.

[0033] In one implementation, after using the longest common prefix as the root node, the process of generating leaf nodes for each tag ID will be carried out according to more precise segmentation rules, which can greatly improve the efficiency of the query. The tree structure can hierarchically and gradually refine the query according to the differences in actual tags, without the need to perform a global search of all tags each time.

[0034] In one implementation, in the tree structure, each time a leaf node is generated, it is based on the differentiated part of the current tag ID, which can effectively reduce conflicts between multiple tags. When multiple tags share the same longest common prefix, their branches in the query tree are more uniform. When the tag IDs are different, the query tree can refine the branches and avoid misidentification of tags.

[0035] In one implementation, by recursively refining the longest common prefix and continuously generating new nodes, the tree structure can be gradually refined to the last digit of each tag ID, ensuring that each tag can be accurately located in the query tree, which can effectively improve the recognition accuracy of RFID tags.

[0036] In one embodiment, detecting the conflicting RFID tags through conflict detection includes: Get the common prefix corresponding to the current conflicting node. If the common prefix length is 1, re-receive the RFID tag that currently generates the conflict. If the length of the common prefix is ​​greater than 1, the sub-leaves corresponding to the node where the common prefix is ​​located are reorganized until there is no more than one RFID tag at the same tree node.

[0037] In one implementation, when an RFID tag conflicts, the source of the problem is first identified by obtaining the common prefix corresponding to the conflicting node. By judging the length of the common prefix, it is possible to flexibly decide whether to re-receive the tag or perform more fine-grained processing, which can effectively avoid performance degradation caused by overly complicated processing.

[0038] In one implementation, if a conflict still occurs after the currently conflicting RFID tag is re-received, the relevant technician is reminded, and the currently conflicting RFID tag is marked, and no subsequent operation is performed.

[0039] In one implementation, when a conflict occurs, when the common prefix length is 1, the system will re-receive the conflicting RFID tag, which means that the system will try to eliminate the conflict through more refined identification to avoid unnecessary expansion of the tree structure. As long as there is enough common prefix length, the tree structure can remain simple, avoiding excessive branching and expansion, ensuring the query efficiency and storage optimization of the tree.

[0040] In one implementation, if the common prefix length is greater than 1, the scheme will refine the conflicting nodes and reorganize the sub-leaves until each tree node contains only one RFID tag. It can make more detailed allocations based on the actual tags to ensure that each tag has a unique tree node. The sub-leaves of the conflicting nodes are reorganized to reduce the number of RFID tags in the same node to no more than one, which can greatly improve the accuracy of the query. Refining and reorganizing on the conflicting nodes can ensure that each tag can be quickly located during the query process to avoid recognition errors caused by conflicts.

[0041] In one embodiment, reorganizing the sub-leaves corresponding to the nodes where the common prefix is ​​located includes: Take the first number in the common prefix as the current main node and generate a binary tree based on the current main node; Traverse the binary tree and identify the node corresponding to the conflicting RFID tag when there is no collision in the binary tree, which is recorded as the initial target node; The current main node is split according to the initial target node so that all tree nodes correspond to at most one RFID tag.

[0042] In one implementation, by taking the first number in the common prefix as the main node and generating a binary tree, the system can split the conflicting nodes very accurately. Each tree node corresponds to at most one RFID tag. This can effectively avoid conflicts caused by multiple tags gathering at the same node, improve the accuracy of tag recognition, and ensure that each RFID tag can be uniquely identified when queried by accurately splitting the conflicting nodes.

[0043] In one implementation, when traversing a binary tree, the system can identify and process conflicting RFID tags, ensuring that they are assigned to nodes in the tree where no collision occurs. This processing method avoids misidentification between tags and ensures that the tree structure is clearer and more accurate through splitting operations, effectively reducing the occurrence of tag conflicts.

[0044] In one implementation, the process of generating a binary tree makes the tree structure more hierarchical and clearly layered. As a simple and efficient tree structure, the binary tree can quickly locate the position of each label, and by splitting nodes, the depth of the tree can be avoided to be too large, thereby ensuring the efficiency and speed of the query operation.

[0045] In one embodiment, obtaining all unregistered tags in the first RFID tag set and writing the unregistered tags into the system includes: prohibiting all known tags in the first RFID tag set, and obtaining, for all unregistered tags in the first RFID tag set, an idle time slot corresponding to each unregistered tag; For each unregistered tag, the unregistered tag is written into the system in the idle time slot corresponding to the unregistered tag through the EDFSA algorithm.

[0046] In one implementation, by allocating an idle time slot for writing to each unregistered tag, conflicts caused by competing for resources between tags can be effectively avoided, idle time slots in the system can be fully utilized, writing interference with existing tags can be avoided, and overall tag writing efficiency can be improved.

[0047] In one implementation, the EDFSA algorithm is used to schedule tag writing tasks to ensure that each tag is processed in the most appropriate time slot. By giving priority to tasks that are about to expire, resource utilization can be maximized and resource waste can be avoided, while ensuring that all tags in the system can be written in a timely manner.

[0048] In one implementation, Based on the same inventive concept, the embodiment of the present invention also provides an RFID-based inventory management device. Figure 2 , Figure 2 A schematic diagram of the structure of an RFID-based inventory management device provided by an embodiment of the present invention includes: An RFID tag acquisition module, used to acquire all responding RFID tags through a target query instruction to obtain a first RFID tag set; A tag query module, for querying each RFID tag in the first RFID tag set, substituting the tag into a preset query tree to determine a tree node corresponding to each RFID tag; The tag detection module is used to detect the conflicting RFID tags through conflict detection if there are more than two RFID tags in the same tree node; A tag identification module, used for recording the RFID tag as an unregistered tag if the corresponding detection result of the RFID tag is unidentified; The tag writing module is used to obtain all unregistered tags in the first RFID tag set and write the unregistered tags into the system so that all RFID tags in the first RFID tag set are successfully identified.

[0049] An RFID-based inventory management device provided by an embodiment of the present invention can accurately determine the tree node of each tag by first acquiring all responding RFID tags and querying them one by one according to a preset query tree, thereby improving the recognition rate of the tag. If there are more than two RFID tags on the same tree node, they are processed through conflict detection to avoid recognition errors or confusion caused by tag conflicts. For unrecognized tags, the system can identify them in time to effectively avoid continuous tag recognition, thereby improving the query efficiency of the system.

[0050] In one embodiment, the tag query module includes: A root node determination module, used to determine the longest common prefix of the IDs corresponding to all RFID tags in the first RFID tag set, intercept the longest common prefix, and use the longest common prefix as the root node; A leaf node generation module, for generating leaf nodes respectively according to the IDs after the longest common prefix for each RFID tag corresponding to the ID after the longest common prefix; A head node determination module is used to take each leaf node as a main node, obtain the longest common prefix in turn, and take the longest common prefix as the current head node; The preset query tree establishment module is used to repeat the leaf node generation module and the head node determination module until the last ID of the RFID tag is on the leaf node, and establish the preset query tree according to the root node and all the leaf nodes.

[0051] In one embodiment, the tag detection module includes: The tag re-receiving module is used to obtain the common prefix corresponding to the current conflicting node. If the common prefix length is 1, the RFID tag that currently generates the conflict is re-received. The reorganization module is used to reorganize the sub-leaves corresponding to the nodes where the common prefix is ​​located if the length of the common prefix is ​​greater than 1, until there is no more than one RFID tag in the same tree node.

[0052] In one embodiment, the recombination module comprises: A binary tree generation module, used to take the first number in the common prefix as the current main node and generate a binary tree according to the current main node; The initial target node determination module is used to traverse the binary tree and identify the node corresponding to the conflicting RFID tag when no collision occurs in the binary tree, which is recorded as the initial target node; The main node splitting module is used to split the current main node according to the initial target node so that all tree nodes correspond to at most one RFID tag.

[0053] In one embodiment, the tag writing module includes: A tag prohibition module, used to prohibit all known tags in the first RFID tag set, and for all unregistered tags in the first RFID tag set, obtain an idle time slot corresponding to each unregistered tag; The tag writing time determination module is used to write each unregistered tag into the system in an idle time slot corresponding to the unregistered tag by using the EDFSA algorithm.

[0054] The above is a detailed description of an embodiment of the present invention, but the content is only a preferred embodiment of the present invention and cannot be considered to limit the scope of implementation of the present invention. All equivalent changes and improvements made within the scope of the present invention should still fall within the scope of the patent coverage of the present invention.

Claims

1. An inventory management method based on RFID, characterized in that: The method comprises: Obtain all responding RFID tags through the target query instruction to obtain a first RFID tag set; For each RFID tag in the first RFID tag set, substitute the tag into a preset query tree for query, and determine the tree node corresponding to each RFID tag; If there are more than two RFID tags in the same tree node, the conflicting RFID tags are detected through conflict detection; If the corresponding detection result of the RFID tag is not recognized, the RFID tag is recorded as an unregistered tag; All unregistered tags in the first RFID tag set are obtained, and the unregistered tags are written into the system so that all RFID tags in the first RFID tag set are successfully identified.

2. The RFID-based inventory management method according to claim 1, characterized in that: Substituting the tag into the preset query tree for querying includes: Step 1: Determine the longest common prefix of the IDs corresponding to all RFID tags in the first RFID tag set, intercept the longest common prefix, and use the longest common prefix as the root node; Step 2: For each RFID tag corresponding ID after the longest common prefix, generate a leaf node with the ID after the longest common prefix; Step 3: Take each leaf node as the main node, obtain the longest common prefix in turn, and use the longest common prefix as the current head node; Repeat steps 2 and 3 above until the last ID of the RFID tag is on a leaf node, and establish a preset query tree based on the root node and all leaf nodes.

3. The RFID-based inventory management method according to claim 2, characterized in that: Detection of conflicting RFID tags through conflict detection includes: Obtain the common prefix corresponding to the current conflicting node, and if the length of the common prefix is ​​1, re-receive the RFID tag that currently generates the conflict; If the length of the common prefix is ​​greater than 1, the sub-leaves corresponding to the node where the common prefix is ​​located are reorganized until there is no more than one RFID tag at the same tree node.

4. The RFID-based inventory management method according to claim 3, characterized in that: Then, reorganizing the sub-leaves corresponding to the nodes where the common prefix is ​​located includes: Taking the first number in the common prefix as the current main node, generating a binary tree according to the current main node; Traversing the binary tree, identifying the node corresponding to the conflicting RFID tag when no collision occurs in the binary tree, and recording it as the initial target node; The current main node is split according to the initial target node so that all tree nodes correspond to at most one RFID tag.

5. The RFID-based inventory management method according to claim 1, characterized in that: Acquiring all unregistered tags in the first RFID tag set and writing the unregistered tags into the system includes: prohibiting all known tags in the first RFID tag set, and acquiring, for all unregistered tags in the first RFID tag set, an idle time slot corresponding to each unregistered tag; For each unregistered tag, the unregistered tag is written into the system in the idle time slot corresponding to the unregistered tag through the EDFSA algorithm.

6. An RFID-based inventory management device, characterized in that: The device comprises: An RFID tag acquisition module, used to acquire all responding RFID tags through a target query instruction to obtain a first RFID tag set; A tag query module, configured to substitute each RFID tag in the first RFID tag set into a preset query tree for query, and determine a tree node corresponding to each RFID tag; The tag detection module is used to detect the conflicting RFID tags through conflict detection if there are more than two RFID tags in the same tree node; A tag identification module, used for recording the RFID tag as an unregistered tag if the corresponding detection result of the RFID tag is unidentified; The tag writing module is used to obtain all unregistered tags in the first RFID tag set and write the unregistered tags into the system so that all RFID tags in the first RFID tag set are successfully identified.

7. The RFID-based inventory management device according to claim 6, characterized in that: The tag query module includes: A root node determination module, used to determine the longest common prefix of the IDs corresponding to all RFID tags in the first RFID tag set, intercept the longest common prefix, and use the longest common prefix as the root node; A leaf node generation module, for generating leaf nodes respectively according to the IDs after the longest common prefix for each RFID tag corresponding to the ID after the longest common prefix; A head node determination module is used to take each leaf node as a main node, obtain the longest common prefix in turn, and take the longest common prefix as the current head node; The preset query tree establishment module is used to repeat the leaf node generation module and the head node determination module until the last ID of the RFID tag is on the leaf node, and establish a preset query tree according to the root node and all leaf nodes.

8. The RFID-based inventory management device according to claim 7, characterized in that: The tag detection module comprises: A tag re-receiving module is used to obtain the common prefix corresponding to the current conflicting node, and if the length of the common prefix is ​​1, re-receive the RFID tag that currently generates the conflict; The reorganization module is used to reorganize the sub-leaves corresponding to the nodes where the common prefix is ​​located if the length of the common prefix is ​​greater than 1, until there is no more than one RFID tag at the same tree node.

9. The RFID-based inventory management device according to claim 8, characterized in that: The recombination module comprises: A binary tree generation module, used to take the first number in the common prefix as the current main node and generate a binary tree according to the current main node; An initial target node determination module is used to traverse the binary tree and identify the node corresponding to the conflicting RFID tag when no collision occurs in the binary tree, and record it as the initial target node; The main node splitting module is used to split the current main node according to the initial target node so that all tree nodes correspond to at most one RFID tag.

10. The RFID-based inventory management device according to claim 6, characterized in that: The label writing module comprises: A tag prohibition module, used to prohibit all known tags in the first RFID tag set, and for all unregistered tags in the first RFID tag set, obtain an idle time slot corresponding to each unregistered tag; The tag writing time determination module is used to write each unregistered tag into the system in an idle time slot corresponding to the unregistered tag by using the EDFSA algorithm.

Images