Method and system for correctly identifying specific RFID tags

Abstract
A system and method for identifying a specific RFID tag includes RFID reader circuitry, such as within an RFID reader, configured for sending and receiving RF signals to detect RFID tags and for obtaining signal parameter information associated with the RFID tags. Processing circuitry is configured for using the signal parameter information for one or more tags of the RFID tags and calculating a tag score for the one or more RFID tags. The processing circuitry is further configured for determining a specific RFID tag using the tag scores for the one or more RFID tags.
Description
TECHNICAL FIELD

This invention relates generally to systems for reading radio frequency identification (RFID) tags, and more specifically, to a system that can identify a specific RFID tag on a product in the vicinity of other RFID tags.


BACKGROUND

Storage and management of inventory is a critical function of many businesses, including the manufacturing, retail, and shipping industries. For efficiency purposes, it is desirable to communicate product information to a centralized inventory tracking system as the product is being removed or placed on shelves, rather than requiring a separate entry of product information at a central location after removal or placement of the product.


One conventional method for communicating product information to an inventory tracking system includes UPC bar codes that are placed on the products and portable bar code scanners that are carried by the workers manipulating the product. Portable bar code scanners are typically plugged in as an attachment to a portable electronic device such as a mobile computer device. The scanners are used to scan the codes of UPC labels or information on a variety of different items for the purpose of managing, storing, shipping, or otherwise handling such items. Such scanners use optical light signals that are passed over the UPC does to read the codes. Generally, the scanners are pointed at the UPC codes.


While UPC codes and scanners to read such codes provide a convenient system for capturing inventory information, such a system has several drawbacks. First, UPC scanners require a line-of sight to the UPC label or graphic on a package in order to read the code. This may be difficult to achieve when lining up the scanner with the UPC code. Additionally, UPC codes on products or packaging can be damaged or marked up so that reading the code becomes nearly impossible. Consequently, the use of radio frequency identification (RFID) tags has increased, and RFID tags are increasingly growing in popularity to replace the conventional UPC barcode tracking system.


When used on products as an inventory label, RFID tags can communicate data to an RFID reader somewhat similar to a UPC code. An RFID tag includes a microchip with data, an antenna, and sometimes a power source such as a battery (e.g. active RFID tag). An RFID reader also has an antenna, and the RFID reader's antenna transmits electromagnetic energy in the form of an RF beam or radio waves to the vicinity of the RFID tags. Each RFID tag that is located within the range of the RFID reader then energizes and sends identification information back to the RFID reader via RF radio signals. RFID tags, because they radiate their information as radio signals, may be read without having a line-of-sight arrangement between an RFID reader and a tag. While readers often focus their RF beam for efficiency, the RFID read does not have to be specifically pointed at a particular tag like a UPC reader does. In the inventory example, the identification information from an RFID tag may include an Electronic Product Code (EPC), which is a direct replacement for the UPC bar code. Thus, an RFID reader can scan and detect all products carrying an RFID tag within the range of the reader, and no manual scanning of each product is necessary.


Such non-directivity to the RFID scan, however, presents another issue. One drawback of current RFID reader systems is that several RFID tags will be read when they are within the range of the RFID reader. The RFID read process is not selective when a worker removes a specific product from a shelf full of products carrying RFID tags, a reading on an RFID reader will include the EPC or identification information of all the tagged products in the vicinity of the reader's RF beam, not just the selected product removed from the shelf. If the specific RFID tag on the removed product cannot be determined, then the RFID reader will not be able to communicate meaningful information to a centralized inventory system. Alternatively, when a worker is moving around and scanning inventory in a particular area, multiple reads may occur on multiple tags, even though information from only a specific tag is desired. Consequently, it is desirable to have a better control of the reading process and selectively in correctly identifying an RFID tag on a specific product or item.


SUMMARY

The invention according to one embodiment includes a system for identifying a specific RFID tag attached to an item. The system includes RFID reader circuitry configured for sending and receiving RF signals to detect RFID tags and for obtaining signal parameter information associated with the RFID tags. Signal parameter information is obtained regarding the RF signals received by the antenna from one or more of the plurality of tags. The signal parameter information is used to calculate a tag score for the RFID tags and to determine a specific RFID tag using the tag scores for the tags.


In one embodiment, the reader circuitry or RFID reader is operable for determining a received signal strength indication (RSSI) value and an occurrence frequency value for each of the RFID tags. Using received signal strength indication and occurrence frequency values, tag scores are calculated for the RFID tags with processing circuitry running an algorithm. The processing circuitry can be in a separate device or with the reader circuitry. A difference between the highest tag score of the RFID tags and the next highest tag score is compared a first threshold value to determine a specific RFID tag using the tag scores. The RFID tag associated with the highest tag score is selected as the specific RFID tag if the difference exceeds the first threshold value.


The RSSI and occurrence frequency values are added and averaged for the measured RFID tags to calculate a tag score for each RFID tag. Also, before being added and averaged, the RSSI values and occurrence frequency values might be normalized in the process, such as by dividing the RSSI value by the maximum detected RSSI value, and by dividing each occurrence frequency value by the maximum occurrence frequency value detected. One or more of the RSSI value and occurrence frequency values might also be emphasized by multiplying the RSSI and occurrence frequency values by a respective multiplier value.


In one embodiment, if the difference does not exceed the first threshold value, signal parameter information is again extracted and another tag score is calculated for one or more of the RFID tags. The difference is determined between the highest another tag score and the next highest another tag score and the difference is compared to the first threshold value to determine a specific RFID tag using the tag scores. If the difference between the tag scores again does not exceed the first threshold value, the various tag scores for each RFID tag are averaged to determine an average score for each RFID tag, and the difference between the highest average score and the second highest average score is determined and compared to a second threshold value. An RFID tag associated with the highest average score is selected as the specific RFID tag based upon if the difference between the highest average score and the second highest average score exceeds the second threshold value.





BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate an embodiment of the invention and, together with a general description of the invention given below, serve to explain the principles of the invention.



FIG. 1 is an illustration of a worker using an RFID reader for determining an RFID tag of a specified package according to one embodiment of the present invention.



FIG. 1A is a schematic diagram of an RFID reader device in accordance with one embodiment of the invention.



FIG. 1B is a schematic diagram of a computer device for use in one embodiment of the invention.



FIG. 2 is a perspective view of a package as in FIG. 1, depicting an exemplary RFID tag and an identification label.



FIG. 3 is a flowchart illustrating the operation of one embodiment of the invention.





DETAILED DESCRIPTION

Referring to FIGS. 1-3, one embodiment of an RFID reader system 10 for identifying a specific radio frequency identification (RFID) tag 12 attached to an item 14 is illustrated. As shown in FIG. 1, a worker 16 or other user managing the inventory of a business (e.g., filling orders, restocking shelves, etc.), moves around an area where inventory and associated RFID tags are located. While one exemplary embodiment, as disclosed herein, might be useful for managing inventory, it will be generally understood that the invention has applicability in any environment where RFID tags are used. Therefore, the invention is not at all limited to just inventory uses.


In the illustrated example, worker 16 may pick up a specific item 14, such as a box, from a rack or shelf 18 holding a plurality of other boxes 20 or other items. As the worker 16 moves the specific box 14 to a cart or some other location, the worker 16 may record the identification information of the specific box 14 for use by a central inventory management system so as to record the disposition of the items 14, 20, or otherwise track movement of the items so that the inventory records remain accurate.


As illustrated in FIG. 1, worker 16 may carry a portable electronic device 22, such as a portable or mobile computer device, that is configured to process information and to communicate with a remote or central management system 23 (See FIG. 1A) and/or other workers. To that end, device 22 might incorporate a Wi-Fi link to the remote or central system 23. Once suitable such device 22 for use with the invention would be a Talkman® device available from Vocollect, Inc. of Pittsburgh, Pa. The work environment, for example, might be a speech-directed or speech-assisted work environment wherein the worker 16 would interface with a central system utilizing speech through speech recognition and text-to-speech (TTS) functionalities. Device 22 might be coupled to a headset 28, such as by a cord 29 or a suitable wireless link for the speech interaction. Also coupled to device 22 is a portable RFID reader 24 that is also coupled to device 22 through a cord 25 or a wireless link. RFID reader 24 may be carried or worn by the user as shown in FIG. 1 and incorporates internal electronics and an internal or external antenna, along with suitable controls for providing the desired RFID reader functionality, according to aspects of the invention. FIG. 1 illustrates just one possible embodiment of an RFID reader 24 that can implement the invention.



FIGS. 1A and 1B illustrate components, including an RFID reader and a computer device for implementing embodiments of the invention. Referring to FIG. 1A, an RFID reader 24 includes a housing 30 that contains suitable processing circuitry 32 controlled by a microprocessor or other processor element 34 for implementing the RFID read functionality of the reader 24. In some embodiments of the invention, the processor and processing circuitry might also provide an RFID write functionality. However, the present invention is directed primarily to the read functionality of reader 24. The reader 24 also includes an antenna 36 that is utilized to transmit and receive RF signals 38, with respect to an RFID tag 40. While antenna 36 is shown internal to the housing 30 of RFID reader 24, the antenna might also be an external antenna. The antenna 36 will generally be coupled to a suitable transceiver circuit 31 that may be implemented as part of the processing circuitry 30 of reader 24. The reader 24, and particularly the processing circuitry 32, may be coupled to computer device 22, such as by cord 25. Alternatively, processing circuitry 32 might also provide a wireless link, such as a WPAN link through a WPAN interface 27, for example, to communicate with computer device 22. Device 22 might then further process and utilize the RFID information obtained utilizing reader 24. In accordance with one aspect of the present invention, the invention provides a selectivity to the RFID read operation so that a desired RFID tag and the information associated therewith may be isolated from other RFID tags which are in the vicinity of the desired tag and are also read during the RFID reading process. In accordance with one aspect of the invention, signal parameter information is extracted or obtained regarding one or more RFID tags. The signal parameters information is then used and further processed to determine a specific RFID tag.


In one embodiment, the signal parameter information is captured by the RFID reader and passed to computer device 22 for further processing. In other embodiments, the processing to determine a specific RFID tag might be handled by the processing circuitry of RFID reader 24, or elsewhere, such as in computers or servers of remote system 23. Accordingly the invention is not limited to the embodiments discussed and disclosed herein. Also, the processing and implementation of the algorithm disclosed herein might be handled in part by processing circuitry of various of the reader 24, device 22 and remote system 23 and the algorithm does not have to be implemented completely in one component.



FIG. 1B is a block diagram of one exemplary embodiment of a computer device for use in implementing the invention. Specifically, device 22 includes processing circuitry 50 which may include a processor element 52 for controlling the operation of the computer device and other associated processing circuitry. Such processors generally operate according to an operating system, which is a software speech implemented series of instructions. Processing circuitry 30 may also implement one or more application programs in accordance with the invention. Processor 52 may be a main processor chip coupled to a suitable companion processor circuit. Processing circuitry 50 may also be coupled to appropriate memory, such as flash memory 56 and random access memory 48. The processor and companion components 52, 54 may be coupled to the memory 56, 58, through appropriate buses such as an address bus 60 and data bus 62. When the present invention is utilized within a speech-based or voice-based system, the headset 23 may interface with device 22 through an appropriate audio coder/decoder chip or CODEC 70. To provide communications with remote system 23, such as over a wireless link, device 22 might also incorporate a suitable RF communication card 66 coupled through an appropriate slot 64 with the processing circuitry 50. As discussed herein, various of the processing provided by the invention for the selection of a specific RFID tag from among a plurality of tags might be handled through the processing circuitry 50 of device 22, through processing circuitry associated with the remote system 23, or directly through the processing circuitry of the RFID reader 24, or a combination of various of those elements. In one embodiment of the invention, the RFID reader is configured for sending and receiving RF signals for detecting RFID tags and obtaining signal parameter information associated with the RFID tags. Computer device 22 then runs the specific processing algorithm for using the signal parameter information regarding the RF signals received by the reader device from one or more of the RFID tags, and for using the signal parameter information to determine a specific RFID tag as discussed further herein below.


Referring again to FIGS. 1 and 2, an item or box 14 carries an RFID tag 12 that contains an electronic product code (EPC) 36 that may be read by reader 24. The EPC or other identification information might also be written on a UPC bar code label 13, along with the UPC code information 15. While the example illustrated herein for explaining the invention refers to a particular item or box 14 carrying an RFID tag, it would be readily understood by a person of ordinary skill in the art that the RFID tags might also be utilized to provide information regarding a larger number of individual items, such as a case of items, a pallet of items, or some other manageable inventory unit that has multiple items, boxes, or packages therein. Furthermore, RFID tags might be utilized to provide information regarding a particular location of an item, such as a warehouse aisle, shelf, slot, or bin within a larger warehouse environment. Accordingly, the present invention is not limited to the particular type of information stored or use of an RFID tag.


The RFID reader 24 includes an antenna 36 that sends out, or transmits, electromagnetic energy in the form of RF radio waves or signals 38 to a surrounding area during the read process. The RFID tag 12 receives this electromagnetic energy and the circuitry of the tag is then energized to send a reply RF or radio wave signal carrying or containing the EPC information or other information stored on the tag back to the RFID reader 24. The reply or return tag RF signal 39 is received by the antenna 36 and directed to the processing circuitry 32 for further processing of the tag information. However, referring to FIG. 1, every other box 20 on a storage rack 18 adjacent to the worker 16 also carries an RFID tag 42 that receives the same electromagnetic energy 38 and may send back a signal 39 with identification information to the RFID reader 38. However, the other tags 42 may have information not associate with the item 14 that is handled by the worker 16. Thus, the signal of the specific RFID tag 12 on the desired box or item 14 and the information associated therewith must be reliably distinguished from the multiple signals of the other RFID tags 42 on the non-selected items boxes 20 so that the correct EPC 36 and product information can be recorded and processed by the reader 24, portable electronic device 22, and ultimately by the central inventory management system or other system.


To implement the invention to determine the correct RFID tag 12, the RFID reader 24 includes circuitry, such as processing circuitry 32 that is configured to extract or obtain signal parameter information as discussed below, and to operate, in one embodiment, in conjunction with device 22 to determine a specific RFID tag. For example, processing circuitry 32 might incorporate or be implemented by an RFID module from ThingMagic of Cambridge, Mass. To extract, calculate or otherwise obtain signal parameter information like RSSI values and “Times Read” values.


Specifically, the processing circuitry 32 is configured to extract information about RFID tags to be used by an algorithm for determining the proper or “best” tag that is read. A worker or user will pick up a box 14 with a tag 12, and they will initiate a scan with RFID reader 24. The algorithm is implemented in the invention within a certain time period in order to determine the information from a box or other tagged item in the worker's hand. If that information is determined promptly and properly, that information can be utilized, such as to direct the worker on how to further process the item. For example, in one embodiment of the invention, the inventive reader 24 might be implemented with a TALKMAN® portable computer device 22, which utilizes speech in a speech-directed or speech-assisted work environment. Information from the tag might be utilized by the TALKMAN® device 22, which then utilizes speech to direct a worker 16 how to further proceed. For example, the information that is read from the RFID tag might be an EPC code, a product description, or some other information. That information can be utilized by the worker to verify that the RFID read task was correctly implemented. If the invention does not determine information from the RFID read process after a certain period of time, it will return feedback information to the worker that no tags were found, such as in the form of an indication of “No Tags Founds”. If no tags are found, the worker can either do a re-scan, or they can use some other mode of entering the information, such as an EPC code. For example, in utilizing a TALKMAN® device 22, the worker might use voice to enter the EPC code or other information. Any re-scan process is repeated as desired, and the algorithm of the invention will have a specific period of time to correctly identify an item or otherwise read information from an RFID tag.


In accordance with one embodiment of the invention, the RFID read algorithm of the invention has a certain period of time, for example three seconds, to figure out or determine the proper RFID tag from which information is to be extracted or read. This time period might be broken down into a series of individual scans. For example, three 750 millisecond scans might be utilized. After the first scan, the invention determines if it knows the desired tag or “best” tag. If so, the tag information is returned as coming from the best tag or desired tag, and that RFID information is then further processed. If not, another RFID read or scan is done. After the second RFID scan, the invention again checks to know if it has determined the “best” tag. If so, the desired information read from the RFID tag is returned. If the best or desired tag still is not known, an additional scan might be done. The process might be repeated until the invention determines the best or desired tag. If it still cannot determine the best tag after a particular time period, the algorithm exits, and an indication such as “No Tags Found” might be returned to the worker or other user.


The RFID reader 24 performs a certain number of read cycles in a predetermined length of time, for example, the 750 milliseconds scan to obtain signal parameter information from one or more RFID tags. For each RFID tag 12, 42 in the range or vicinity of the RFID reader 24, the reader evaluates the signal parameters associated with the signals received from each of the tags. The RFID reader 24, and particularly the processing circuitry 32 or RFID module of the reader, detects and returns a “received signal strength indication” (RSSI) parameter. The RSSI parameter value for each tag is a measurement of the power present in a received radio signal from the tag. The reader 24 also returns an “occurrence frequency” or “TIMES READ” parameter that has a value indicative of the number of times the RFID tag 12, 42 has been read in the 750 milliseconds scan. These received signal parameter values and parameter information are used by processing circuitry and a control algorithm described herein to determine the desired RFID tag. The RSSI values and TIMES READ values or occurrence frequency information are further processed to calculate a tag score for each RFID tag 12, 42 detected according to the invention.


In one embodiment of the invention, processing circuitry in the computer device implements a control algorithm 100 to calculate the tag scores and to determine which of the RFID tags 12, 42 detected by the RFID reader 24 is the specific RFID tag 12 (best tag) on the specific box or item 14 carried by the worker 16. The control algorithm 100 is schematically illustrated in the flow chart of FIG. 3 and will be described in further detail below. The RFID reader 24 captures the signal parameter information (e.g., RSSI and “TIMES READ” parameters) and sends the information to device 22 for further processing. In another embodiment, the RFID reader processing circuitry 22 might perform the algorithm 100. In still another embodiment, the information might be forwarded to remote system 23 where the algorithm 100 is performed. In still another embodiment, such further processing of the information collected by reader 24 and the performance of the algorithm might be distributed over the various system components/devices including the RFID reader, computer device 22 and remote system 23. As such, even though the exemplary system described herein uses the device 22 for predominately processing algorithm 100, the invention is not limited to just that scenario.


As discussed further hereinbelow, the present invention incorporates a multiple-step algorithm for determining the desired tag or best tag during the reading process. If the best tag is not determined in the first stage, a second stage or even further additional stages might be utilized in accordance with aspects of the invention to determine the best tag.


Generally speaking, the control algorithm 100 will have a total detection time period, such as 3 seconds for example, to determine the identification information for the box 14 held by the worker 16. The processing circuitry implementing the algorithm is pre-programmed to break up this total detection time period into smaller segments or scans, for example the 750 millisecond scans noted above. The detection time will be whatever might be appropriate for running individual scans and analyzing the results, and the invention is not limited to a particular detection time or scan time. A worker 16 may begin a scan by pressing an appropriate button, or controlled element on the reader 24. The reader 24 might also be controlled via computer 22.


If a first individual scan of the RFID tags 12, 42 in the vicinity of the RFID reader 38 determines the specific RFID tag 12, then the processing stops the algorithm at that time and reports the identification information to the worker 16 and/or the portable electronic device 22 or remote system 23. If the processing circuitry cannot determine the specific RFID tag 12 from the first individual scan, more individual scans are conducted until either the specific RFID tag 12 is determined or the detection time period finishes, or times out. If the specific RFID tag 12 is not determined within the detection time period, then the processing circuitry of computer device 22 reports that no specific tag was detected. The worker 16 can then choose to run another scan over another detection time period, or alternatively, manually or verbally enter the EPC 36 from the specific box 14 into the portable electronic device 22.


Referring to FIG. 3, the control algorithm 100 for the processing circuitry 32 begins with an individual scan at step 101. As described above, the individual scan consists of sending out a signal in the form of a plurality of radio waves 38 from the antenna 40 of an RFID reader 38 and receiving return radio wave signals 39 from all RFID tags 12, 42 in the vicinity of the RFID reader output waves 38. Such scans result in received information from the received RF signals including signal parameter information. The processing circuitry, such as the processing circuitry of computer device 22, analyzes the readings and received signal parameters for the tags from the RFID reader 38 at step 102 to determine the RSSI signal parameter value for each RFID tag 12, 42. The processing circuitry also simultaneously analyzes the readings sent from the RFID reader 38 at step 103 to determine the occurrence frequency or “Times Read” signal parameter value for each RFID tag 12, 42.


Next, the RSSI values are normalized by the processing circuitry at step 104 such as by dividing the RSSI for each RFID tag 12, 42 by the maximum RSSI value of all tags read during that particular scan. Similarly, the Times Read values are normalized by the processing circuitry at step 105 such as by dividing the Times Read for each RFID tag 12, 42 by the maximum Times Read value. Thus, a normalized value between zero and one is calculated for the RSSI and Times Read values of each RFID tag 12, 42 in accordance with one embodiment of the invention.


The processing circuitry and algorithm may need to emphasize one of the detected metrics over the other. For example, it may be determined that the signal strength is more indicative of the specified RFID tag 12 than the occurrence frequency, or vice versa. Consequently, in one embodiment, an RSSI multiplier and a Times Read multiplier are stored and used in the control algorithm 100. To favor the RSSI metric, the RSSI multiplier will be greater than the Times Read multiplier. In step 106, the normalized RSSI values are multiplied by the RSSI multiplier to determine an RSSI score for each RFID tag 12, 42. Similarly in step 107, the normalized Times Read values are multiplied by the Times Read multiplier to determine a Times Read score for each RFID tag 12, 42. To favor the Time Read metric, that multiplier might be greater than the RSSI multiplier. Preferably, the RSSI multiplier and the Times Read multiplier will add up to a total value of 2, such that the tag scores remain normalized (between zero and one) when the RSSI score and the Times Read score are averaged in step 108. However, this limitation on the multipliers and tag scores is not absolutely necessary.


Averaging the RSSI score and the Times Read score is performed by adding those two score values for each RFID tag 12, 42 and then dividing the sum by two. Therefore, the processing circuitry and algorithm 100 determine a tag score for each RFID tag 12, 42 at step 108.


At this stage of the control algorithm 100, the processing circuitry determines which tag scores are the highest tag score and the next highest or second highest tag score if there are multiple tags and multiple tag scores at issue. At step 109, the processing circuitry 32 determines the difference between the highest and next highest tag scores and compares the difference between the highest tag score and the next or second highest tag score to a stored first threshold value stored used by the processing circuitry. If the difference between the tag scores is higher than the first threshold value, the control algorithm 100 continues to step 110. At step 110, the processing circuitry determines if more than one RFID tag 12, 42 was detected. If more than one tag was detected, then the RFID tag with the highest tag score is selected and reported as the specific RFID tag 12. In step 111, reader 24 reports or causes device 22 to report that the specified RFID tag 12 has been determined. In some embodiments, the portable electronic device 22 may report the EPC 36 or other identification information associated with the specified RFID tag 12. For example, an audible indicator might be used to indicate that a specific RFID tag has been determined. An audible indication like voice from the headset 28 might be used so that a worker 16 can verify that the correct RFID tag 12 was determined. If the processing circuitry and algorithm determine that the difference between tag scores does not exceed the first threshold in step 109, or if it determines than only one RFID tag was detected in step 110, then the algorithm continues to step 112.


At step 112, the processing circuitry determines if the individual scan just conducted in step 101 was the first scan. If so, the control algorithm returns back to step 101 to run another individual scan. Once a second set or another set of tag scores is determined, the same process of comparing the difference of the two highest tag scores to the first threshold is repeated at step 109. If this difference still does not exceed the first threshold value, then the processing circuitry will pass step 112 and continue to step 113. In step 113, an average tag score for each RFID tag 12, 42 is determined by taking the simple average of all tag scores for each RFID tag 12, 42 from the previous individual scans. At step 114, the processing circuitry and algorithm compares the highest average score and the second highest average score to determine if the difference between these average scores is greater than a stored second threshold value stored used by the processing circuitry. If the difference between the average scores exceeds the second threshold, the control algorithm 100 continues to step 115. At step 115, the algorithm determines if the highest average score is greater than a predetermined minimum average score threshold. If so, then the RFID tag with the highest tag score is the specified RFID tag 12 at step 116, which reports the identification information, as previously described with respect to step 111. If the processing circuitry determines that the difference between the average scores does not exceed the second threshold value in step 114, or if the processing circuitry determines the highest average score was actually lower than the predetermined minimum average score threshold in step 115, then algorithm continues to step 117.


At step 117, the algorithm determines if there is enough time remaining in the detection time period for an additional individual scan. If so, the processing circuitry returns to step 101 of the control algorithm for an additional individual scan and determination of whether the specified RFID tag 12 has been located using tag scores or average scores. If the processing circuitry determines that there is not enough time remaining for another individual scan at step 117, the processing circuitry reports that no RFID tag was found at step 118. Again, the worker 16 can then determine whether another scan will be performed or whether the EPC 36 or other identification information on the label 13 of the specific box 14 will be entered manually or verbally. Consequently, the specific RFID tag 12 on the specific item 14 carried by the worker 16 can be reliably determined and recorded using the RFID reader 24 and the associated control algorithm 100, regardless of how many other RFID tags 42 are in the vicinity of the worker 16.


A pair of example cases is provided below to further illustrate the operation of the control algorithm 100. In each example, the following parameters are set: the detection time period is 3 seconds; the individual scan time is 750 milliseconds; the Times Read multiplier is 1.2; the RSSI multiplier is 0.8; the first threshold value is 0.45; the second threshold value is 0.2; and the minimum average score threshold value is 0.8. Note that these parameters are configurable to adapt the control algorithm 100 for maximum effectiveness depending on the work conditions and RFID reader environment. For example, testing may be used during development to determine the best values. These values are then set in software.


Example A

In the first case, the first individual scan at step 101 of the control algorithm 100 reports the following information: Tag A was detected with an RSSI value of 100 and a Times Read value of 20, while Tag B was detected with an RSSI value of 80 and a Times Read value of 5. At step 104, the RSSI values are normalized by dividing each RSSI value by the maximum RSSI value, which is 100 in this example. Therefore, the normalized RSSI values are 1.0 and 0.8. At step 105, the Times Read values are also normalized by dividing each Times Read value by the maximum Times Read value, which is 20 in this case. Therefore, the normalized Times Read values are 1.0 and 0.25. These steps provide Tag A with a normalized RSSI of 1.0 and a normalized Times Read of 1.0, and Tag B with a normalized RSSI of 0.8 and a normalized Times Read of 0.25. At steps 106 and 107, the normalized values are further emphasized by multiplying them by the respective RSSI multiplier and Times Read multiplier. This provides Tag A with an RSSI score of 0.8 and a Times Read score of 1.2, while Tag B has an RSSI score of 0.64 and a Times Read score of 0.3. At step 108, these scores (i.e. RSSI and Times Read) are averaged by adding them together and dividing by two. This yields a tag score for Tag A of 1.0 while the tag score for Tag B is 0.47. At step 109, the processing circuitry 32 determines that the difference between these two highest tag scores is 0.53. The 0.53 value exceeds the first threshold of 0.45 (Step 109). Because more than one tag was detected (Step 110), Tag A will be reported as the specific RFID tag at step 111 and the control algorithm 100 ends.


Example B

In the second case, the first individual scan at step 101 of the control algorithm 100 reports the following information: Tag A was detected with an RSSI value of 100 and a Times Read value of 20, while the next highest tag, Tag B, was detected with an RSSI value of 80 and a Times Read value of 10. At step 104, the RSSI values are normalized by dividing each RSSI value by the maximum RSSI value, which is 100 in this case. At step 105, the Times Read values are normalized by dividing each Times Read value by the maximum Times Read value, which is 20 in this case. These steps provide Tag A with a normalized RSSI of 1.0 and a normalized Times Read of 1.0, and Tag B with a normalized RSSI of 0.8 and a normalized Times Read of 0.5. At steps 106 and 107, the normalized values are emphasized by multiplying them by the respective RSSI multiplier and Times Read multiplier. This provides Tag A with an RSSI score of 0.8 and a Times Read score of 1.2, while Tag B has an RSSI score of 0.64 and a Times Read score of 0.6. At step 108, these scores are averaged to determine that the tag score for Tag A is 1.0 while the tag score for Tag B is 0.62. At step 109, the processing circuitry 32 determines that the difference between these two highest tag scores is 0.38, which does not exceed the first threshold of 0.45. Thus, the processing circuitry 32 returns through step 112 back to step 101 to conduct another individual scan.


In the second individual scan, the following information is provided: Tag A was detected with an RSSI value of 100 and a Times Read value of 20, while Tag B was detected with an RSSI value of 90 and a Times Read value of 12. At step 104, the RSSI values are normalized by dividing each RSSI value by the maximum RSSI value, which is 100 in this case. At step 105, the Times Read values are normalized by dividing each Times Read value by the maximum Times Read value, which is 20 in this case. These steps provide Tag A with a normalized RSSI of 1.0 and a normalized Times Read of 1.0, and Tag B with a normalized RSSI of 0.9 and a normalized Times Read of 0.6. At steps 106 and 107, the normalized values are emphasized by multiplying them by the respective RSSI multiplier and Times Read multiplier. This provides Tag A with an RSSI score of 0.8 and a Times Read score of 1.2, while Tag B has an RSSI score of 0.72 and a Times Read score of 0.72. At step 108, these scores are averaged to determine that the tag score for Tag A is 1.0 while the tag score for Tag B is 0.72. At step 109, the processing circuitry 32 determines that the difference between these two highest tag scores is 0.28. This difference again does not exceed the first threshold value of 0.45. Now that two scans have been performed, the processing circuitry 32 moves to step 113 in the control algorithm 100.


At step 113, the average score for each tag is calculated as follows: Tag A had a first tag score of 1.0 and a second tag score of 1.0, the average of which is also 1.0. Tag B has a first tag score of 0.62 and a second tag score of 0.72, the average of which is 0.67. At step 114, the highest average score of Tag A (1.0) is compared to the second highest average score of Tag B (0.67). The difference between these average scores is 0.33, which exceeds the second threshold value of 0.2. As such, the processing circuitry 32 continues to step 115, where the processing circuitry 32 determines that the highest average score (1.0) does exceed the predetermined minimum average score threshold of 0.8. Thus, Tag A will be reported as the specific RFID tag at step 116 and the control algorithm 100 ends. If the average score determinations at step 114 and step 115 had been unsuccessful, another individual scan would have been run in this example because of remaining time.


If subsequent scans yield no tags, the reader 24 reports that no tag is found (Step 118). Therefore, the present invention provides a way of insuring that the desired RFID tag is read, and that the desired information is extracted from that tag for further use and processing of the tag information and the item associated with that tag information. The various alternative scenarios set forth above and other scenarios help a worker or user make a proper RFID scan and read, and creates greater efficiency in the RFID reader process. Furthermore, the invention removes the guesswork associated with trying to obtain the proper RFID read, and also does not require that the RFID reader be specifically focused in the direction of one particular item. The invention filters any stray information from other RFID tags, and insures that the proper information is utilized and processed.


While the present invention has been illustrated by the description of the embodiment thereof, and while the embodiment has been described in considerable detail, it is not the intention of the applicant to restrict or in any way limit the scope of the appended claims to such detail. Additional advantages and modifications will readily appear to those skilled in the art. For example, the average score calculations and determinations may not be performed until after a third individual scan in an alternative embodiment. Therefore, the invention in its broader aspects is not limited to the specific details representative apparatus and method, and illustrative examples shown and described. Accordingly, departures may be made from such details without departure from the spirit or scope of applicant's general inventive concept.

Claims
  • 1. A method for identifying a specific RFID tag, the method comprising: scanning RFID tags using an RFID reader;determining a received signal strength indication (RSSI) value for each of the scanned RFID tags;calculating a tag score for each of the RFID tags using the received RSSI value of each respective scanned RFID tag, wherein the calculated tag score is an average value of a first score corresponding to a normalized value of the received RSSI values and a second score corresponding to a normalized value of another signal parameter for each RFID tag, wherein the other signal parameter is an occurrence frequency value for each RFID;determining a difference between a highest tag score of the calculated tag scores for the RFID tags and a next highest tag score of the calculated tag scores for the RFID tags;comparing the difference with a first threshold; andidentifying the RFID tag having the highest tag score as the specific RFID tag in response to the difference being greater than the first threshold.
  • 2. The method of claim 1 further comprising: determining the occurrence frequency value for each of the RFID tags.
  • 3. The method of claim 1 further comprising selecting the RFID tag associated with the highest tag score as the specific RFID tag.
  • 4. The method of claim 1 further comprising: determining the occurrence frequency value for each of the RFID tags; and normalizing the RSSI values and occurrence frequency values by dividing the RSSI values by the maximum detected RSSI value, and by dividing the occurrence frequency values by the maximum detected occurrence frequency value.
  • 5. The method of claim 1 further comprising assigning a different weight to at least one signal parameter value of signal parameter information associated with the RFID tags over another signal parameter value in the calculation of the tag scores by multiplying the at least one signal parameter value by a respective multiplier.
  • 6. The method of claim 1, wherein when the difference does not exceed the first threshold value: again scan the RFID tags;calculate another tag score for each of the RFID tags;determine a difference between a highest another tag score and a next highest another tag score; andcompare the difference between the highest another tag score and the next highest another tag score to the first threshold value to identify the specific RFID tag using the another tag scores.
  • 7. The method of claim 6, wherein when the difference between the another tag scores again does not exceed the first threshold value, the method further comprises: averaging the tag score and the another tag score for each of the RFID tags to determine an average score for each of the RFID tags;determining a difference between the highest average score and a second highest average score;comparing the difference between the highest average score and the second highest average score to a second threshold value; andselecting the RFID tag associated with the highest average score as the specific RFID tag based upon if the difference between the highest average score and the second highest average score exceeds the second threshold value.
  • 8. A system for identifying a specific RFID tag, the system comprising: an RFID reader that scans RFID tags to obtain signal parameter information of each of the RFID tags, the signal parameter information comprising a received signal strength indication (RSSI) value for each of the RFID tags;circuitry that: uses the RSSI values for the RFID tags and assigns a different weight to at least one signal parameter value of the signal parameter information for the RFID tags over another signal parameter value to calculate tag scores by multiplying the at least one signal parameter by a respective multiplier for the RFID tags, wherein the signal parameter information further comprises occurrence frequency values for each of the RFID tags, wherein the circuitry averages the RSSI and occurrence frequency values for each of the RFID tags to calculate a tag score for each of the RFID tags, anddetermines a difference between a highest tag score and a next highest tag score for the one or more RFID tags and compares the difference to a first threshold value to identify the specific RFID tag using the tag scores.
  • 9. The system of claim 8 wherein the RFID reader circuitry and the processing circuitry are contained in a single device.
  • 10. The system of claim 8, wherein the signal parameter information further comprises the occurrence frequency value for each of the RFID tags, wherein the circuitry normalizes the RSSI values and occurrence frequency values by dividing each RSSI value by the maximum detected RSSI value, and normalizing the occurrence frequency values by dividing each occurrence frequency value by the maximum detected occurrence frequency value.
  • 11. The system of claim 10 wherein the RSSI values and the occurrence frequency values are normalized before emphasizing the values with a respective multiplier value.
  • 12. The system of claim 8 wherein when the difference does not exceed the first threshold value, to again obtain signal parameter information associated with the RFID tags and to calculate another tag score for the RFID tags and to determine a difference between a highest another tag score and a next highest another tag score and to compare the difference between the highest another tag score and the next highest another tag score to the first threshold value to identify the specific RFID tag using the another tag scores.
  • 13. The system of claim 12, wherein when the difference between the another tag scores again does not exceed the first threshold value, the processing circuitry: averages the tag score and the another tag score for each of the RFID tags to determine an average score for each of the RFID tags;determines a difference between the highest average score and a second highest average score;compares the difference between the highest average score and the second highest average score to a second threshold value; andselects the RFID tag associated with the highest average score as the specific RFID tag based upon if the difference between the highest average score and the second highest average score exceeds the second threshold value.
  • 14. The system of claim 13 wherein the circuitry is further operable, if the difference between the highest average score and the second highest average score exceeds the second threshold value, to determine if the highest average score is greater than a minimum average score threshold.
  • 15. A system for identifying a specific RFID tag, the system comprising: RFID reader circuitry that sends and receives RF signals to detect RFID tags and that obtains signal parameter information associated with the RFID tags; andprocessing circuitry that uses the signal parameter information for one or more tags of the RFID tags and assigns a different weight to at least one signal parameter value of the signal parameter information for the one or more RFID tags over another signal parameter value to calculate tag scores by multiplying the at least one signal parameter by a respective multiplier for the one or more RFID tags,wherein the tag scores are used to identify the specific RFID tag, wherein the calculated tag score is an average value of a first score corresponding to a normalized value of received RSSI values and a second score corresponding to a normalized value of another signal parameter for each RFID tag, wherein the other signal parameter is an occurrence frequency value for each RFID, andwherein the processing circuitry determines a difference between a highest tag score and a next highest tag score for the one or more RFID tags and compares the difference to a first threshold value to identify the specific RFID tag using the tag scores.
  • 16. The system of claim 15 wherein the RFID reader circuitry and the processing circuitry are contained in separate devices.
  • 17. The system of claim 15, wherein the RFID reader circuitry obtains signal parameter values including the received signal strength indication (RSSI) values and the occurrence frequency values for the one or more RFID tags.
  • 18. The system of claim 17 wherein the processing circuitry normalizes the RSSI values and occurrence frequency values by dividing the RSSI values by the maximum detected RSSI value, and normalizing the occurrence frequency values_by dividing the occurrence frequency values by the maximum detected occurrence frequency value.
CROSS REFERENCE TO RELATED APPLICATIONS

This is a Continuation of application Ser. No. 14/577,037 filed Dec. 19, 2014, which is a Continuation of application Ser. No. 14/188,312 filed Feb. 24, 2014, which in turn is a Continuation of application Ser. No. 12/841,798 filed Jul. 22, 2010. The disclosure of the prior applications is hereby incorporated by reference herein in its entirety.

US Referenced Citations (402)
Number Name Date Kind
1483315 Saal Feb 1924 A
1753317 Rothen Apr 1930 A
2170287 Kinnebrew Aug 1939 A
2369860 Schroeder Feb 1945 A
2506524 Stuck May 1950 A
2782423 Simon et al. Feb 1957 A
2958769 Bounds Nov 1960 A
3087028 Bonnin Apr 1963 A
3327807 Mullin Jun 1967 A
3363214 Wright Jan 1968 A
3654406 Reinthaler Apr 1972 A
3682268 Gorike Aug 1972 A
3781039 Locke et al. Dec 1973 A
3808577 Mathauser Apr 1974 A
3873757 Berke et al. Mar 1975 A
3969796 Hodsdon et al. Jul 1976 A
3971900 Foley Jul 1976 A
3971901 Foley Jul 1976 A
3984885 Yoshimura et al. Oct 1976 A
4010998 Tolnar, Jr. et al. Mar 1977 A
4018599 Hill et al. Apr 1977 A
4024368 Shattuck May 1977 A
4031295 Rigazio Jun 1977 A
4039765 Tichy et al. Aug 1977 A
4049913 Sakoe Sep 1977 A
4068913 Stanger et al. Jan 1978 A
4138598 Cech Feb 1979 A
4189788 Schenke et al. Feb 1980 A
4213253 Gudelis et al. Jul 1980 A
RE30662 Foley Jun 1981 E
4302635 Jacobsen et al. Nov 1981 A
4418248 Mathis Nov 1983 A
4471496 Gardner, Jr. et al. Sep 1984 A
4472607 Houng Sep 1984 A
4495646 Gharachorloo Jan 1985 A
4499593 Antle Feb 1985 A
4619491 Drogo et al. Oct 1986 A
4620760 Duncan Nov 1986 A
4634816 O'Malley et al. Jan 1987 A
4649332 Bell Mar 1987 A
4672672 Eggert et al. Jun 1987 A
4689822 Houng Aug 1987 A
4698717 Scheid Oct 1987 A
4739328 Koelle et al. Apr 1988 A
4811243 Racine Mar 1989 A
4821318 Wu Apr 1989 A
4845650 Meade et al. Jul 1989 A
4846714 Welsby et al. Jul 1989 A
4864158 Koelle et al. Sep 1989 A
4874316 Kamon et al. Oct 1989 A
4875233 Derhaag et al. Oct 1989 A
4888591 Landt et al. Dec 1989 A
4907266 Chen Mar 1990 A
4914704 Cole et al. Apr 1990 A
4952024 Gale Aug 1990 A
4999636 Landt et al. Mar 1991 A
5003589 Chen Mar 1991 A
5010495 Willetts Apr 1991 A
5012511 Hanle et al. Apr 1991 A
5018599 Dohi et al. May 1991 A
5023824 Chadima, Jr. et al. Jun 1991 A
5024604 Savin et al. Jun 1991 A
5028083 Mischenko Jul 1991 A
5030807 Landt et al. Jul 1991 A
5055659 Hendrick et al. Oct 1991 A
5056161 Breen Oct 1991 A
5063600 Norwood Nov 1991 A
5148155 Martin et al. Sep 1992 A
5155659 Kunert Oct 1992 A
5177784 Hu et al. Jan 1993 A
5179736 Scanlon Jan 1993 A
5197332 Shennib Mar 1993 A
5202197 Ansell et al. Apr 1993 A
5208449 Eastman et al. May 1993 A
5225293 Mitchell et al. Jul 1993 A
5241488 Chadima, Jr. et al. Aug 1993 A
5251105 Kobayashi et al. Oct 1993 A
5267181 George Nov 1993 A
5280159 Schultz et al. Jan 1994 A
5305244 Newman et al. Apr 1994 A
5309359 Katz et al. May 1994 A
5347477 Lee Sep 1994 A
5357596 Takebayashi et al. Oct 1994 A
5365050 Worthington et al. Nov 1994 A
5365434 Figliuzzi Nov 1994 A
5369857 Sacherman et al. Dec 1994 A
5371679 Abe et al. Dec 1994 A
5381486 Ludeke et al. Jan 1995 A
5386494 White Jan 1995 A
5389917 LaManna et al. Feb 1995 A
5393239 Ursich Feb 1995 A
5399102 Devine Mar 1995 A
5406037 Nageno et al. Apr 1995 A
5410141 Koengk et al. Apr 1995 A
5432510 Matthews Jul 1995 A
5438626 Neuman et al. Aug 1995 A
5438698 Burton et al. Aug 1995 A
5446788 Lucey et al. Aug 1995 A
5456611 Henry et al. Oct 1995 A
5462452 Devine Oct 1995 A
5469505 Gattey et al. Nov 1995 A
5478252 Lecomte et al. Dec 1995 A
5479001 Kumar Dec 1995 A
5480313 d'Alayer de Costemore d'Arc Jan 1996 A
5481645 Bertino et al. Jan 1996 A
5491651 Janik Feb 1996 A
5501571 Van Durrett et al. Mar 1996 A
5504485 Landt et al. Apr 1996 A
5510795 Koelle Apr 1996 A
5514861 Swartz et al. May 1996 A
5515303 Cargin, Jr. et al. May 1996 A
5521601 Kandlur et al. May 1996 A
5535437 Karl et al. Jul 1996 A
5550547 Chan et al. Aug 1996 A
5553312 Gattey et al. Sep 1996 A
5555490 Carroll Sep 1996 A
5555554 Hofer et al. Sep 1996 A
5572401 Carroll Nov 1996 A
5579400 Ballein Nov 1996 A
5581492 Janik Dec 1996 A
5604050 Brunette et al. Feb 1997 A
5607792 Garcia et al. Mar 1997 A
5610387 Bard et al. Mar 1997 A
5637417 Engmark et al. Jun 1997 A
5639256 Endo et al. Jun 1997 A
5665485 Kuwayama et al. Sep 1997 A
5671037 Ogasawara et al. Sep 1997 A
5673037 Cesar et al. Sep 1997 A
5677834 Mooneyham Oct 1997 A
5680465 Boyden Oct 1997 A
5698834 Worthington et al. Dec 1997 A
5716730 Deguchi Feb 1998 A
5719743 Jenkins et al. Feb 1998 A
5719744 Jenkins et al. Feb 1998 A
5729697 Schkolnick et al. Mar 1998 A
5748841 Morin et al. May 1998 A
5757339 Williams et al. May 1998 A
5762512 Trant et al. Jun 1998 A
5763867 Main et al. Jun 1998 A
5766794 Brunette et al. Jun 1998 A
5774096 Usuki et al. Jun 1998 A
5777561 Chieu et al. Jul 1998 A
5781644 Chang Jul 1998 A
5787361 Chen Jul 1998 A
5793878 Chang Aug 1998 A
5803750 Purington et al. Sep 1998 A
5812977 Douglas Sep 1998 A
5825045 Koenck et al. Oct 1998 A
5828693 Mays et al. Oct 1998 A
5832098 Chen Nov 1998 A
5832430 Lleida et al. Nov 1998 A
5839104 Miller et al. Nov 1998 A
5841630 Seto et al. Nov 1998 A
5841859 Chen Nov 1998 A
5844824 Newman et al. Dec 1998 A
5850181 Heinrich et al. Dec 1998 A
5850187 Carrender et al. Dec 1998 A
5856038 Mason Jan 1999 A
5857148 Weisshappel et al. Jan 1999 A
5862241 Nelson Jan 1999 A
5869204 Kottke et al. Feb 1999 A
5873070 Bunte et al. Feb 1999 A
5884265 Squitteri et al. Mar 1999 A
5890074 Rydbeck et al. Mar 1999 A
5890123 Brown et al. Mar 1999 A
5892813 Morin et al. Apr 1999 A
5895729 Phelps, III et al. Apr 1999 A
5903870 Kaufman May 1999 A
5905632 Seto et al. May 1999 A
5909667 Leontiades et al. Jun 1999 A
5912632 Dieska et al. Jun 1999 A
5920261 Hughes et al. Jul 1999 A
5931513 Conti Aug 1999 A
5933330 Beutler et al. Aug 1999 A
5934911 Stout et al. Aug 1999 A
5935729 Mareno et al. Aug 1999 A
5941726 Koegel et al. Aug 1999 A
5941729 Sri-Jayantha Aug 1999 A
5942987 Heinrich et al. Aug 1999 A
5945235 Clanton et al. Aug 1999 A
5950167 Yaker Sep 1999 A
5956675 Setlur et al. Sep 1999 A
5962837 Main et al. Oct 1999 A
5966082 Cofino et al. Oct 1999 A
5974384 Yasuda Oct 1999 A
5984709 Zink et al. Nov 1999 A
5991085 Rallison et al. Nov 1999 A
5991726 Immarco et al. Nov 1999 A
5993246 Moldenhauer et al. Nov 1999 A
5995019 Chieu et al. Nov 1999 A
5999085 Szwarc et al. Dec 1999 A
6002918 Heiman et al. Dec 1999 A
6012030 French-St. George et al. Jan 2000 A
6016347 Magnasco et al. Jan 2000 A
6021207 Puthuff et al. Feb 2000 A
6022237 Esh Feb 2000 A
6032127 Schkolnick et al. Feb 2000 A
6036093 Schultz Mar 2000 A
6044347 Abella et al. Mar 2000 A
6051334 Tsurumaru et al. Apr 2000 A
6056199 Wiklof et al. May 2000 A
6060193 Remes et al. May 2000 A
6062891 Villiers May 2000 A
6071640 Robertson, Jr. et al. Jun 2000 A
6075857 Doss, Jr. et al. Jun 2000 A
6078251 Landt et al. Jun 2000 A
6078825 Hahn et al. Jun 2000 A
6084556 Zwem Jul 2000 A
6085428 Casby et al. Jul 2000 A
6091546 Spitzer Jul 2000 A
6097301 Tuttle Aug 2000 A
6101260 Jensen et al. Aug 2000 A
6104281 Heinrich et al. Aug 2000 A
6109526 Ohanian et al. Aug 2000 A
6114625 Hughes et al. Sep 2000 A
6120932 Slipy et al. Sep 2000 A
6122329 Zai et al. Sep 2000 A
6127990 Zwem Oct 2000 A
6127999 Mizutani Oct 2000 A
6136467 Phelps, III et al. Oct 2000 A
6137686 Saye Oct 2000 A
6137868 Leach Oct 2000 A
6137879 Papadopoulos et al. Oct 2000 A
6149451 Weber Nov 2000 A
6154669 Hunter et al. Nov 2000 A
6157533 Sallam et al. Dec 2000 A
6160702 Lee et al. Dec 2000 A
6164853 Foote Dec 2000 A
6167413 Daley, III Dec 2000 A
6171138 Lefebvre et al. Jan 2001 B1
6172596 Cesar et al. Jan 2001 B1
6173266 Marx et al. Jan 2001 B1
6179192 Weinger et al. Jan 2001 B1
6185535 Hedin et al. Feb 2001 B1
6188985 Thrift et al. Feb 2001 B1
6190795 Daley Feb 2001 B1
6195053 Kodukula et al. Feb 2001 B1
6199044 Ackley et al. Mar 2001 B1
6204765 Brady et al. Mar 2001 B1
6225777 Garcia et al. May 2001 B1
6226622 Dabbiere May 2001 B1
6229694 Kono May 2001 B1
6230029 Hahn et al. May 2001 B1
6233559 Balakrishnan May 2001 B1
6233560 Tannenbaum May 2001 B1
6235420 Ng May 2001 B1
6237051 Collins May 2001 B1
6243682 Eghtesadi et al. Jun 2001 B1
6246989 Polcyn Jun 2001 B1
6261715 Nakamura et al. Jul 2001 B1
6266641 Takaya Jul 2001 B1
6286763 Reynolds et al. Sep 2001 B1
6302454 Tsurumaru et al. Oct 2001 B1
6304430 Laine et al. Oct 2001 B1
6304436 Branch et al. Oct 2001 B1
6304459 Toyosato et al. Oct 2001 B1
6310888 Hamlin Oct 2001 B1
6318636 Reynolds et al. Nov 2001 B1
6321198 Hank et al. Nov 2001 B1
6324053 Kamijo Nov 2001 B1
6325507 Jannard et al. Dec 2001 B1
6326543 Lamp et al. Dec 2001 B1
6327152 Saye Dec 2001 B1
6339764 Livesay et al. Jan 2002 B1
6349001 Spitzer Feb 2002 B1
6353313 Estep et al. Mar 2002 B1
6356635 Lyman et al. Mar 2002 B1
6357534 Buetow et al. Mar 2002 B1
6357662 Helton et al. Mar 2002 B1
6359603 Zwem Mar 2002 B1
6359777 Newman et al. Mar 2002 B1
6359995 Ou Mar 2002 B1
6364675 Brauer et al. Apr 2002 B1
6369952 Rallison et al. Apr 2002 B1
6371535 Wei et al. Apr 2002 B2
6373693 Seto et al. Apr 2002 B1
6373942 Braund Apr 2002 B1
6374126 MacDonald, Jr. et al. Apr 2002 B1
6376942 Burger et al. Apr 2002 B1
6384591 Estep et al. May 2002 B1
6384712 Goldman et al. May 2002 B1
6384982 Spitzer May 2002 B1
6386107 Rancourt May 2002 B1
6394278 Reed May 2002 B1
6404325 Heinrich et al. Jun 2002 B1
6422476 Ackley Jul 2002 B1
6424357 Frulla et al. Jul 2002 B1
6429775 Martinez et al. Aug 2002 B1
6434251 Jensen et al. Aug 2002 B1
6434526 Cilurzo et al. Aug 2002 B1
6438523 Oberteuffer et al. Aug 2002 B1
6445175 Estep et al. Sep 2002 B1
6454608 Kitahara et al. Sep 2002 B1
6486769 McLean Nov 2002 B1
6496799 Pickering Dec 2002 B1
6500581 White et al. Dec 2002 B2
6501807 Chieu et al. Dec 2002 B1
6504914 Brademann et al. Jan 2003 B1
6509546 Egitto et al. Jan 2003 B1
6511770 Chang Jan 2003 B2
6523752 Nishitani et al. Feb 2003 B2
6525648 Kubler et al. Feb 2003 B1
6529880 McKeen et al. Mar 2003 B1
6532148 Jenks et al. Mar 2003 B2
6560092 Itou et al. May 2003 B2
6574672 Mitchell et al. Jun 2003 B1
6581782 Reed Jun 2003 B2
6595420 Wilz, Sr. et al. Jul 2003 B1
6597465 Jarchow et al. Jul 2003 B1
6607134 Bard et al. Aug 2003 B1
6608551 Anderson et al. Aug 2003 B1
6628509 Kono Sep 2003 B2
6639509 Martinez Oct 2003 B1
6658130 Huang Dec 2003 B2
6660427 Hukill et al. Dec 2003 B1
6663410 Revis Dec 2003 B2
6677852 Landt Jan 2004 B1
6697465 Goss Feb 2004 B1
6710701 Leatherman Mar 2004 B2
6731771 Cottrell May 2004 B2
6743535 Yoneyama Jun 2004 B2
6745014 Seibert et al. Jun 2004 B1
6749960 Takeshita et al. Jun 2004 B2
6754361 Hall et al. Jun 2004 B1
6754632 Kalinowski et al. Jun 2004 B1
6769762 Saito et al. Aug 2004 B2
6769767 Swab et al. Aug 2004 B2
6772454 Barry et al. Aug 2004 B1
6778676 Groth et al. Aug 2004 B2
6811088 Lanzaro et al. Nov 2004 B2
6812852 Cesar Nov 2004 B1
6816063 Kubler et al. Nov 2004 B2
6826532 Casby et al. Nov 2004 B1
6830181 Bennett Dec 2004 B1
6847336 Lemelson et al. Jan 2005 B1
6853294 Ramamurthy et al. Feb 2005 B1
6859134 Heiman et al. Feb 2005 B1
6872080 Pastrick et al. Mar 2005 B2
6890273 Perez May 2005 B1
6909546 Hirai Jun 2005 B2
6915258 Kontonassios Jul 2005 B2
6934675 Glinski et al. Aug 2005 B2
6965681 Almqvist Nov 2005 B2
6971716 DePaulis et al. Dec 2005 B2
6982640 Lindsay et al. Jan 2006 B2
7003464 Ferrans et al. Feb 2006 B2
7028265 Kuromusha et al. Apr 2006 B2
7052799 Zatezalo et al. May 2006 B2
7063263 Swartz et al. Jun 2006 B2
7082393 Lahr Jul 2006 B2
7085543 Nassimi Aug 2006 B2
7099464 Lucey et al. Aug 2006 B2
7110800 Nagayasu et al. Sep 2006 B2
7110801 Nassimi Sep 2006 B2
7143041 Sacks et al. Nov 2006 B2
7145513 Cohen Dec 2006 B1
7146323 Guenther et al. Dec 2006 B2
7216351 Maes May 2007 B1
7228429 Monroe Jun 2007 B2
7257537 Ross et al. Aug 2007 B2
7319740 Engelke et al. Jan 2008 B2
7346175 Hui et al. Mar 2008 B2
7369991 Manabe et al. May 2008 B2
7398209 Kennewick et al. Jul 2008 B2
7413124 Frank et al. Aug 2008 B2
7487440 Gergic et al. Feb 2009 B2
7496387 Byford et al. Feb 2009 B2
7519196 Bech Apr 2009 B2
7604765 Sugimoto et al. Oct 2009 B2
7619524 Calvarese Nov 2009 B2
8161910 Cairo, Sr. et al. Apr 2012 B2
20010017926 Vicamini Aug 2001 A1
20010034565 Leatherman Oct 2001 A1
20010046305 Muranami et al. Nov 2001 A1
20020003889 Fischer Jan 2002 A1
20020015008 Kishida et al. Feb 2002 A1
20020021551 Kashiwagi Feb 2002 A1
20020044058 Heinrich et al. Apr 2002 A1
20020076060 Hall et al. Jun 2002 A1
20020131616 Bronnikov et al. Sep 2002 A1
20020178344 Bourguet et al. Nov 2002 A1
20030095525 Lavin et al. May 2003 A1
20030130852 Tanaka et al. Jul 2003 A1
20030233165 Hein et al. Dec 2003 A1
20040024586 Andersen Feb 2004 A1
20040063475 Weng Apr 2004 A1
20040091129 Jensen et al. May 2004 A1
20040220686 Cass Nov 2004 A1
20050010418 McNair et al. Jan 2005 A1
20050095899 Mellott et al. May 2005 A1
20050230388 Wu Oct 2005 A1
20050272401 Zatezalo et al. Dec 2005 A1
20060044112 Bridgelall Mar 2006 A1
20070080930 Logan et al. Apr 2007 A1
20070221138 Mainini et al. Sep 2007 A1
20070257795 Overhultz Nov 2007 A1
20080030320 Wilcox et al. Feb 2008 A1
20080072847 Liao Mar 2008 A1
20100127875 Wong May 2010 A1
20100171592 Kamemaru Jul 2010 A1
20100328076 Kyle Dec 2010 A1
20110090062 Hofer et al. Apr 2011 A1
Foreign Referenced Citations (9)
Number Date Country
41 38 886 Apr 1993 DE
0 732 817 Sep 1996 EP
1 383 029 Jan 2004 EP
1 531 418 May 2005 EP
2 242 099 Sep 1991 GB
0041543 Jul 2000 WO
02069320 Sep 2002 WO
2005008476 Jan 2005 WO
2007044755 Apr 2007 WO
Non-Patent Literature Citations (2)
Entry
Nov. 7, 2011 Search Report issued in International Patent Application No. PCT/US2011/043854.
Sep. 27, 2016 Search Report issued in European Patent Application No. 16168795.9.
Related Publications (1)
Number Date Country
20170004334 A1 Jan 2017 US
Continuations (3)
Number Date Country
Parent 14577037 Dec 2014 US
Child 15269358 US
Parent 14188312 Feb 2014 US
Child 14577037 US
Parent 12841798 Jul 2010 US
Child 14188312 US