Visual intelligent storage system and method for shield segment wireless radio frequency identification
By deploying RFID tags on shield tube sheets and building a binary tree for management, the problem of inefficiency in shield tube sheet storage management is solved, and efficient and accurate tag reading and management is achieved.
Patent Information
- Application Number
- CN202411088373.9
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-09
- Publication Date
- 2024-11-29
- Estimated Expiration
- 2044-08-09
AI Technical Summary
The existing radio frequency identification (RFID) technology is inefficient in the warehousing management of shield pipe segments, prone to misreading and misreading, and has low estimation accuracy, which cannot meet the real-time management needs.
By deploying RFID tags on the shield tube sheet and dividing the warehouse into multiple areas, each area is equipped with independent RFID reading and writing equipment and data processing units, a binary tree is built for tag search and management, and the binary tree is dynamically adjusted to optimize the search efficiency.
It improves the reading efficiency of RFID tags, reduces retrieval time, and reduces the situation of tag collisions. It is suitable for a large number of tag scenarios and improves the real-time and accuracy of warehousing management.
Smart Images

Figure CN118618777B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of wireless radio frequency identification technology, and in particular to a visual intelligent storage system and method for wireless radio frequency identification of shield tunneling segments. Background Art
[0002] In modern construction projects, shield segments are key components of tunnel construction, and their management and tracking are particularly important. Traditional storage management systems often rely on manual recording and retrieval, which is not only inefficient but also prone to errors. Especially in large-scale shield segment storage and use scenarios, how to quickly and accurately identify and track them has become a technical challenge. In addition, with the increasing complexity of engineering projects, the demand for quality control and historical record traceability of shield segments has also increased. Therefore, the development of an intelligent storage system that can automatically identify, track and manage shield segments has become the key to solving this problem.
[0003] In the prior art, publication number CN108491908B discloses a visual intelligent warehousing system and method based on wireless radio frequency identification, in which electronic tags with item information are arranged on different items in the warehouse, and the electronic tags within the range are activated and read by an RFID handheld terminal, and the item information is uploaded to a server for identification, and the number of electronic tags to be identified around the RFID handheld terminal is estimated by an estimation method.
[0004] The main problems with the above methods are: the efficiency of tag reading through RFID handheld terminals is low. When reading a large number of tags, data processing and transmission delays may be encountered, affecting real-time management efficiency, especially in areas with dense items, where missed readings and misreadings may occur; and the reading range of RFID handheld terminals is limited, requiring staff to operate in the warehouse at all times, which results in a large workload. When estimating the number of electronic tags, the lower limit estimation method, Schoute estimation method and Vogt estimation method are used. These estimation methods have the problems of low estimation accuracy and high computational complexity, which are insufficient to meet the needs of timely reading of RFID tags.
[0005] The above information disclosed in this Background section is only for enhancement of understanding of the background of the present disclosure and therefore it may contain information that does not constitute the prior art that is already known to one of ordinary skill in the art. Summary of the invention
[0006] The purpose of the present invention is to provide a visual intelligent storage system and method for radio frequency identification of shield segments to solve the problems raised in the above-mentioned background technology.
[0007] To achieve the above object, the present invention provides the following technical solutions:
[0008] A visual intelligent storage system for shield segment wireless radio frequency identification, specifically comprising:
[0009] The tag deployment module is used to deploy RFID tags on all shield segments. Each chip contains the key information of the shield segment, including: production batch and date, technical parameters, quality inspection status, usage records and storage location;
[0010] The area division module is used to divide the warehouse into several areas, equip each area with an independent RFID reader and data processing unit, and determine the size and number of the divided areas according to the reading range of the RFID reader;
[0011] A binary tree construction module is used to assign a unique binary code to each RFID tag, and to construct a binary tree according to the binary code. For each binary code, read each bit from left to right. If it is 0, move to the left child node of the current node. If there is no child node, create a new left child node. If it is 1, move to the right child node of the current node. If there is no right child node, create a new right child node. Until all binary codes are inserted into the binary tree, a binary tree is constructed for each region respectively, and all regional binary trees are combined into a total binary tree.
[0012] The tag retrieval module is used to retrieve the RFID tag. Starting from the root node of the total binary tree, the binary code to be searched is compared bit by bit. When the current search bit is 0, it moves to the left child node, and when the current search bit is 1, it moves to the right child node until the corresponding leaf node is found, which is the position of the RFID tag to be searched. When the position of the RFID tag changes, the binary node at the old position is deleted, and the corresponding binary node is inserted at the new position;
[0013] The algorithm optimization module is used to generate a comprehensive evaluation index of a node for the constructed binary tree according to the retrieval situation of the RFID tag, and to set a high priority threshold, a medium priority threshold, and a low priority threshold for node adjustment. The constructed binary tree is dynamically adjusted according to the relationship between the comprehensive evaluation index of each node and the threshold.
[0014] The monitoring module is used to continuously monitor the operating status of the RFID reading and writing device and the binary tree, and promptly troubleshoot any abnormal situations that occur, including: reading and writing failures and node errors.
[0015] Furthermore, the principle for determining the size and number of divided areas according to the reading range of the RFID reader / writer is as follows:
[0016]
[0017]
[0018] in, Indicates the size of the partition area. Indicates the maximum read / write radius of the RFID read / write device. Indicates the number of partitioned areas. Indicates the size of the warehouse area.
[0019] Furthermore, the formula for assigning a unique binary code to each RFID tag is:
[0020] in, Indicates the number of binary digits, that is, the minimum number of binary digits required to uniquely identify each RFID tag; Indicates the number of RFID tags;
[0021] The decimal number corresponding to the label is , for each label's decimal number, convert it into a binary sequence with b bits.
[0022] Furthermore, the principle for comparing the binary code to be found bit by bit is:
[0023] The movement of nodes is based on the formula:
[0024]
[0025] in, represents the current node in the binary tree, Indicates the first binary code to be found Bit, represents the index of the digit in the binary code, and , The total number of digits representing the binary code, Retrieve the left child node of the current node. Retrieves the right child node of the current node.
[0026] Furthermore, the principle for generating the comprehensive evaluation index of a node is as follows:
[0027] First, identify which nodes need to be split and merged. The principle is:
[0028] The formula for generating node conflict frequency is:
[0029]
[0030] in, represents the conflict frequency of the node, Indicates the number of conflicts that occurred when retrieving tags. Indicates the total number of times a tag is retrieved;
[0031] The formula based on which the retrieval efficiency is generated is:
[0032]
[0033]
[0034] in, Indicates the total response time of the node to retrieve the label, Indicates The response time of the tag retrieval, represents the retrieval efficiency, Indicates the number of successful retrievals;
[0035] The formula used to generate the comprehensive assessment index is:
[0036]
[0037] in, represents the comprehensive evaluation index, Indicates the influence weight of the node's conflict frequency, represents the influence weight of node retrieval efficiency, ,and .
[0038] Furthermore, according to the relationship between the comprehensive evaluation index of each node and the threshold, the principle for dynamically adjusting the constructed binary tree is as follows:
[0039] Different adjustment strategies are distinguished and three different thresholds are set, namely, high priority threshold, medium priority threshold and low priority threshold. The formula for generating the high priority threshold is:
[0040]
[0041]
[0042]
[0043] in, Represents the average value of the comprehensive evaluation index of all nodes, Indicates the number of nodes, Indicates The comprehensive evaluation index of each node, represents the standard deviation of the comprehensive evaluation index of all nodes, Indicates the high priority threshold;
[0044] The formula used to generate the medium priority threshold is:
[0045]
[0046] in, Indicates the medium priority threshold;
[0047] The formula used to generate the low priority threshold is:
[0048]
[0049] in, Indicates the low priority threshold;
[0050] According to the relationship between the comprehensive evaluation index of each node and the threshold, the corresponding node adjustment strategy is generated based on the following principles:
[0051] When satisfied When , the current node is marked as a high-priority node and node splitting is required;
[0052] When satisfied When the node is marked as a medium priority node, it will be continuously monitored without any adjustment;
[0053] When satisfied When the current node is marked as a node of other priority, it will be continuously monitored without any adjustment;
[0054] When satisfied , the current node is marked as a low-priority node and needs to be merged with other low-priority nodes.
[0055] Furthermore, the node adjustment strategy is:
[0056] Node splitting: Select the node to be split to retrieve the median of the RFID tag, and use the median as the splitting point to split the left and right child nodes. Assign the RFID tags before the median to the left child node, and assign the RFID tags after the median to the right child node.
[0057] Node merging: Select two nodes that need to be merged, migrate the RFID tags that need to be retrieved from one node to the other node, and delete the empty nodes.
[0058] The present invention also provides a visual intelligent storage method for shield segment wireless radio frequency identification, which is performed by the visual intelligent storage system for shield segment wireless radio frequency identification, and the specific steps include:
[0059] Step 1: Deploy RFID tags on all shield segments. Each chip contains key information of the shield segment, including: production batch and date, technical parameters, quality inspection status, usage records and storage location;
[0060] Step 2: Divide the warehouse into several areas, equip each area with an independent RFID reader and data processing unit, and determine the size and number of divided areas according to the reading range of the RFID reader;
[0061] Step 3: Assign a unique binary code to each RFID tag, build a binary tree based on the binary code, read each bit from left to right for each binary code, if it is 0, move to the left child node of the current node, if there is no child node, create a new left child node, if it is 1, move to the right child node of the current node, if there is no right child node, create a new right child node, until all binary codes are inserted into the binary tree, build a binary tree for each area respectively, and combine all regional binary trees into a total binary tree;
[0062] Step 4: Retrieve the RFID tag. Starting from the root node of the total binary tree, compare the binary code to be searched bit by bit. Move to the left child node when the current search bit is 0, and move to the right child node when the current search bit is 1, until the corresponding leaf node is found, which is the position of the RFID tag to be searched. When the position of the RFID tag changes, delete the binary node at the old position and insert the corresponding binary node at the new position.
[0063] Step 5: For the binary tree that has been constructed, generate the comprehensive evaluation index of the node according to the retrieval situation of the RFID tag, and set the high priority threshold, medium priority threshold and low priority threshold of the node adjustment. According to the relationship between the comprehensive evaluation index and the threshold of each node, dynamically adjust the constructed binary tree;
[0064] Step 6: Continuously monitor the operating status of the RFID reader and the binary tree, and promptly troubleshoot any abnormalities that occur, including read / write failures and node errors.
[0065] Compared with the prior art, the beneficial effects of the present invention are as follows: the present invention divides the storage area into several areas according to the read-write radius of the RFID read-write device, splits the search of an entire area into the reading of several sub-areas, reduces the search time, generates a binary tree for each area, integrates all the regional binary trees to generate a binary tree for the entire storage area, generates a unique binary code for each RFID tag, and substitutes the unique binary code into the binary tree to find the corresponding RFID tag information, which is suitable for scenes with a large number of tags and reduces the situation of tag collision. On this basis, the present invention improves the binary tree algorithm, generates a comprehensive evaluation index by calculating the conflict frequency and search efficiency of each node, judges the reading performance of the current node by the comprehensive evaluation index, determines the priority threshold of the node by statistical distribution, compares the comprehensive evaluation index and the priority threshold, judges the priority of the current node, the higher the node priority, the more tags the node currently searches for, and the worse the performance, reduces the load of a single node by node splitting, improves the search efficiency, and the lower the node priority, the more idle the node is, and merges the idle nodes into one node to reduce resource waste. Through the improved binary tree algorithm, dynamic reading of RFID tags is realized, and the stability of the binary tree is guaranteed. BRIEF DESCRIPTION OF THE DRAWINGS
[0066] Figure 1 This is a schematic diagram of the system modules of an embodiment of the present invention;
[0067] Figure 2 The figure is a schematic diagram of the method flow of an embodiment of the present invention. DETAILED DESCRIPTION
[0068] In order to make the objectives, technical solutions and advantages of the present invention more clearly understood, the present invention is further described in detail below in conjunction with specific embodiments.
[0069] It should be noted that, unless otherwise defined, the technical terms or scientific terms used in the present invention should be understood by people with ordinary skills in the field to which the present invention belongs. The words "first", "second" and similar words used in the present invention do not indicate any order, quantity or importance, but are only used to distinguish different components. "Include" or "comprise" and similar words mean that the elements or objects appearing before the word include the elements or objects listed after the word and their equivalents, without excluding other elements or objects. "Connect" or "connected" and similar words are not limited to physical or mechanical connections, but may include electrical connections, whether direct or indirect. "Up", "down", "left", "right" and the like are only used to indicate relative positional relationships. When the absolute position of the described object changes, the relative positional relationship may also change accordingly.
[0070] Example:
[0071] See also Figure 1 , the present invention provides a technical solution:
[0072] A visual intelligent storage system for shield segment wireless radio frequency identification, specifically comprising:
[0073] The tag deployment module is used to deploy RFID tags on all shield segments. Each chip contains the key information of the shield segment, including: production batch and date, technical parameters, quality inspection status, usage records and storage location;
[0074] The area division module is used to divide the warehouse into several areas, equip each area with an independent RFID reader and data processing unit, and determine the size and number of the divided areas according to the reading range of the RFID reader;
[0075] In this embodiment, the principle for determining the size and number of divided areas according to the reading range of the RFID reader / writer is as follows:
[0076]
[0077]
[0078] in, Indicates the size of the partition area. Indicates the maximum read / write radius of the RFID read / write device. Indicates the number of partitioned areas. Indicates the size of the warehouse area, Is the round-up symbol, indicating the number of divided areas Round up.
[0079] The read / write area of the RFID reader / writer can be roughly regarded as a To facilitate the area division, the circle is approximately represented as a circle with a side length of The number of areas is obtained by rounding up the quotient of the total area size of the warehouse and the size of the read-write area.
[0080] A binary tree construction module is used to assign a unique binary code to each RFID tag, and to construct a binary tree according to the binary code. For each binary code, read each bit from left to right. If it is 0, move to the left child node of the current node. If there is no child node, create a new left child node. If it is 1, move to the right child node of the current node. If there is no right child node, create a new right child node. Until all binary codes are inserted into the binary tree, a binary tree is constructed for each region respectively, and all regional binary trees are combined into a total binary tree.
[0081] In this embodiment, the formula for assigning a unique binary code to each RFID tag is:
[0082]
[0083] in, Indicates the number of binary digits, that is, the minimum number of binary digits required to uniquely identify each RFID tag; Indicates the number of RFID tags, Is the round-up symbol, indicating the number of binary digits Round up;
[0084] The decimal number corresponding to the label is , for each label’s decimal number, convert it into a binary sequence with a number of bits b;
[0085] The tag retrieval module is used to retrieve the RFID tag. Starting from the root node, it compares the binary code to be searched bit by bit. When the current search bit is 0, it moves to the left child node, and when the current search bit is 1, it moves to the right child node until the corresponding leaf node is found, which is the position of the RFID tag to be searched. When the position of the RFID tag changes, the binary node at the old position is deleted, and the corresponding binary node is inserted at the new position.
[0086] In this embodiment, the principle of comparing the binary code to be searched bit by bit is:
[0087] The movement of nodes is based on the formula:
[0088]
[0089] in, represents the current node in the binary tree, Indicates the first binary code to be found Bit, represents the index of the digit in the binary code, and , The total number of digits representing the binary code, Retrieve the left child node of the current node. Indicates retrieving the right child node of the current node;
[0090] Starting from the current node, for each digit of the binary code, if the number is 0, search for the left child node, if the number is 1, search for the right child node, starting from the root node, and searching all the way to the leaf node. The binary number value on the corresponding path represents the corresponding RFID tag binary code.
[0091] The algorithm optimization module is used to generate a comprehensive evaluation index of a node for the constructed binary tree according to the retrieval situation of the RFID tag, and to set a high priority threshold, a medium priority threshold, and a low priority threshold for node adjustment. The constructed binary tree is dynamically adjusted according to the relationship between the comprehensive evaluation index of each node and the threshold.
[0092] In this embodiment, the principle for generating the comprehensive evaluation index of the node is:
[0093] First, identify which nodes need to be split and merged. The principle is:
[0094] The formula for generating node conflict frequency is:
[0095]
[0096] in, represents the conflict frequency of the node, Indicates the number of conflicts that occurred when retrieving tags. Indicates the total number of times a tag is retrieved;
[0097] The conflict frequency of a node reflects the number of RFID tags read by the node. The more RFID tags a node reads, the higher the probability of a conflict and the more times a conflict occurs. The conflict frequency of a node is proportional to the number of conflicts when retrieving tags, and the number of conflicts when retrieving tags is proportional to the number of tags retrieved. The conflict frequency of a node is proportional to the number of RFID tags retrieved by the node.
[0098] The formula based on which the retrieval efficiency is generated is:
[0099]
[0100]
[0101] in, Indicates the total response time of the node to retrieve the label, Indicates The response time of the tag retrieval, represents the retrieval efficiency, Indicates the number of successful retrievals;
[0102] Retrieval efficiency reflects the success rate of node retrieval labels per unit time. Indicates the response time, This means that the response time is converted into a positive indicator. The more successful retrieval times, the shorter the response time, and the higher the retrieval efficiency of the node.
[0103] The formula used to generate the comprehensive assessment index is:
[0104]
[0105] in, represents the comprehensive evaluation index, Indicates the influence weight of the node's conflict frequency, represents the influence weight of node retrieval efficiency, ,and .
[0106] The comprehensive evaluation index is a comprehensive consideration of the node retrieval conflict frequency and retrieval success rate. It is a negative impact value. The larger the comprehensive evaluation index value, the lower the reading efficiency of the current node and the higher the error rate, which reflects the stability of the current system. High conflict and low retrieval success rate indicate poor node performance. The comprehensive evaluation index is proportional to the retrieval conflict frequency and inversely proportional to the retrieval success rate. The impact weight is determined based on historical data analysis. The value of conflict frequency has a greater impact on system performance, so , ;
[0107] In this embodiment, the principle for dynamically adjusting the constructed binary tree according to the relationship between the comprehensive evaluation index of each node and the threshold is as follows:
[0108] Different adjustment strategies are distinguished and three different thresholds are set, namely, high priority threshold, medium priority threshold and low priority threshold. The formula for generating the high priority threshold is:
[0109]
[0110]
[0111]
[0112] in, Represents the average value of the comprehensive evaluation index of all nodes, Indicates the number of nodes, Indicates The comprehensive evaluation index of each node, represents the standard deviation of the comprehensive evaluation index of all nodes, Indicates the high priority threshold;
[0113] The formula used to generate the medium priority threshold is:
[0114]
[0115] in, Indicates the medium priority threshold;
[0116] The formula used to generate the low priority threshold is:
[0117]
[0118] in, Indicates the low priority threshold;
[0119] The priority threshold is determined using a method based on statistical distribution. When there are enough nodes, the comprehensive evaluation index of the node approximately satisfies the normal distribution. About 95% of the data will fall within the range of the mean plus or minus two standard deviations. Therefore, the mean plus two standard deviations is used as the high priority threshold, the mean plus one standard deviation is used as the medium priority threshold, and the mean minus two standard deviations is used as the low priority threshold. This can cover most of the data. When the comprehensive evaluation index of the node is greater than the high priority threshold, it means that the node retrieves too many RFID tags at this time, the space utilization rate is very low, and the adjustment priority is very high. When the comprehensive evaluation index of the node is between the low priority threshold and the high priority threshold, the node is continuously monitored. If it remains within this range and other nodes do not need the node to be adjusted, it will not be adjusted. When the comprehensive evaluation index of the node is less than the low priority threshold, it means that the current node retrieves too few RFID tags, the resource utilization rate is low, and adjustment is required.
[0120] According to the relationship between the comprehensive evaluation index of each node and the threshold, the corresponding node adjustment strategy is generated based on the following principles:
[0121] When satisfied When , the current node is marked as a high-priority node and node splitting is required;
[0122] When satisfied When the node is marked as a medium priority node, it will be continuously monitored without any adjustment;
[0123] When satisfied When the current node is marked as a node of other priority, it will be continuously monitored without any adjustment;
[0124] When satisfied When , the current node is marked as a low-priority node and needs to be merged with other low-priority nodes;
[0125] For high-priority nodes, the number of RFID tags retrieved is too large, resulting in reduced efficiency. It is necessary to split it into two nodes and perform tag retrieval separately. The median of the RFID tag to be retrieved by the split node is selected, and the left and right child nodes are split with the median as the split point. The RFID tags before the median are assigned to the left child node, and the RFID tags after the median are assigned to the right child node.
[0126] For low-priority nodes, the number of RFID tags they retrieve is too small, resulting in low resource utilization. They need to be merged into one node with other low-priority nodes and read the tags together. Select two nodes that need to be merged, migrate the RFID tags that need to be retrieved by one of the nodes to the other node, and delete empty nodes to reduce the depth of the tree.
[0127] The monitoring module is used to continuously monitor the operating status of the RFID reading and writing device and the binary tree, and promptly troubleshoot any abnormal situations that occur, including: reading and writing failures and node errors.
[0128] In the case of read / write failure, the system automatically retries multiple times. If it still fails after retries, it triggers a device check to check the hardware status of the RFID read / write device. If the problem is still not solved, an alarm notification is sent to the maintenance personnel.
[0129] In the case of node errors, locate the position of the error node and rebuild the node. If the reconstruction fails, split a node from a low-priority node to replace the error node.
[0130] See also Figure 2 The present invention also provides a visual intelligent storage method for shield segment wireless radio frequency identification, which is executed by the visual intelligent storage system for shield segment wireless radio frequency identification, and the specific steps include:
[0131] Step 1: Deploy RFID tags on all shield segments. Each chip contains key information of the shield segment, including: production batch and date, technical parameters, quality inspection status, usage records and storage location;
[0132] Step 2: Divide the warehouse into several areas, equip each area with an independent RFID reader and data processing unit, and determine the size and number of divided areas according to the reading range of the RFID reader;
[0133] Step 3: Assign a unique binary code to each RFID tag, build a binary tree based on the binary code, read each bit from left to right for each binary code, if it is 0, move to the left child node of the current node, if there is no child node, create a new left child node, if it is 1, move to the right child node of the current node, if there is no right child node, create a new right child node, until all binary codes are inserted into the binary tree, build a binary tree for each area respectively, and combine all regional binary trees into a total binary tree;
[0134] Step 4: Retrieve the RFID tag. Starting from the root node of the total binary tree, compare the binary code to be searched bit by bit. Move to the left child node when the current search bit is 0, and move to the right child node when the current search bit is 1, until the corresponding leaf node is found, which is the position of the RFID tag to be searched. When the position of the RFID tag changes, delete the binary node at the old position and insert the corresponding binary node at the new position.
[0135] Step 5: For the binary tree that has been constructed, generate the comprehensive evaluation index of the node according to the retrieval situation of the RFID tag, and set the high priority threshold, medium priority threshold and low priority threshold of the node adjustment. According to the relationship between the comprehensive evaluation index and the threshold of each node, dynamically adjust the constructed binary tree;
[0136] Step 6: Continuously monitor the operating status of the RFID reader and the binary tree, and promptly troubleshoot any abnormalities that occur, including read / write failures and node errors.
[0137] 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.
[0138] The above embodiments may be implemented in whole or in part by software, hardware, firmware or any other combination thereof. When implemented by software, the above embodiments may be implemented in whole or in part in the form of a computer program product. Those skilled in the art may appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein may be implemented by electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed by hardware or software methods depends on the specific application and design constraints of the technical solution.
[0139] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, and may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
[0140] The above description is only a specific implementation manner of the present application, but the protection scope of the present application is not limited thereto. Any technician familiar with the 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.
Claims
1. A visual intelligent storage system for shield segment radio frequency identification, characterized in that: Specifically include: The tag deployment module is used to deploy RFID tags on all shield segments. Each chip contains the key information of the shield segment, including: production batch and date, technical parameters, quality inspection status, usage records and storage location; The area division module is used to divide the warehouse into several areas, equip each area with an independent RFID reader and data processing unit, and determine the size and number of the divided areas according to the reading range of the RFID reader; A binary tree construction module is used to assign a unique binary code to each RFID tag, and to construct a binary tree according to the binary code. For each binary code, read each bit from left to right. If it is 0, move to the left child node of the current node. If there is no child node, create a new left child node. If it is 1, move to the right child node of the current node. If there is no right child node, create a new right child node. Until all binary codes are inserted into the binary tree, a binary tree is constructed for each region respectively, and all regional binary trees are combined into a total binary tree. The tag retrieval module is used to retrieve the RFID tag. Starting from the root node of the total binary tree, the binary code to be searched is compared bit by bit. When the current search bit is 0, it moves to the left child node, and when the current search bit is 1, it moves to the right child node until the corresponding leaf node is found, which is the position of the RFID tag to be searched. When the position of the RFID tag changes, the binary node at the old position is deleted, and the corresponding binary node is inserted at the new position; The algorithm optimization module is used to generate a comprehensive evaluation index of a node for the constructed binary tree according to the retrieval situation of the RFID tag, and to set a high priority threshold, a medium priority threshold, and a low priority threshold for node adjustment. The constructed binary tree is dynamically adjusted according to the relationship between the comprehensive evaluation index of each node and the threshold. The monitoring module is used to continuously monitor the operating status of the RFID reading and writing device and the binary tree, and promptly troubleshoot any abnormal situations that occur, including: reading and writing failures and node errors.
2. According to claim 1, a visual intelligent storage system for radio frequency identification of shield segments is characterized by: The principle for determining the size and number of divided areas according to the reading range of the RFID reader / writer in the area division module is as follows: S1=(2R) 2 Among them, S1 represents the size of the divided area, R represents the maximum read-write radius of the RFID reading and writing device, N represents the number of divided areas, and S0 represents the size of the warehouse area.
3. According to claim 1, a visual intelligent storage system for radio frequency identification of shield segments is characterized by: The formula for assigning a unique binary code to each RFID tag in the binary tree building module is: Where b represents the number of binary digits, that is, the minimum number of binary digits required to uniquely identify each RFID tag; K represents the number of RFID tags; The decimal numbers corresponding to the labels are 0, 1, 2, ..., K-1. For each decimal number of the label, it is converted into a binary sequence with a bit number of b.
4. According to claim 1, a visual intelligent storage system for radio frequency identification of shield segments is characterized by: The principle of comparing the binary code to be searched bit by bit in the tag search module is: The movement of nodes is based on the formula: Among them, x represents the current node in the binary tree, b[p] represents the p-th bit of the binary code to be found, p represents the index of the number of digits in the binary code, and p=1, 2, ..., P, P represents the total number of digits in the binary code, left represents retrieving the left child node of the current node, and right represents retrieving the right child node of the current node.
5. According to claim 1, a visual intelligent storage system for radio frequency identification of shield segments is characterized by: The principle on which the comprehensive evaluation index of the generated nodes in the algorithm optimization module is based is: First, identify which nodes need to be split and merged. The principle is: The formula for generating node conflict frequency is: Among them, H Q represents the conflict frequency of the node, F represents the number of conflicts when retrieving labels, and M represents the total number of times the labels are retrieved; The formula based on which the retrieval efficiency is generated is: Among them, t represents the total response time of node retrieval label, t0 represents the response time of the oth retrieval label, W represents the retrieval efficiency, and M0 represents the number of successful retrievals; The formula used to generate the comprehensive assessment index is: in, represents the comprehensive evaluation index, w1 represents the influence weight of the node conflict frequency, w2 represents the influence weight of the node retrieval efficiency, w1+w2=1, and w1>w2.
6. The visual intelligent storage system for radio frequency identification of shield segments according to claim 1 is characterized by: The principle for dynamically adjusting the constructed binary tree in the algorithm optimization module according to the relationship between the comprehensive evaluation index of each node and the threshold is as follows: Different adjustment strategies are distinguished and three different thresholds are set, namely, high priority threshold, medium priority threshold and low priority threshold. The formula for generating the high priority threshold is: in, represents the average value of the comprehensive evaluation index of all nodes, S represents the number of nodes, represents the comprehensive evaluation index of the ith node, σ represents the standard deviation of the comprehensive evaluation index of all nodes, and D high Indicates the high priority threshold; The formula used to generate the medium priority threshold is: Among them, D mid Indicates the medium priority threshold; The formula used to generate the low priority threshold is: Among them, D min Indicates the low priority threshold; According to the relationship between the comprehensive evaluation index of each node and the threshold, the corresponding node adjustment strategy is generated based on the following principles: When satisfied When , the current node is marked as a high-priority node and node splitting is required; When satisfied When the node is marked as a medium priority node, it will be continuously monitored without any adjustment; When satisfied When the current node is marked as a node of other priority, it will be continuously monitored without any adjustment; When satisfied , the current node is marked as a low-priority node and needs to be merged with other low-priority nodes.
7. The visual intelligent storage system for radio frequency identification of shield segments according to claim 6 is characterized by: The node adjustment strategy is: Node splitting: Select the node to be split to retrieve the median of the RFID tag, and use the median as the splitting point to split the left and right child nodes. Assign the RFID tags before the median to the left child node, and assign the RFID tags after the median to the right child node. Node merging: Select two nodes that need to be merged, migrate the RFID tags that need to be retrieved from one node to the other node, and delete the empty nodes.
8. A visual intelligent storage method for shield tunneling segments using radio frequency identification, characterized in that: The method is performed by the visual intelligent storage system for radio frequency identification of shield segments according to any one of claims 1 to 7, and the specific steps include: Step 1: Deploy RFID tags on all shield segments. Each chip contains key information of the shield segment, including: production batch and date, technical parameters, quality inspection status, usage records and storage location; Step 2: Divide the warehouse into several areas, equip each area with an independent RFID reader and data processing unit, and determine the size and number of divided areas according to the reading range of the RFID reader; Step 3: Assign a unique binary code to each RFID tag, build a binary tree based on the binary code, read each bit from left to right for each binary code, if it is 0, move to the left child node of the current node, if there is no child node, create a new left child node, if it is 1, move to the right child node of the current node, if there is no right child node, create a new right child node, until all binary codes are inserted into the binary tree, build a binary tree for each area respectively, and combine all regional binary trees into a total binary tree; Step 4: Retrieve the RFID tag. Starting from the root node of the total binary tree, compare the binary code to be searched bit by bit. Move to the left child node when the current search bit is 0, and move to the right child node when the current search bit is 1, until the corresponding leaf node is found, which is the position of the RFID tag to be searched. When the position of the RFID tag changes, delete the binary node at the old position and insert the corresponding binary node at the new position. Step 5: For the binary tree that has been constructed, generate the comprehensive evaluation index of the node according to the retrieval situation of the RFID tag, and set the high priority threshold, medium priority threshold and low priority threshold of the node adjustment. According to the relationship between the comprehensive evaluation index and the threshold of each node, dynamically adjust the constructed binary tree; Step 6: Continuously monitor the operating status of the RFID reader and the binary tree, and promptly troubleshoot any abnormalities that occur, including read / write failures and node errors.
Citation Information
Patent Citations
A Visualized Intelligent Warehousing System and Method Based on Radio Frequency Identification
CN108491908B
Logistics warehouse management system based on wireless radio frequency technology
CN103839140A
Subway shield segment attitude monitoring and management system based on Internet of Things and cloud computing
CN106022560A
