CN102112994A - Sequence recognition of RFID transponders - Google Patents

Abstract

The invention relates to a method for identifying the sequence of several RFID transponders (T) detected by an RFID reader (L), wherein said RFID transponders (T) belong to several objects (O) , the object (O) moves on a conveying line (f) and passes through the RFID reader (L); when an object (O) is at two specified points (A, E) of the conveying line (f) ) while moving between, assign all detected RFID transponders (T) to the object (O); for each RFID transponder (T) measure a Probable quality value (Q) on (O); if said measured quality value (Q) is smaller than a first prescribed threshold (Sabs), an RFID transponder (T) is disconnected from said object (O) distribution relationship among them.

Description

Sequential identification of RFID transponders

technical field

The invention relates to a method for identifying the sequence of a plurality of RFID transponders detected by an RFID reader.

Background technique

RFID readers for reading RFID transponders are currently commonly used in fields where objects such as piece count items need to be sorted and distributed. Therefore, such RFID readers are increasingly used in baggage sorting systems or mail distribution centers to ensure fast sorting and delivery of luggage and postal parcels. A transponder mounted on each piece item stores information about the destination of the piece item. The information is read out from each transponder by the RFID reader on a specific reading station, so that the luggage or postal bag can be distributed by using the transponder fixed on the luggage or postal bag and the information contained therein, or by luggage sorting. Picking system for delivery. That is, the transport route of the respective piece of luggage or postal parcel is determined on the basis of the data stored on the RFID transponder.

In view of this, in the process of reading and writing the RFID transponder, especially the correct identification of the sequence of the piece counting items controlled by the RFID reading room (RFID-Lesekabine) is very important for the realization of smooth transportation. The correct recognition of the sequence of the conveyed objects is particularly relevant for the rapid and dense conveying of piece goods. If identified incorrectly, piece count items may be routed in the wrong direction or sent to the wrong destination. It is precisely in baggage conveyor systems or mail distribution centers that aim at fast transportation that pieces of luggage or postal parcels pass said RFID readers rapidly at appropriate intervals. This may lead to the situation that the RFID reader detects multiple transponders belonging to different parcels or luggage at the same time, so that it cannot be clearly identified, which will lead to the occurrence of wrong classification situations.

In order to prevent the above-mentioned errors, shielded reading rooms are mainly used at present to ensure that the RFID readers only recognize objects located in the reading room as much as possible. In order to ensure an error-free recognition of the sequence of objects passing successively through the reading room, a certain minimum distance must be maintained between the objects, which is adapted to the speed of these objects. However, it would be desirable to reduce this distance while still enabling reliable identification of RFID transponders and thus reliable allocation of said transponders and those objects that pass the RFID reader.

Contents of the invention

In view of this, it is an object of the present invention to provide a method for the reliable identification of the sequence of RFID transponders and the respective associated objects.

The solution of the invention for achieving this object is a method for identifying the sequence of several RFID transponders detected by an RFID reader, wherein said several RFID transponders belong to several objects, The object moves on a conveyor line and passes the RFID reader; when an object moves between two specified points on the conveyor line, all detected RFID transponders are assigned to this object; for each An RFID transponder measures a quality value representing the probability that the RFID transponder is located on the object; if the measured quality value is less than a first prescribed threshold, the communication between the RFID transponder and the object is released. distribution relationship.

The invention is based on the realization that by generating a quality value representing the frequency with which a transponder assigned to an object is detected, an evaluation criterion can be provided for judging the correct assignment of the corresponding transponder to this object. The quality value is an absolute measure, since it is derived from the sum of the number of times a transponder assigned to an object has been detected. In this way, each transponder detected by an RFID reader in the reading room can be assigned a value, and the detection of this transponder in relation to the object in question can then be obtained by a simple comparison of this value with a defined threshold . The transponder can be easily assigned to the corresponding object by detecting the transponder and determining the quality value within a defined time period, which refers to a defined starting point and a defined value of the object on the conveyor line. The period of motion between endpoints. This makes it possible to accurately determine how often the transponder is read during the movement of the object from a defined starting point to a defined end point. In this way, the detection of the transponder can be easily assigned to the corresponding object.

The calculation of the quality value is simple and can be carried out directly during the passage of the luggage or postal package with the corresponding transponder through the RFID reader. A quality value is thus already determined during the transport process and the transponder is assigned to the corresponding object accordingly.

In this case, the measured quality value is preferably determined from the sum of all detection times a transponder is subjected to. This law is simple to implement and allows a fast and reliable determination of the quality value of the transponder. Multiple detection refers to the following situations: multiple antennas of the RFID reader arranged in the reading room simultaneously recognize the transponder, or the object passes through the reading room in such a way that the transponder detected within multiple scan cycles of the device.

An advantageous embodiment of the invention is characterized in that the quality value measured by a first RFID transponder during the movement of the object between the two points is compared with the quality value of the next RFID transponder in the The quality values measured during the movement of the object between the two points are compared.

Simple use is made here of the fact that a quality value is determined for each transponder during the passage of an object through the reading room. This quality value can be compared to the quality value of another transponder that the object was read as it passed through the reading room. For example, if a first transponder is detected four times and a second transponder is detected only twice, the quality value of the first transponder is greater than the quality value of the second transponder. If you now associate these two quality values, you can get a value that can be used to determine whether the correct assignment between the transponder and the object has been achieved. In the simplest case, this value is the quotient of the two quality values of the detected transponders. If this quotient exceeds a defined threshold value, the assignment of the transponder detected first to the object is released. For each transponder, there is thus an evaluation function on the basis of which it can be determined whether a transponder is associated with an object. This method is carried out or this calculation is performed until all transponders detected at a point in time when the object is located between the start and the end of the detection line have been compared with each other. Eventually, the transponder with the better quality value will be assigned to the object.

A further advantageous embodiment of the invention is characterized in that the quality value determined for an RFID transponder for a first object is compared with the quality value determined for the same transponder for the next object. In this way, the detected qualities of the transponder for several consecutive objects can be determined and compared with each other, so that the assignment of the transponder to the object is still undetermined The situation is sorted out. In this case, the transponder is evaluated for a plurality of preceding objects and a plurality of subsequent objects. This evaluation is performed for all transponders that have been assigned to the current object. For example, the frequency with which a first transponder is detected for a first object can be counted. This value is then compared to how often the same transponder was detected for the next object. Here too, an evaluation function is defined, which is based on the quotient of the detection quality of the first transponder in the current object and the detection quality of the same transponder in the comparison object. If the quotient of the merit function exceeds a defined threshold value, the assignment of the verified transponder to the current object is released. This evaluation is carried out for all transponders detected for a current object. This evaluation can likewise be carried out for all subsequent objects. In this way, by evaluating the quality of the individual transponders within an object and of a particular transponder over several objects, it is generally possible to reliably determine the Sequence of RFID reading units.

It is also possible to first compare the quality of a particular transponder within a range of objects and then evaluate the transponders within a range of objects. This approach is particularly suitable when the reception quality of the individual serially aligned transponders fluctuates greatly, for example due to their unfavorable position on the object. If one transponder is read a lot and the next transponder is read a few times, an analysis of the two transponders for a certain object will result in a wrong assignment.

The method described above is especially suitable for the following situations: a large number of objects assigned transponders pass through an RFID reader at high speed, and the information stored on each transponder is read in order to further send the object to a specific RFID reader based on the read data. direction. It can be seen that the method of the present invention can be applied to any type of single item classification system. Therefore, it can also be used in production equipment that needs to be transported by different routes or further processed by different methods according to the characteristics of the workpiece. The method is also applicable for sorting materials or workpieces in high-bay warehouses.

The method according to the invention enables a reliable assignment of the objects even at high transport speeds and at small distances between the objects. This reliability can be adjusted via the merit function and the corresponding threshold. The method according to the invention also reliably filters out transponders of other objects which are accidentally detected, such detections being produced by reflection for structural reasons. Comparing transponders of different subjects increases the probability that a transponder is reliably assigned to a subject. This is especially prominent when the distance between the objects to be detected is small.

Description of drawings

The present invention is described in detail and set forth below with the aid of accompanying drawing, wherein:

Figure 1 is a schematic diagram of a delivery system; and

Fig. 2 is a flow chart of the method of the present invention.

Detailed ways

FIG. 1 shows a conveyor system for conveying objects O, which can be piece items such as mail bags, luggage, workpieces or workpiece carriers. The objects are conveyed by a conveying line f. The objects pass through a reading room containing an RFID reader L during transport. Each object O is assigned an RFID transponder T. In this reading room, the individual transponders T are detected by an RFID reader L which here has several antennas LG. In the process, the movement sequence of the object O and the transponder T on the conveyor line f is determined. Depending on the measured sequence, the objects O are then transported further by different routes, for example to two different destinations Z1 , Z2 .

Fig. 2 is a flowchart showing the steps of the method for sequentially identifying RFID transponders according to the present invention.

Step 1: Assign all transponders detected within a defined reading zone:

During the movement of an object O on the conveyor line f, all transponders detected between a defined start point and a defined end point are assigned to this object O.

It stipulates as follows:

f _A = starting point of conveying area

f _E = end of conveying area

Step 2: Determine the quality of the transponders for each object:

The quality Q of each transponder T is determined, which is related to the probability that the transponder T is located on the object:

Q(T _i ) = Quality of transponder T _i .

In the simple case, the quality is the sum of all times a transponder T _i has been detected:

$\mathrm{<span\; class="notranslate">\; Q</span>}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; T</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; \&Sigma;</span>}}_{{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; E.</span>}}}^{{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; A</span>}}}{\mathrm{<span\; class="notranslate">\; T</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; .</span>$

If Q(T _i ) is smaller than a defined threshold S, the assignment of the transponder to an object is released.

Step 3: Evaluate transponders against different objects:

After step 2 has been completed, there are still cases where it is uncertain whether all assigned and evaluated transponders actually also belong to the object. For this purpose it is necessary in step 3 to determine the transponders and their qualities for several consecutive objects. An evaluation function B _oi is specified, which is associated with a certain transponder T _i with respect to several objects. In general, transponders T _i are evaluated for m preceding objects and n succeeding objects. This evaluation is performed for all transponders that have been assigned to the current object. When n subsequent objects leave the specified reading area described in step 1, step 3 can be implemented for a specific object.

In the simple case, the evaluation function B _oi is the quotient of the transponder quality T _i in the comparison object O _V and the transponder quality T _i in the current object O _A :

${\mathrm{<span\; class="notranslate">\; B</span>}}_{{\mathrm{<span\; class="notranslate">\; o</span>}}_{\mathrm{<span\; class="notranslate">\; A</span>}}}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; o</span>}}_{\mathrm{<span\; class="notranslate">\; A</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; o</span>}}_{\mathrm{<span\; class="notranslate">\; V</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; T</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span>\frac{{\mathrm{<span\; class="notranslate">\; Q</span>}}_{{\mathrm{<span\; class="notranslate">\; o</span>}}_{\mathrm{<span\; class="notranslate">\; V</span>}}}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; T</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; )</span>}{{\mathrm{<span\; class="notranslate">\; Q</span>}}_{{\mathrm{<span\; class="notranslate">\; o</span>}}_{\mathrm{<span\; class="notranslate">\; A</span>}}}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; T</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; )</span>}<span\; class="notranslate">\; .</span>$

The formula for evaluating comparison objects is:

${\mathrm{<span\; class="notranslate">\; B</span>}}_{{\mathrm{<span\; class="notranslate">\; o</span>}}_{\mathrm{<span\; class="notranslate">\; V</span>}}}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; o</span>}}_{\mathrm{<span\; class="notranslate">\; A</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; o</span>}}_{\mathrm{<span\; class="notranslate">\; V</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; T</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span>\frac{{\mathrm{<span\; class="notranslate">\; Q</span>}}_{{\mathrm{<span\; class="notranslate">\; o</span>}}_{\mathrm{<span\; class="notranslate">\; A</span>}}}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; T</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; )</span>}{{\mathrm{<span\; class="notranslate">\; Q</span>}}_{{\mathrm{<span\; class="notranslate">\; o</span>}}_{\mathrm{<span\; class="notranslate">\; V</span>}}}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; T</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; )</span>}<span\; class="notranslate">\; .</span>$

Taking into account the simple case of determining the quality of the transponder in step 2, the formula for evaluating the current object is:

${\mathrm{<span\; class="notranslate">\; B</span>}}_{{\mathrm{<span\; class="notranslate">\; o</span>}}_{\mathrm{<span\; class="notranslate">\; A</span>}}}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; o</span>}}_{\mathrm{<span\; class="notranslate">\; A</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; o</span>}}_{\mathrm{<span\; class="notranslate">\; V</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; T</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span>\frac{{\mathrm{<span\; class="notranslate">\; \&Sigma;</span>}}_{{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; A</span>}}}^{{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; E.</span>}}}{\mathrm{<span\; class="notranslate">\; T</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; o</span>}}_{\mathrm{<span\; class="notranslate">\; V</span>}}<span\; class="notranslate">\; )</span>}{{\mathrm{<span\; class="notranslate">\; \&Sigma;</span>}}_{{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; A</span>}}}^{{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; E.</span>}}}{\mathrm{<span\; class="notranslate">\; T</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; o</span>}}_{\mathrm{<span\; class="notranslate">\; A</span>}}<span\; class="notranslate">\; )</span>}<span\; class="notranslate">\; .</span>$

The formula for evaluating comparison objects is:

${\mathrm{<span\; class="notranslate">\; B</span>}}_{{\mathrm{<span\; class="notranslate">\; o</span>}}_{\mathrm{<span\; class="notranslate">\; V</span>}}}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; o</span>}}_{\mathrm{<span\; class="notranslate">\; A</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; o</span>}}_{\mathrm{<span\; class="notranslate">\; V</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; T</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span>\frac{{\mathrm{<span\; class="notranslate">\; \&Sigma;</span>}}_{{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; A</span>}}}^{{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; E.</span>}}}{\mathrm{<span\; class="notranslate">\; T</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; o</span>}}_{\mathrm{<span\; class="notranslate">\; A</span>}}<span\; class="notranslate">\; )</span>}{{\mathrm{<span\; class="notranslate">\; \&Sigma;</span>}}_{{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; A</span>}}}^{{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; E.</span>}}}{\mathrm{<span\; class="notranslate">\; T</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; o</span>}}_{\mathrm{<span\; class="notranslate">\; V</span>}}<span\; class="notranslate">\; )</span>}<span\; class="notranslate">\; .</span>$

In the simplest case, this is just a comparison with the preceding object and the following object.

Step 3.1: Evaluate a transponder against the preceding object O _V :

超过一个规定阈值S，就从该当前对象中移除应答器T_i。对该当前对象的所有应答器都进行这种评价。If the evaluation function of the current object O _A

When a defined threshold S is exceeded, the transponder T _i is removed from the current object. This evaluation is carried out for all transponders of the current object.

超过一个规定阈值S，就从该在前对象中移除应答器T_i。对该当前对象的所有应答器都进行这种评价。If the merit function of the previous object

When a defined threshold S is exceeded, the transponder T _i is removed from the preceding object. This evaluation is carried out for all transponders of the current object.

Step 3.2: Evaluate a transponder for subsequent object _ON :

If the evaluation function of the current object O _A When a defined threshold S is exceeded, the transponder T _i is removed from the current object. This evaluation is carried out for all transponders of the current object.

If the evaluation function B _N ( _OA , _ON , T _i ) for the subsequent object _ON exceeds a defined threshold value S, the transponder T _i is removed from the subsequent object. This evaluation is carried out for all transponders of the current object.

Step 4: Evaluate the remaining transponders from Step 3:

In order to determine whether a transponder actually also belongs to an object, an evaluation function B can finally be assigned to each transponder T _i , which compares each transponder with respect to a second transponder T _j evaluate. If the merit function exceeds a defined threshold S, the transponder T _i is removed.

Removes the transponder from the object T _i .

In the simple case, this merit function is the quotient of the quality of T _j and the quality of T _i

${\mathrm{<span\; class="notranslate">\; B</span>}}_{{\mathrm{<span\; class="notranslate">\; T</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; T</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; T</span>}}_{\mathrm{<span\; class="notranslate">\; j</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span>\frac{\mathrm{<span\; class="notranslate">\; Q</span>}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; T</span>}}_{\mathrm{<span\; class="notranslate">\; j</span>}}<span\; class="notranslate">\; )</span>}{\mathrm{<span\; class="notranslate">\; Q</span>}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; T</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; )</span>}<span\; class="notranslate">\; .</span>$

If the simple case of determining quality in step 2 is taken into account, the result is:

${\mathrm{<span\; class="notranslate">\; B</span>}}_{{\mathrm{<span\; class="notranslate">\; T</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; T</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; T</span>}}_{\mathrm{<span\; class="notranslate">\; j</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span>\frac{{\mathrm{<span\; class="notranslate">\; \&Sigma;</span>}}_{{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; A</span>}}}^{{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; E.</span>}}}{\mathrm{<span\; class="notranslate">\; T</span>}}_{\mathrm{<span\; class="notranslate">\; j</span>}}}{{\mathrm{<span\; class="notranslate">\; \&Sigma;</span>}}_{{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; A</span>}}}^{{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; E.</span>}}}{\mathrm{<span\; class="notranslate">\; T</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}}<span\; class="notranslate">\; .</span>$

If the threshold S is set to 2, the transponder T _i is removed when the number of times the transponder T _j has been detected is greater than a factor of 2.

If all transponders detected at a certain point in time have been compared with each other, step 2 ends.

For the present invention, it is immaterial whether the steps of the method of the present invention are carried out in exactly the order described above. It is also possible to implement the aforementioned step 4 and then implement step 3 after the completion of steps 1 and 2, which can also achieve the purpose of reliably identifying the RFID transponder and the moving object.

Claims (13)

1. A method for identifying the sequence of a plurality of RFID transponders (T) detected by an RFID reader (L), wherein, The plurality of RFID transponders (T) belong to the plurality of objects (O), wherein the plurality of objects (O) move on a conveying line (f) and pass the RFID reader (L), assigning to an object (O) all detected RFID transponders (T) when the object (O) is moving between two defined points (A, E) of said conveyor line (f), determining for each RFID transponder (T) a quality value (Q) representing the probability that said RFID transponder (T) is located on said object (O), and If the measured quality value (Q) is smaller than a first defined threshold value (Sabs), the assignment between an RFID transponder (T) and the object (O) is released. 2. The method according to claim 1, wherein said measured quality value (Q) is the sum of all detection times said RFID transponder (T) is subjected to. 3. The method according to claim 1 or 2, wherein placing a first RFID transponder (T) of a first object (O) at said object (O) at said two points (A, E ) between the quality value (Q) measured during the movement process and the next RFID transponder (T) during the movement process of the object (O) between the two points (A, E) The quality value (Q) measured in is compared. 4. Method according to claim 3, wherein the quotient of the quality value (Q) of the next RFID transponder (T) and the quality value (Q) of the first RFID transponder (T) is generated. 5. Method according to claim 4, wherein, if the generated quotient exceeds a second prescribed threshold (S _rel ), the connection between the first transponder (T) and the object (O) is released. distribution relationship. 6. The method according to any one of the preceding claims, wherein the quality value (Q) determined for an RFID transponder (T) for a first object ( _OA ) is identical to the response The quality value (Q) measured by the instrument (T) for the next object ( _ON ) is compared. 7. Method according to claim 6, wherein the quality value (Q) determined for the RFID transponder (T) for the first object ( _OA ) is generated as for the same transponder (T) Quotient of quality values determined for the next object ( _ON ). 8. The method according to claim 7, wherein the assignment between the transponder (T) and the first object (OA) is released if the generated quotient exceeds a third defined threshold. 9. The method according to any one of the preceding claims, wherein said object (O) is a luggage item in a luggage conveyor system. 10. The method according to any one of the preceding claims, wherein the objects (O) are assigned to respective specific destinations according to the sequence of the RFID transponders. 11. A sorting system that takes item counting objects as classification objects, said sorting system classifies the piece counting items by using the method according to any one of claims 1 to 10 by means of at least one RFID reader. 12. The sorting system of claim 11, wherein said piece item is a mail package in a mail distribution center. 13. The sorting system of claim 11, wherein the piece item is a piece of luggage in a luggage conveyor system.

Images