Label identification method and device, equipment and storage medium

Abstract

The invention provides a label identification method and device, equipment and a storage medium, and the method comprises the steps: transmitting radio frequency signals to a target region for multiple times; identifying the first label according to the response level of each label in the target area; according to the values on the first N bits in the first tag, determining whether the values on the first N bits of each target tag except the first tag are the same as the values on the first N bits in the first tag; and if yes, transmitting radio frequency signals to each target tag for multiple times according to the values on the first N bits, and sequentially identifying the values on the last M bits in each target tag according to the response level of each target tag. According to the method and the device, rapid identification of the labels is realized, the label identification efficiency is improved, and meanwhile, due to the fact that each label is identified according to the response level of each label, the phenomenon of missed identification can be avoided.

Description

Technical Field

[0001] The present application relates to the field of label processing technology, and in particular to a label identification method, device, equipment and storage medium. Background Art

[0002] Tags based on RFID high-frequency technology are often used to bind multiple products inside boxes on high-speed production lines. During production, it is necessary to quickly and stably identify all tags in the box in a very short time. Since the identified products are moving at high speed on the production line and the reader has limited time to identify each product tag, incomplete identification often occurs.

[0003] In the prior art, label identification is usually performed according to the ISO14443A standard process. Specifically, during a fast-moving multi-label inventory, multiple segments of labels that need to be identified are identified one by one.

[0004] However, this tag recognition method will perform a large number of repeated tag recognition actions, which is inefficient for the limited inventory time and may cause missed recognition. Summary of the invention

[0005] The purpose of this application is to provide a tag identification method, device, equipment and storage medium to address the deficiencies in the above-mentioned prior art, so as to solve the problems of low efficiency and missed identification in the prior art.

[0006] To achieve the above purpose, the technical solution adopted in the embodiment of the present application is as follows:

[0007] In a first aspect, an embodiment of the present application provides a tag identification method, the method comprising:

[0008] Sending radio frequency signals to the target area multiple times;

[0009] identifying a first tag according to a response level of each tag in the target area;

[0010] Determine, based on the values ​​of the first N bits in the first label, whether the values ​​of the first N bits of each target label other than the first label are the same as the values ​​of the first N bits in the first label;

[0011] If so, a radio frequency signal is sent to each target tag multiple times according to the value of the first N bits, and the value of the last M bits in each target tag is identified in turn according to the response level of each target tag, wherein N and M are integers greater than 0 respectively.

[0012] In a possible implementation, the step of identifying the first tag according to the response level of each tag in the target area includes:

[0013] A1. Determine the current conflicting bit and the current value of the current conflicting bit;

[0014] B1, combining the current value of the current conflicting bit and the values ​​of all bits before the current conflicting bit into the first value to be sent;

[0015] C1. Sending a radio frequency signal corresponding to the first value to be sent to each tag in the target area;

[0016] D1. Determine the number of tags having the same value as the first value to be sent according to the response level of each tag in the target area;

[0017] E1. If the number of tags is the same as the preset tag number threshold, the first tag is identified according to the first value to be sent;

[0018] F1. If not, determine a new current conflicting bit according to the first value to be sent, and re-execute step A1.

[0019] In a possible implementation, determining the number of tags having the same value as the first to-be-sent value according to the response level of each tag in the target area includes:

[0020] Comparing the level values ​​of each bit in the response level of the first tag with the values ​​of the corresponding bits in the current value in sequence, wherein the first tag is any one of the tags;

[0021] If the level values ​​of each bit in the response level of the first tag are the same as the values ​​of the corresponding bits in the current value, the number of tags that are the same as the first value to be sent is increased by one.

[0022] In a possible implementation, determining, according to the values ​​of the first N bits in the first label, whether the values ​​of the first N bits of each target label other than the first label are the same as the values ​​of the first N bits in the first label includes:

[0023] Combining the values ​​of the first N bits in the first tag into a second value to be sent;

[0024] Sending a radio frequency signal corresponding to the second to-be-sent value to each target tag in the target area;

[0025] Comparing the level value of each bit in the response level of the target tag with the value of the corresponding bit in the second value to be sent in sequence;

[0026] If the level values ​​of each bit in the response level of the target tag are the same as the values ​​of the corresponding bits in the second value to be sent, it is determined that the values ​​of the first N bits of the target tag are the same as the values ​​of the first N bits in the first tag.

[0027] In a possible implementation, the sending of radio frequency signals to each target tag multiple times according to the value of the first N bits, and sequentially identifying the value of the last M bits of each target tag according to the response level of each target tag, includes:

[0028] According to the number of currently identified tags, determine the value at the starting identification position corresponding to the current target tag;

[0029] According to the value at the starting identification position corresponding to the current target tag and the value at the first N bits, the radio frequency signal is sent to each target tag multiple times, and according to the response level of each target tag, the current target tag is identified and the number of currently identified tags is updated.

[0030] In a possible implementation, sending radio frequency signals to each target tag multiple times according to the value at the starting identification position and the value at the first N bits corresponding to the current target tag, and identifying the current target tag according to the response level of each target tag, includes:

[0031] A2. Determine the current conflicting bit and the current value of the current conflicting bit;

[0032] B2, combining the current value of the current conflicting bit and the values ​​of all bits before the current conflicting bit into a third value to be sent;

[0033] C2, sending a radio frequency signal corresponding to the third value to be sent to each unidentified tag in the target area;

[0034] D2. Determine the number of unidentified tags that is the same as the third value to be sent according to the response level of each unidentified tag in the target area;

[0035] E2. If the number of unidentified tags is the same as the preset threshold value of the number of unidentified tags, the current target tag is identified according to the third value to be sent;

[0036] F2. If not, determine a new current conflicting bit according to the third value to be sent, and re-execute step A2.

[0037] In a possible implementation, determining the number of unidentified tags having the same value as the third value to be sent according to the response level of each unidentified tag in the target area includes:

[0038] The level values ​​of each bit in the response level of the second tag are compared with the values ​​of the corresponding bits in the current value in turn. If the level values ​​of each bit in the response level of the second tag are the same as the values ​​of the corresponding bits in the current value, the number of tags that are the same as the first value to be sent is increased by one, where the second tag is any unidentified tag.

[0039] In a second aspect, another embodiment of the present application provides a tag identification device, the device comprising:

[0040] A sending module, used for sending radio frequency signals to a target area multiple times;

[0041] A first identification module, used for identifying a first tag according to the response level of each tag in the target area;

[0042] A determination module, configured to determine, based on the values ​​of the first N bits in the first label, whether the values ​​of the first N bits of each target label other than the first label are the same as the values ​​of the first N bits in the first label;

[0043] The second identification module is used to send radio frequency signals to each target tag multiple times according to the value of the first N bits, and identify the value of the last M bits of each target tag in turn according to the response level of each target tag, wherein N and M are integers greater than 0 respectively.

[0044] In a possible implementation manner, the first identification module is specifically configured to:

[0045] A1. Determine the current conflicting bit and the current value of the current conflicting bit;

[0046] B1, combining the current value of the current conflicting bit and the values ​​of all bits before the current conflicting bit into the first value to be sent;

[0047] C1. Sending a radio frequency signal corresponding to the first value to be sent to each tag in the target area;

[0048] D1. Determine the number of tags having the same value as the first value to be sent according to the response level of each tag in the target area;

[0049] E1. If the number of tags is the same as the preset tag number threshold, the first tag is identified according to the first value to be sent;

[0050] F1. If not, determine a new current conflicting bit according to the first value to be sent, and re-execute step A1.

[0051] In a possible implementation manner, the first identification module is specifically configured to:

[0052] Comparing the level values ​​of each bit in the response level of the first tag with the values ​​of the corresponding bits in the current value in sequence, wherein the first tag is any one of the tags;

[0053] If the level values ​​of each bit in the response level of the first tag are the same as the values ​​of the corresponding bits in the current value, the number of tags that are the same as the first value to be sent is increased by one.

[0054] In a possible implementation, the determining module is specifically configured to:

[0055] Combining the values ​​of the first N bits in the first tag into a second value to be sent;

[0056] Sending a radio frequency signal corresponding to the second to-be-sent value to each target tag in the target area;

[0057] Comparing the level value of each bit in the response level of the target tag with the value of the corresponding bit in the second value to be sent in sequence;

[0058] If the level values ​​of each bit in the response level of the target tag are the same as the values ​​of the corresponding bits in the second value to be sent, it is determined that the values ​​of the first N bits of the target tag are the same as the values ​​of the first N bits in the first tag.

[0059] In a possible implementation manner, the second identification module is specifically configured to:

[0060] According to the number of currently identified tags, determine the value at the starting identification position corresponding to the current target tag;

[0061] According to the value at the starting identification position corresponding to the current target tag and the value at the first N bits, the radio frequency signal is sent to each target tag multiple times, and according to the response level of each target tag, the current target tag is identified and the number of currently identified tags is updated.

[0062] In a possible implementation manner, the second identification module is specifically configured to:

[0063] A2. Determine the current conflicting bit and the current value of the current conflicting bit;

[0064] B2, combining the current value of the current conflicting bit and the values ​​of all bits before the current conflicting bit into a third value to be sent;

[0065] C2, sending a radio frequency signal corresponding to the third value to be sent to each unidentified tag in the target area;

[0066] D2. Determine the number of unidentified tags that is the same as the third value to be sent according to the response level of each unidentified tag in the target area;

[0067] E2. If the number of unidentified tags is the same as the preset threshold value of the number of unidentified tags, the current target tag is identified according to the third value to be sent;

[0068] F2. If not, determine a new current conflicting bit according to the third value to be sent, and re-execute step A2.

[0069] In a possible implementation manner, the second identification module is specifically configured to:

[0070] The level values ​​of each bit in the response level of the second tag are compared with the values ​​of the corresponding bits in the current value in turn. If the level values ​​of each bit in the response level of the second tag are the same as the values ​​of the corresponding bits in the current value, the number of tags that are the same as the first value to be sent is increased by one, where the second tag is any unidentified tag.

[0071] In the third aspect, another embodiment of the present application provides an electronic device, comprising: a processor, a storage medium and a bus, wherein the storage medium stores machine-readable instructions executable by the processor, and when the electronic device is running, the processor communicates with the storage medium through the bus, and the processor executes the machine-readable instructions to perform the steps of any method described in the first aspect above.

[0072] In a fourth aspect, another embodiment of the present application provides a storage medium having a computer program stored thereon, and when the computer program is executed by a processor, the steps of any method described in the first aspect are executed.

[0073] The beneficial effects of the present application are as follows: by sending radio frequency signals to a target area multiple times, and identifying a first tag according to the response levels of each tag in the target area, and determining whether the values ​​of the first N bits of each target tag other than the first tag are the same as the values ​​of the first N bits of the first tag according to the values ​​of the first N bits in the first tag, so that when they are the same, radio frequency signals can be sent to each target tag multiple times according to the values ​​of the first N bits, and the values ​​of the last M bits in each target tag can be identified in turn according to the response levels of each target tag, thereby realizing rapid identification of tags and improving tag identification efficiency. At the same time, since each tag is identified according to the response level of each tag, the phenomenon of missed identification can also be avoided. BRIEF DESCRIPTION OF THE DRAWINGS

[0074] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings required for use in the embodiments will be briefly introduced below. It should be understood that the following drawings only show certain embodiments of the present application and therefore should not be regarded as limiting the scope. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without paying creative work.

[0075] Figure 1 A schematic diagram of a scenario in which the tag recognition method provided in an embodiment of the present application is applied;

[0076] Figure 2 A flowchart of a tag identification method provided in an embodiment of the present application;

[0077] Figure 3A schematic diagram of a process for identifying the first tag in the tag identification method provided in an embodiment of the present application;

[0078] Figure 4 A schematic diagram of a flow chart for determining the number of tags with the same first to-be-sent value in the tag identification method provided in an embodiment of the present application;

[0079] Figure 5 Another schematic diagram of a flow chart of a tag identification method provided in an embodiment of the present application;

[0080] Figure 6 A schematic diagram of a flow chart for first identifying the value of the last M bits in each target tag in the tag identification method provided in an embodiment of the present application;

[0081] Figure 7 A schematic diagram of a process for identifying a current target tag in the tag identification method provided in an embodiment of the present application;

[0082] Figure 8 A schematic diagram of a tag identification device provided in an embodiment of the present application;

[0083] Fig. 9 A schematic diagram of the structure of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0084] To make the purpose, technical scheme and advantages of the embodiments of the present application clearer, the technical scheme in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. It should be understood that the drawings in the present application only serve the purpose of explanation and description and are not used to limit the scope of protection of the present application. In addition, it should be understood that the schematic drawings are not drawn in real proportion. The flowchart used in this application shows the operations implemented according to some embodiments of the present application. It should be understood that the operations of the flowchart can be implemented out of sequence, and the steps without logical context can be reversed in order or implemented simultaneously. In addition, those skilled in the art can add one or more other operations to the flowchart under the guidance of the content of the present application, or remove one or more operations from the flowchart.

[0085] In addition, the described embodiments are only a part of the embodiments of the present application, rather than all the embodiments. The components of the embodiments of the present application described and shown in the drawings here can be arranged and designed in various configurations. Therefore, the following detailed description of the embodiments of the present application provided in the drawings is not intended to limit the scope of the application claimed for protection, but merely represents the selected embodiments of the present application. Based on the embodiments of the present application, all other embodiments obtained by those skilled in the art without making creative work belong to the scope of protection of the present application.

[0086] It should be noted that the term "comprising" will be used in the embodiments of the present application to indicate the existence of the features declared thereafter, but does not exclude the addition of other features.

[0087] In the prior art, label identification is usually performed according to the ISO14443A standard process. Specifically, during a fast-moving multi-label inventory, multiple segments of labels that need to be identified are identified one by one.

[0088] However, this tag recognition method will perform a large number of repeated tag recognition actions, which is inefficient for the limited inventory time and may cause missed recognition.

[0089] Based on the above problems, an embodiment of the present application proposes a tag identification method, which sends radio frequency signals to a target area multiple times, identifies a first tag according to the response levels of each tag in the target area, and determines whether the values ​​of the first N bits of each target tag other than the first tag are the same as the values ​​of the first N bits of the first tag according to the values ​​of the first N bits in the first tag. In this way, when the values ​​are the same, radio frequency signals are sent to each target tag multiple times according to the values ​​of the first N bits, and the values ​​of the last M bits of each target tag are identified in turn according to the response levels of each target tag, thereby realizing rapid identification of the tag, improving the tag identification efficiency, and avoiding the phenomenon of missed identification.

[0090] First, the application scenarios of the tag recognition method provided in the embodiments of the present application are described.

[0091] Figure 1 A schematic diagram of a scenario in which the tag recognition method provided in the embodiment of the present application is applied, referring to Figure 1 As shown, in the assembly line, multiple boxes to be transported are placed on the assembly line, multiple goods can be placed in the boxes, and the goods carry their own labels. A reader is also provided on the assembly line to perform label identification on the multiple goods in the box when the box moves to the detection area of ​​the reader.

[0092] It can be understood that when the box moves into the detection area of ​​the reader, the reader executes the tag recognition method provided in the embodiment of the present application to quickly and accurately recognize the tags of multiple commodities in the box.

[0093] The tag identification method provided in the embodiments of the present application is described in detail below in combination with multiple embodiments.

[0094] Figure 2 A flowchart of a tag identification method provided in an embodiment of the present application, referring to Figure 2 As shown, the execution subject of the method can be any electronic device with processing capability, such as the above-mentioned reader, and the method includes:

[0095] S201. Send radio frequency signals to a target area multiple times.

[0096] Optionally, the reader can continuously send radio frequency signals to the target area to determine whether to start tag identification. Specifically, each tag is provided with an area that responds to the radio frequency signal at high and low levels. When there is a high and low level response in the target area, it can be determined that there is a tag in the target area and tag identification can be started. The target area can be the detection area of ​​the reader.

[0097] S202: Identify the first tag according to the response level of each tag in the target area.

[0098] It can be understood that when there are tags in the target area, the reader can receive the response level of each tag in the target area. After obtaining the response level of each tag in the target area, the reader can continue to send radio frequency signals to the target area to identify the first tag.

[0099] Optionally, the reader can identify the first tag among the tags according to the response level of each tag in the target area, wherein the first tag can be understood as the first tag that responds to the RF signal of the reader when the box moves in the assembly line and moves into the detection area of ​​the reader.

[0100] For example, the reader sends a radio frequency signal to the target area. When a box moves through the assembly line to the detection area of ​​the reader, at least one tag in the box receives the radio frequency signal and responds to the radio frequency signal. For example, the response form can be: a plurality of electrical protrusions are set on the tag to respond to the radio frequency signal with high and low levels.

[0101] The response level may include a high level and a low level, wherein the high level may be understood as the identification point on the tag responding to the radio frequency signal, and the low level may be understood as the identification point on the tag not responding to the radio frequency signal. For example, the high level may correspond to the value of 1 on the bit in the tag, and the low level may correspond to the value of 0 on the bit in the tag.

[0102] That is to say, the reader can continue to send a radio frequency signal different from the previous radio frequency signal to the location of the first tag in the target area according to the response level of each tag in the target area, so as to identify the value of each bit of the first tag according to the response level of the first tag and complete the identification of the first tag.

[0103] S203: Determine, based on the values ​​of the first N bits in the first tag, whether the values ​​of the first N bits of each target tag except the first tag are the same as the values ​​of the first N bits in the first tag.

[0104] It can be understood that for multiple products in the same box, there may be a situation where the values ​​of the first N digits of multiple labels are the same. Therefore, after identifying the values ​​of each digit of the first label, it is possible to first determine whether the values ​​of the first N digits of other labels are the same as the values ​​of the first N digits of the first label, thereby avoiding repeated identification of the first N digits of other labels and improving label identification efficiency.

[0105] Optionally, the reader may continue to send radio frequency signals corresponding to the values ​​of the first N bits in the first tag to the locations of other tags in the target area based on the values ​​of the first N bits in the first tag, so as to determine whether the values ​​of the first N bits of each target tag other than the first tag are the same as the values ​​of the first N bits in the first tag based on the response levels of the other tags.

[0106] S204: If yes, then send radio frequency signals to each target tag multiple times according to the value of the first N bits, and identify the value of the last M bits in each target tag in turn according to the response level of each target tag.

[0107] Optionally, if they are the same, based on the values ​​on the first N bits, radio frequency signals can be sent to each target tag multiple times, and the values ​​on the last M bits in each target tag can be identified in turn according to the response level of each target tag, where N and M are integers greater than 0 respectively.

[0108] Optionally, if they are not the same, the reader can send a radio frequency signal to each target tag, and identify the values ​​of the first N bits and the last M bits of each target tag in turn according to the response level of each target tag, thereby realizing the identification of each target tag.

[0109] In this embodiment, by sending radio frequency signals to the target area multiple times, and identifying the first tag according to the response level of each tag in the target area, and determining whether the values ​​of the first N bits of each target tag other than the first tag are the same as the values ​​of the first N bits of the first tag according to the values ​​of the first N bits in the first tag, so that when they are the same, radio frequency signals can be sent to each target tag multiple times according to the values ​​of the first N bits, and the values ​​of the last M bits in each target tag can be identified in turn according to the response level of each target tag, thereby realizing rapid identification of the tags and improving the tag identification efficiency. At the same time, since each tag is identified according to the response level of each tag, the phenomenon of missed identification can also be avoided.

[0110] Figure 3 A schematic diagram of a flow chart for identifying the first tag in the tag identification method provided in an embodiment of the present application.

[0111] In one possible implementation, referring to Figure 3 As shown, in the above S202, when the first tag is identified according to the response level of each tag in the target area, the following steps may be performed, including:

[0112] S301. Determine a current conflicting bit and a current value of the current conflicting bit.

[0113] It can be understood that each tag has multiple bits, each bit has a value, and identifying a tag is to identify the value of each bit on the tag, that is, when the bit is at a high level, it can be identified that the value of the bit is 1, and when the bit is at a low level, it can be identified that the value of the bit is 0. So when identifying, each tag can be identified bit by bit.

[0114] Optionally, the current conflict bit when identifying each tag can be determined based on the response level of each tag in the target area, and the current value of the current bit can be determined based on the current conflict bit. The current conflict bit is related to the number of loop executions and the position of the previous current conflict bit, and the current value of the current conflict bit is related to the number of loop executions or the value of the previous current conflict bit, and can also be a preset value.

[0115] For example, assuming that there are a first tag 0001, a second tag 1000 and a third tag 0100 in the target area, and taking the first execution of this loop as an example, assuming that the radio frequency signal sent by the reader to the target area is 0000, it can be determined that the current conflict bit is the first bit according to the response levels of the first tag, the second tag and the third tag, and the current value of the current conflict bit is 0. This means that when the loop is executed for the first time, when the response levels of multiple tags conflict, the current value of the current conflict bit can be set to 0, that is, the tag whose current conflict bit value is 1 is not considered for the time being.

[0116] For example, assuming that there are a first tag 0001, a second tag 1000 and a third tag 0100 in the target area, and taking the second execution of this loop as an example, assuming that the radio frequency signal sent by the reader to the target area is 0000, since the first bit has been used as the current conflict bit, the current conflict bit can be determined to be the second bit according to the response levels of the first tag and the third tag, and the current value of the current conflict bit is 0. This means that when the loop is executed for the second time, when the response levels of multiple tags conflict, the current conflict bit can be determined based on the previous conflict bit, and the current value of the current conflict bit can be set to 0, that is, the tag whose current conflict bit value is 1 is not considered for the time being.

[0117] Exemplarily, assuming that there are a first tag 0001, a second tag 1000 and a third tag 0100 in the target area, taking the third execution of this loop as an example, assuming that the radio frequency signal sent by the reader to the target area is 0000, it can be determined based on the response levels of the first tag and the third tag that the current conflict bit is the fourth bit, and the current value of the current conflict bit is 0.

[0118] S302: Combine the current value of the current conflicting bit and the values ​​of all bits before the current conflicting bit into a first value to be sent.

[0119] Optionally, the current value of the current conflicting bit is combined with the values ​​of all bits before the current conflicting bit to obtain the first value to be sent. Alternatively, the values ​​of all bits after the current conflicting bit can be set to preset values, and the current value of the current conflicting bit, the values ​​of all bits before the current conflicting bit, and the values ​​of all bits after the current conflicting bit are combined to obtain the first value to be sent. For example, the preset values ​​can all be 0, or all be 1.

[0120] Exemplarily, taking the example that each tag has 4 bits, if the current conflicting bit is the first bit in the tag, then the first value to be sent may be only the value of the first bit, the value of the first bit may be 0, or the value generated by the combination of the first to fourth bits, for example: the first bit may be 0, and the second to fourth bits may also be 0. If the current conflicting bit is the second bit in the tag, then the first value to be sent may be the value of the first bit plus the value of the second bit, wherein the value of the second bit may be 0, or the value generated by the combination of the first to fourth bits, for example: the first value to be sent may be the value of the first bit plus the value of the second bit, 0, and the third to fourth bits may also be 0, and so on.

[0121] S303: Send a radio frequency signal corresponding to the first to-be-sent value to each tag in the target area.

[0122] Optionally, the reader may send a radio frequency signal corresponding to the first value to be sent to each tag in the target area.

[0123] Exemplarily, if there is only one tag in the target area, a radio frequency signal corresponding to the first value to be sent may be sent to the tag; if there are multiple tags in the target area, a radio frequency signal corresponding to the first value to be sent may be sent to each tag.

[0124] S304: Determine the number of tags that is the same as the first value to be sent according to the response level of each tag in the target area.

[0125] Optionally, the reader can receive the response level of each tag in the target area, compare the response level of each tag, and determine the number of tags that are the same as the first value to be sent, that is, the number of tags whose current conflict bit value is the same as the first value to be sent.

[0126] Exemplarily, continuing to take the example that each tag has 4 bits, assuming that the current conflicting bit is the second bit in the tag, and the first value to be sent is 0000, after sending the radio frequency signal corresponding to 0000 to each tag in the target area, the number of tags with the same value as the first value to be sent can be obtained according to the response level of each tag in the target area. For example: there are tags 0000 and 0001 in the target area, then the response level can indicate that the number of tags with the same value as the first value to be sent in the target area is 1.

[0127] For example, if there are tags 0010 and 0001 in the target area, the response level may indicate that the number of tags in the target area that is the same as the first value to be sent is 0.

[0128] S305: If the number of tags is the same as a preset tag number threshold, the first tag is identified according to the first value to be sent.

[0129] Optionally, if the number of tags is the same as a preset tag number threshold, it can be determined that the first value to be sent is the value of each bit of the first tag, and the first tag can be identified based on the first value to be sent.

[0130] Among them, the preset label quantity threshold is 1.

[0131] Exemplarily, continuing to take the example that each tag has 4 bits, assuming that the current conflicting bit is the second bit in the tag, and the first value to be sent is 0000, after sending the radio frequency signal corresponding to 0000 to each tag in the target area, the number of tags that are the same as the first value to be sent can be obtained according to the response level of each tag in the target area. For example: there are tags 0000 and 0001 in the target area, then the response level can indicate that the number of tags in the target area that are the same as the first value to be sent is 1, and it can be determined that the tag value of the first tag is 0000.

[0132] S306: If not, determine a new current conflicting bit according to the first value to be sent, and re-execute step S301.

[0133] Optionally, if the number of tags is different from a preset tag number threshold, a new current conflict bit can be determined based on the first value to be sent. Specifically, the next conflict bit based on the current conflict bit can be determined based on the response level of each tag corresponding to the first value to be sent, and the next conflict bit can be used as the new current bit, and S301 can be re-executed.

[0134] Exemplarily, continuing to take the example that each tag has 4 bits, assuming that the current conflicting bit is the second bit in the tag, and the first value to be sent is 0000, after sending the radio frequency signal corresponding to 0000 to each tag in the target area, the number of tags with the same value as the first value to be sent can be obtained according to the response level of each tag in the target area. For example, there are tags 0010 and 0001 in the target area, and the response level indicates that the number of tags with the same value as the first value to be sent in the target area is 0, then according to the first value to be sent 0000, it can be determined that the new current conflicting bit is the third bit, and step S301 is re-executed.

[0135] That is to say, when the first tag is identified, since it is not certain at the beginning which tag in the target area is the first tag, it can be understood that an initial level signal is first sent to the target area, and based on the response levels of each tag in the target area, it is judged whether there is a conflict in each bit of each tag. When a conflict occurs, the first value to be sent can be generated according to the current conflicting bit and the preset value, and the radio frequency signal corresponding to the first value to be sent is sent to the target area, so that the first tag can be quickly identified according to the response level, which can ensure that the tag recognition result is accurate and efficient.

[0136] Figure 4 A flowchart of determining the number of tags with the same first to-be-sent value in the tag identification method provided in an embodiment of the present application.

[0137] In one possible implementation, referring to Figure 4 As shown, the above S304 determines the number of tags that is the same as the first to-be-sent value according to the response level of each tag in the target area, including:

[0138] S401 . Compare the level value of each bit in the response level of the first tag with the value of the corresponding bit in the current value in sequence.

[0139] Optionally, each tag is compared with the first value to be sent, specifically, the level value of each bit in the response level of the first tag is compared with the value of the corresponding bit in the current value in sequence. The first tag is any tag among the tags.

[0140] S402: If the level values ​​of each bit in the response level of the first tag are the same as the values ​​of the corresponding bits in the current value, the number of tags that are the same as the first value to be sent is increased by one.

[0141] Optionally, if the level values ​​of each bit in the response level of the first tag are the same as the values ​​of the corresponding bits in the current value, the number of tags having the same value as the first value to be sent is increased by one.

[0142] Optionally, if the level value of at least one bit in the response level of the first tag is different from the value of the corresponding bit in the current value, the number of tags with the same first value to be sent is not increased by one.

[0143] Figure 5 Another flowchart of the tag identification method provided in the embodiment of the present application.

[0144] In one possible implementation, referring to Figure 5 As shown, the above S203 determines whether the values ​​of the first N bits of each target tag except the first tag are the same as the values ​​of the first N bits of the first tag according to the values ​​of the first N bits of the first tag, including:

[0145] S501. Combine the values ​​of the first N bits in the first tag into a second value to be sent.

[0146] Optionally, the values ​​of the first N bits in the first tag are read and combined into the second value to be sent, wherein the value of N can be obtained according to a preset tag characteristic.

[0147] S502: Send a radio frequency signal corresponding to a second to-be-sent value to each target tag in the target area.

[0148] Optionally, a radio frequency signal corresponding to the second to-be-sent value is sent to each tag in the target area except the first tag, and a response level of each tag is received.

[0149] S503 : Compare the level value of each bit in the response level of the target tag with the value of the corresponding bit in the second value to be sent in sequence.

[0150] Optionally, the response level of each target tag is compared with the second value to be sent in data bit order, that is, the level value of each bit in each target tag is compared with the value of the corresponding bit in the second value to be sent in sequence.

[0151] S504: If the level values ​​of each bit in the response level of the target tag are the same as the values ​​of the corresponding bits in the second value to be sent, it is determined that the values ​​of the first N bits of the target tag are the same as the values ​​of the first N bits in the first tag.

[0152] Optionally, if the level values ​​of each bit in the response level of the target tag are the same as the values ​​of the corresponding bits of the second value to be sent, it can be said that the values ​​of the first N bits of the target tag are the same as the values ​​of the first N bits in the first tag, and the values ​​of the first N bits in the first tag can be used as the values ​​of the first N bits in the target tag, that is, only the values ​​of the last M bits of the target tag need to be identified.

[0153] By combining the values ​​of the first N bits in the first tag into the second value to be sent, and sending the radio frequency signal corresponding to the second value to be sent to each target tag in the target area, so that the level value of each bit in the response level of the target tag is the same as the value of the corresponding bit in the second value to be sent, it is determined that the value of the first N bits of the target tag is the same as the value of the first N bits in the first tag, and whether the values ​​of the first N bits of each tag are the same can be accurately identified, thereby reducing repeated identification and improving identification efficiency.

[0154] Figure 6 A schematic diagram of a flow chart for first identifying the value of the last M bits in each target tag in the tag identification method provided in an embodiment of the present application.

[0155] In one possible implementation, referring to Figure 6 As shown, the above S204 sends radio frequency signals to each target tag multiple times according to the value of the first N bits, and identifies the value of the last M bits in each target tag in turn according to the response level of each target tag, including:

[0156] S601. Determine the value at the starting recognition position corresponding to the current target tag according to the number of currently recognized tags.

[0157] It can be understood that when identifying the values ​​on the last M bits of each target tag, the values ​​on the last M bits of each target tag can be identified separately. After the value on the last M bits of the previous target tag is identified, that is, the previous target tag is identified, the next target tag can be identified.

[0158] That is to say, the process of identifying the value on the last M bits of each target tag can be understood as the reader can first identify the target tag with certain numerical characteristics, and then identify the next target tag based on the identification of the previous target tag.

[0159] Optionally, according to the number of currently identified tags, it can be determined that when identifying the value of the last M bits of the current target tag, the value at the starting identification position is changed, so that each target tag can be identified evenly, so that no tag is missed.

[0160] Exemplarily, taking the first target tag as an example, when identifying the value of the last M bits of the first target tag, the number of identified tags is 1, the value of the starting identification position of the first target tag, that is, the N+1 position, can be assigned to 1, and the identification of the last M-1 bits can begin.

[0161] For example, taking the second target tag as an example, when identifying the value of the last M bits of the second target tag, the number of identified tags is 2. The starting identification position of the second target tag, that is, the value at the N+1 position, can be assigned to 0, and the identification of the last M-1 bits can begin.

[0162] For example, taking the third target tag as an example, when identifying the value of the last M bits of the third target tag, the number of identified tags is 3. The starting identification position of the third target tag, that is, the value at the N+1 position, can be assigned a value of 1, and the identification of the last M-1 bits can begin.

[0163] Exemplarily, taking the fourth target tag as an example, when identifying the value of the last M bits of the fourth target tag, the number of identified tags is 4. The starting identification position of the fourth target tag, that is, the value at the N+1 position, can be assigned to 0, and the identification of the last M-1 bits can begin.

[0164] S602: according to the value at the starting identification position and the value at the first N bits corresponding to the current target tag, a radio frequency signal is sent to each target tag multiple times, and according to the response level of each target tag, the current target tag is identified and the number of currently identified tags is updated.

[0165] Optionally, after obtaining the value at the starting identification position and the value at the first N bits corresponding to the current target tag, the corresponding radio frequency signal can continue to be sent to each target tag in the target area according to the value at the starting identification position and the value at the first N bits corresponding to the current target tag, and the current target tag can be identified based on the response level of each target tag, and the number of currently identified tags can be updated.

[0166] The value at the starting identification position corresponding to the current target tag is determined by the number of currently identified tags, and according to the value at the starting identification position corresponding to the current target tag and the value of the first N bits, radio frequency signals are sent to each target tag multiple times, and according to the response level of each target tag, the current target tag is identified and the number of currently identified tags is updated, so that each target tag can be identified evenly, so that no tag is missed.

[0167] Figure 7 A schematic diagram of a flow chart for identifying a current target tag in the tag identification method provided in an embodiment of the present application.

[0168] In one possible implementation, referring to Figure 7 As shown, in the above S602, according to the value at the starting identification position corresponding to the current target tag and the value at the first N bits, the radio frequency signal is sent to each target tag multiple times, and the current target tag is identified according to the response level of each target tag, including:

[0169] S701. Determine a current conflicting bit and a current value of the current conflicting bit.

[0170] Optionally, the current conflicting bit when identifying the current target tag may be determined first, and the current value of the current conflicting bit may be determined based on the current conflicting bit.

[0171] The current conflict bit is related to the number of loop executions and the position of the previous current conflict bit, and the current value of the current conflict bit is related to the number of loop executions or the value of the previous current conflict bit, and may also be a preset value.

[0172] Exemplarily, the current conflict bit can be the starting identification position, that is, the N+1 position, or the first position where the conflict occurs after the starting identification position, such as the N+Xth position, where the value of X can be determined according to the response level of each tag in the target area. When the current conflict bit is the starting identification position, the value of the current conflict bit is the value of the starting identification position, and when the current conflict bit is not the starting identification position, the value of the current conflict bit can be 0.

[0173] S702: Combine the current value of the current conflicting bit and the values ​​of all bits before the current conflicting bit into a third value to be sent.

[0174] Optionally, the current value of the current conflicting bit is combined with the values ​​of all bits before the current conflicting bit to obtain a third value to be sent. When this loop is executed for the first time, the values ​​of all bits before the current conflicting bit are the values ​​of the first N bits.

[0175] Optionally, the values ​​of all bits after the current conflicting bit can be set to preset values, and the current value of the current conflicting bit, the values ​​of all bits before the current conflicting bit, and the values ​​of all bits after the current conflicting bit are combined to obtain a third value to be sent. For example, the preset values ​​can all be 0, or all be 1.

[0176] S703: Send a radio frequency signal corresponding to the third to-be-sent value to each unidentified tag in the target area.

[0177] Optionally, the reader may send a radio frequency signal corresponding to the first to-be-sent value to each unidentified tag in the target area.

[0178] Among them, each unidentified tag is a tag that has not been fully identified among each target tag.

[0179] Exemplarily, if there is only one unidentified tag in the target area, a radio frequency signal corresponding to the third value to be sent can be sent to the unidentified tag; if there are multiple unidentified tags in the target area, a radio frequency signal corresponding to the third value to be sent can be sent to each unidentified tag.

[0180] S704: Determine the number of unidentified tags that is the same as the third value to be sent according to the response level of each unidentified tag in the target area.

[0181] Optionally, the reader can receive the response level of each unidentified tag in the target area, compare the response level of each unidentified tag, and determine the number of unidentified tags that are the same as the third value to be sent, that is, the number of tags whose current conflict bit value is the same as the third value to be sent.

[0182] The response level of each unidentified tag is used to indicate whether the third value to be sent is the same as the value of the current conflicting bit of the current unidentified tag.

[0183] S705: If the number of unidentified tags is the same as a preset threshold value of the number of unidentified tags, identify and obtain the current target tag according to the third value to be sent.

[0184] Optionally, if the number of unidentified tags is the same as a preset unidentified tag number threshold, it can be determined that the third value to be sent is the value of each bit of the unidentified tag, and the current target tag can be identified based on the third value to be sent.

[0185] Among them, the preset threshold value of the number of unidentified tags is 1.

[0186] S706: If not, determine a new current conflicting bit according to the third value to be sent, and re-execute step S701.

[0187] Optionally, if the number of unidentified tags is different from a preset threshold value for the number of unidentified tags, a new current conflict bit can be determined based on the third value to be sent. Specifically, the next conflict bit based on the current conflict bit can be determined based on the response level of each tag corresponding to the third value to be sent, and the next conflict bit can be used as the new current conflict bit, and S701 can be re-executed.

[0188] It can be understood that the process of identifying the current target tag can refer to the process of identifying the first tag mentioned above. That is, each time the current target tag is identified, it is not certain which tag in the target area is the current target tag. Therefore, an initial level signal corresponding to the first N+1 bits can be sent to the target area first, and according to the response level of each tag in the target area, it is judged whether there is a conflict on each bit in each tag, and when a conflict occurs, a third value to be sent can be generated according to the current conflict bit and the preset value, the initial level signal can be adjusted, and the radio frequency signal corresponding to the third value to be sent can be sent to the target area, so that the current target tag can be quickly identified by adjusting the level signal and according to the response level, which can ensure that the identification result of the tag is accurate and efficient.

[0189] In a possible implementation, the above S704 determines the number of unidentified tags having the same value as the third value to be sent according to the response level of each unidentified tag in the target area, including:

[0190] Compare the level values ​​of each bit in the response level of the second tag with the values ​​of the corresponding bits in the current value in turn. If the level values ​​of each bit in the response level of the second tag are the same as the values ​​of the corresponding bits in the current value, increase the number of tags with the same value as the first value to be sent by one.

[0191] The second tag is any unidentified tag.

[0192] Optionally, each second tag is compared with the third value to be sent respectively. Specifically, the level value of each bit in the response level of the second tag is compared with the value of the corresponding bit in the current value in sequence.

[0193] Optionally, if the level values ​​of each bit in the response level of the second tag are the same as the values ​​of the corresponding bits in the current value, the number of tags having the same value as the third value to be sent is increased by one.

[0194] Optionally, if the level value of at least one bit in the response level of the second tag is different from the value of the corresponding bit in the current value, the number of tags with the same third value to be sent is not increased by one.

[0195] Based on the same inventive concept, a label identification device corresponding to the label identification method is also provided in the embodiment of the present application. Since the principle of solving the problem by the device in the embodiment of the present application is similar to the above-mentioned label identification method in the embodiment of the present application, the implementation of the device can refer to the implementation of the method, and the repeated parts will not be repeated.

[0196] Figure 8 A schematic diagram of a tag identification device provided in an embodiment of the present application, referring to Figure 8 As shown, the device includes: a sending module 801, a first identification module 802, a determination module 803 and a second identification module 804; wherein,

[0197] The sending module 801 is used to send radio frequency signals to the target area multiple times;

[0198] A first identification module 802, used to identify a first tag according to the response level of each tag in the target area;

[0199] A determination module 803 is used to determine whether the values ​​of the first N bits of each target tag other than the first tag are the same as the values ​​of the first N bits of the first tag according to the values ​​of the first N bits of the first tag;

[0200] The second identification module 804 is used to send radio frequency signals to each target tag multiple times according to the value of the first N bits, and identify the value of the last M bits in each target tag in turn according to the response level of each target tag, where N and M are integers greater than 0 respectively.

[0201] In a possible implementation, the first identification module 802 is specifically configured to:

[0202] A1. Determine the current conflicting bit and the current value of the current conflicting bit;

[0203] B1, combining the current value of the current conflicting bit and the values ​​of all bits before the current conflicting bit into the first value to be sent;

[0204] C1. Sending a radio frequency signal corresponding to a first value to be sent to each tag in the target area;

[0205] D1. Determine the number of tags that have the same value as the first value to be sent according to the response level of each tag in the target area;

[0206] E1. If the number of tags is the same as the preset tag number threshold, the first tag is identified according to the first value to be sent;

[0207] F1. If not, determine a new current conflicting bit according to the first value to be sent, and re-execute step A1.

[0208] In a possible implementation, the first identification module 802 is specifically configured to:

[0209] Compare the level values ​​of each bit in the response level of the first tag with the values ​​of the corresponding bits in the current value in sequence, wherein the first tag is any tag among the tags;

[0210] If the level values ​​of each bit in the response level of the first tag are the same as the values ​​of the corresponding bits in the current value, the number of tags that are the same as the first value to be sent is increased by one.

[0211] In a possible implementation, the determination module 803 is specifically configured to:

[0212] Combine the values ​​of the first N bits in the first tag into the second value to be sent;

[0213] Sending a radio frequency signal corresponding to the second to-be-sent value to each target tag in the target area;

[0214] Comparing the level value of each bit in the response level of the target tag with the value of the corresponding bit in the second value to be sent in sequence;

[0215] If the level values ​​of each bit in the response level of the target tag are the same as the values ​​of the corresponding bits in the second value to be sent, it is determined that the values ​​of the first N bits of the target tag are the same as the values ​​of the first N bits in the first tag.

[0216] In a possible implementation, the second identification module 804 is specifically configured to:

[0217] According to the number of currently identified tags, determine the value at the starting identification position corresponding to the current target tag;

[0218] According to the value at the starting identification position corresponding to the current target tag and the value at the first N bits, the radio frequency signal is sent to each target tag multiple times, and according to the response level of each target tag, the current target tag is identified and the number of currently identified tags is updated.

[0219] In a possible implementation, the second identification module 804 is specifically configured to:

[0220] A2. Determine the current conflicting bit and the current value of the current conflicting bit;

[0221] B2, combining the current value of the current conflicting bit and the values ​​of all bits before the current conflicting bit into a third value to be sent;

[0222] C2, sending a radio frequency signal corresponding to the third value to be sent to each unidentified tag in the target area;

[0223] D2. Determine the number of unidentified tags that is the same as the third value to be sent according to the response level of each unidentified tag in the target area;

[0224] E2. If the number of unidentified tags is the same as the preset threshold value of the number of unidentified tags, the current target tag is identified according to the third value to be sent;

[0225] F2. If not, determine a new current conflicting bit according to the third value to be sent, and re-execute step A2.

[0226] In a possible implementation, the second identification module 804 is specifically configured to:

[0227] The level values ​​of each bit in the response level of the second tag are compared with the values ​​of the corresponding bits in the current value in turn. If the level values ​​of each bit in the response level of the second tag are the same as the values ​​of the corresponding bits in the current value, the number of tags with the same value as the first to-be-sent value is increased by 1. The second tag is any unidentified tag.

[0228] For descriptions of the processing flow of each module in the device and the interaction flow between each module, reference may be made to the relevant descriptions in the above method embodiment, which will not be described in detail here.

[0229] The present application also provides an electronic device, such as Fig. 9 As shown, Fig. 9 The structural diagram of the electronic device provided in the embodiment of the present application includes: a processor 901, a memory 902, and optionally, a bus 903. The memory 902 stores machine-readable instructions executable by the processor 901 (for example, Figure 8 In the device, the sending module 801, the first identification module 802, the determination module 803 and the execution instructions corresponding to the second identification module 804 are included. When the electronic device 900 is running, the processor 901 communicates with the memory 902 through the bus 903, and the steps of the above-mentioned tag identification method are executed by the processor 901.

[0230] An embodiment of the present application further provides a computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, the steps of the above-mentioned tag identification method are executed.

[0231] Those skilled in the art can clearly understand that, for the convenience and simplicity of description, the specific working process of the system and device described above can refer to the corresponding process in the method embodiment, and will not be repeated in this application. In the several embodiments provided in this application, it should be understood that the disclosed system, device and method can be implemented in other ways. The device embodiments described above are merely schematic. For example, the division of the modules is only a logical function division. There may be other division methods in actual implementation. For example, multiple modules or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some communication interfaces, indirect coupling or communication connection of devices or modules, which can be electrical, mechanical or other forms.

[0232] In addition, each functional unit in each embodiment of the present application can be integrated into a processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. If the function is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention is essentially or part of the technical solution that contributes to the prior art or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including several instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, RandomAccess Memory), disk or optical disk and other media that can store program code.

[0233] The above are only specific implementation methods 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 covered by the protection scope of the present application.

Claims

1. A tag recognition method, characterized in that: include: Sending radio frequency signals to the target area multiple times; identifying a first tag according to a response level of each tag in the target area; Determine, based on the values ​​of the first N bits in the first label, whether the values ​​of the first N bits of each target label other than the first label are the same as the values ​​of the first N bits in the first label; If so, a radio frequency signal is sent to each target tag multiple times according to the value of the first N bits, and the value of the last M bits in each target tag is identified in turn according to the response level of each target tag, wherein N and M are integers greater than 0 respectively.

2. The tag recognition method according to claim 1, characterized in that: The step of identifying the first tag according to the response level of each tag in the target area includes: A1. Determine the current conflicting bit and the current value of the current conflicting bit; B1, combining the current value of the current conflicting bit and the values ​​of all bits before the current conflicting bit into the first value to be sent; C1. Sending a radio frequency signal corresponding to the first value to be sent to each tag in the target area; D1. Determine the number of tags having the same value as the first value to be sent according to the response level of each tag in the target area; E1. If the number of tags is the same as the preset tag number threshold, the first tag is identified according to the first value to be sent; F1. If not, determine a new current conflicting bit according to the first value to be sent, and re-execute step A1.

3. The tag recognition method according to claim 2, characterized in that: The step of determining the number of tags having the same value as the first to-be-sent value according to the response level of each tag in the target area includes: Comparing the level values ​​of each bit in the response level of the first tag with the values ​​of the corresponding bits in the current value in sequence, wherein the first tag is any one of the tags; If the level values ​​of each bit in the response level of the first tag are the same as the values ​​of the corresponding bits in the current value, the number of tags that are the same as the first value to be sent is increased by one.

4. The tag recognition method according to claim 1, characterized in that: The determining, based on the values ​​of the first N bits in the first label, whether the values ​​of the first N bits of each target label other than the first label are the same as the values ​​of the first N bits in the first label includes: Combining the values ​​of the first N bits in the first tag into a second value to be sent; Sending a radio frequency signal corresponding to the second to-be-sent value to each target tag in the target area; Comparing the level value of each bit in the response level of the target tag with the value of the corresponding bit in the second value to be sent in sequence; If the level values ​​of each bit in the response level of the target tag are the same as the values ​​of the corresponding bits in the second value to be sent, it is determined that the values ​​of the first N bits of the target tag are the same as the values ​​of the first N bits in the first tag.

5. The tag recognition method according to claim 1, characterized in that: The method of sending a radio frequency signal to each target tag multiple times according to the value of the first N bits, and sequentially identifying the value of the last M bits in each target tag according to the response level of each target tag, includes: According to the number of currently identified tags, determine the value at the starting identification position corresponding to the current target tag; According to the value at the starting identification position corresponding to the current target tag and the value at the first N bits, the radio frequency signal is sent to each target tag multiple times, and according to the response level of each target tag, the current target tag is identified and the number of currently identified tags is updated.

6. The tag recognition method according to claim 5, characterized in that: The method of sending radio frequency signals to each target tag multiple times according to the value at the starting identification position and the value at the first N bits corresponding to the current target tag, and identifying the current target tag according to the response level of each target tag, includes: A2. Determine the current conflicting bit and the current value of the current conflicting bit; B2, combining the current value of the current conflicting bit and the values ​​of all bits before the current conflicting bit into a third value to be sent; C2, sending a radio frequency signal corresponding to the third value to be sent to each unidentified tag in the target area; D2. Determine the number of unidentified tags that is the same as the third value to be sent according to the response level of each unidentified tag in the target area; E2. If the number of unidentified tags is the same as the preset threshold value of the number of unidentified tags, the current target tag is identified according to the third value to be sent; F2. If not, determine a new current conflicting bit according to the third value to be sent, and re-execute step A2.

7. The tag recognition method according to claim 6, characterized in that: The step of determining the number of unidentified tags having the same value as the third value to be sent according to the response level of each unidentified tag in the target area includes: The level values ​​of each bit in the response level of the second tag are compared with the values ​​of the corresponding bits in the current value in turn. If the level values ​​of each bit in the response level of the second tag are the same as the values ​​of the corresponding bits in the current value, the number of tags that are the same as the first value to be sent is increased by one, where the second tag is any unidentified tag.

8. A tag recognition device, characterized in that: include: A sending module, used for sending radio frequency signals to a target area multiple times; A first identification module, used for identifying a first tag according to the response level of each tag in the target area; A determination module, configured to determine, based on the values ​​of the first N bits in the first label, whether the values ​​of the first N bits of each target label other than the first label are the same as the values ​​of the first N bits in the first label; The second identification module is used to send radio frequency signals to each target tag multiple times according to the value of the first N bits, and identify the value of the last M bits of each target tag in turn according to the response level of each target tag, wherein N and M are integers greater than 0 respectively.

9. An electronic device, characterized in that: include: A processor and a memory, wherein the memory stores machine-readable instructions executable by the processor, and when the electronic device is running, the processor executes the machine-readable instructions to perform the steps of the tag identification method as described in any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the tag identification method according to any one of claims 1 to 7 are executed.

Images