# Patent

## Title
Radio frequency identification tag location estimation and tracking system and method

## Abstract

Systems and methods for locating one or more radio frequency identification (RFID) tags are provided. A phase difference of received information signals of illuminated RFID tags is utilized to locate the RFID tags. One or more exciters transmit interrogation signals to illuminate the RFID tags in which the exciters may have a plurality of antenna selectively configured to transmit through two or more antennas and to receive on one antenna. Multiple reads of the same RFID tag can also be performed to generate a probability model of the location of the RFID tag. An enhanced particle filter is applied to probability model to determine the exact location of the RFID.

## Background
CROSS REFERENCE TO RELATED APPLICATIONS
This application is a continuation of U.S. application Ser. No. 13/309,329, filed Dec. 1, 2011, which is a continuation of U.S. application Ser. No. 12/423,796 filed Apr. 14, 2009 which claims the benefit of U.S. Provisional Patent Application No. 61/124,294, filed Apr. 14, 2008 and U.S. Provisional Patent Application No. 61/044,904, filed Apr. 14, 2008, the disclosures of which are hereby incorporated by reference as if set forth in full herein.


BACKGROUND
This application relates to estimating location and tracking of passive or active sensors and in particular is related to using phased array antenna systems and Radio Frequency Identification (RFID) system to locate sensors and/or RFID tags.
An RFID system conventionally includes a set of stationary or mobile RFID tags typically manipulated by a reader/interrogator system. Each sensor may be passive or active, i.e., with or without a battery. In conventional systems, the reader and the RFID tags are generally required to be in close proximity so that the tags can operate in close proximity to the reader antenna.
The limited transmission distances available with conventional RFID systems limit their use in an automated factory setting and/or in an indoor wireless environment. Even within the designed range of operation, such systems often have low reliability due to interferences and collisions.
Typical RFID systems also are not designed to cover extremely large areas as multiple base stations are needed to provide sufficient coverage for the area. This can be extremely expensive and thus cost prohibitive. Also, sacrifices are made to compensate for the large area by limiting the coverage area to select high use regions, e.g., at dock doors. Additionally, such systems often do not provide precise location determinations of the RFID due to the complexity in the size and space of the environment. Accordingly, there is a need for a RFID system that overcomes the above-noted obstacles and the shorting comings in the art.
SUMMARY
In one aspect, the location of RFID tags/sensors is determined using both single and multiple read points.
In one embodiment, a method of locating one or more radio frequency identification (RFID) tags comprises illuminating at least one RFID tag by an exciter; receiving information signals from the illuminated at least one RFID tag by a plurality of receive antennas; determining a phase derivate for the received information signals from the at least one illuminated RFID tag received by each of the plurality of receive antennas; and identifying a location of the at least one RFID tag based on the determined phase derivates of the received information signals. Also, in one embodiment, the method further includes identifying the location of the at least one RFID based on a ratio of the phase derivate versus the frequency derivate.
In another embodiment, a radio frequency identification (RFID) system for locating one or more RFIDs comprises at least one exciter and a reader. The at least one exciter has a plurality of antennas and is configured to selectively transmit interrogation signals through at least two of the plurality of antennas and to selectively receive information signals from at least one RFID tag through one of the plurality of antennas different from the at least two of the plurality of antennas. The reader is in communication with the at least one exciter and is configured to activate the at least one exciter. The reader locates the at least one RFID tag based on a phase derivate of the received information signals.
In yet another embodiment, a radio frequency identification (RFID) system for locating one or more RFIDs comprises at least one RFID tag, an antenna array, a transmitter and a reader. The antenna array is configured to illuminate the at least one RFID tag. The transmitter is coupled to the antenna array and is configured to activate the antenna array to repeatedly illuminate the at least one RFID tag within a specific time frame and a specific space. The reader is in communication with the transmitter and is configured to generate a probability model based on information signals received from the repeated illumination of the at least one RFID tag and the reader applies a particle filter on the generated probability model to determine a location of the at least one RFID tag based on a result of the applied particle filter.
In a further embodiment, a method of locating one or more radio frequency identification (RFID) tags comprises positioning at least one receiver and at least one transmitter to share a geometric characteristic with each other; determining location measurements based on received information signals from at least one RFID tag illuminated by the at least one transmitter; and estimating a location of the at least one RFID tag utilizing a probability model and the determined location measurements.
For a more complete understanding of the disclosed method and system, reference is now made to the following description taken in conjunction with the accompanying drawings.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a schematic diagram of a distributed exciter architecture showing TX and receive coverage areas for two readers as well as exciter interrogation spaces in accordance with various aspects of the present invention.
FIG. 2 is a schematic diagram of a distributed exciter architecture showing TX and receive coverage areas for two readers as well as exciter interrogation spaces in accordance with various aspects of the present invention.
FIG. 3 is a distributed exciter architecture cabled (single) system showing TX and receive coverage areas for the reader as well as exciter interrogation spaces in accordance with various aspects of the present invention.
FIGS. 4A-B illustrate an exciter layout and an exemplary frequency plan in accordance with various aspects of the present invention.
FIG. 5 graphically illustrates an algorithm for estimation of the angle of arrival from the received signal in accordance with various aspects of the present invention.
FIG. 6 is a block diagram of a reader system showing RFID Tags, Interferer sources, and the reader (i.e., transmit, and receive chain) in accordance with various aspects of the present invention.
FIG. 7 is a functional block diagram of the reader showing an Antenna array, RF/IF, signal processing and synthesizer subsystem in accordance with various aspects of the present invention.
FIG. 8 is a graphical representation illustrating a reader array and a single excitation point topology in accordance with various embodiment of the present invention.
FIGS. 9A-9C are graphical representations providing elliptical representations for determining the location an RFID tag in accordance with various embodiments of the invention.
FIG. 10 is a block diagram of a four port excitation node in accordance with various embodiments of the invention.
FIG. 11 is a detailed block diagram of a four port excitation node in accordance with various embodiments of the invention.
FIG. 12 is a graphical representation illustrating a distributed array of readers and a single excitation point topology in accordance with various embodiments of the invention.
FIG. 13A-D is a graphical representation illustrating a four port excitation node in a chandelier configuration in accordance with various embodiments of the invention.
FIG. 14A-D is a graphical representation illustrating a four port excitation node in an offset linear array configuration in accordance with various embodiments of the invention.
FIG. 15A-F is a graphical representation illustrating a four port excitation node in an offset linear array configuration relative to six different RFID tag locations in accordance with various embodiments of the invention.
FIG. 16 is a graphical representation illustrating a generalized multi-port excitation node, or array of nodes, in an arbitrary or irregular configuration in accordance with various embodiments of the invention.
FIG. 17 is a flow chart of a particle filter location procedure for locating a RFID tag in accordance with various embodiments of the invention.
FIGS. 18-19 are flow diagrams providing an overview of location estimation performed by a reader in accordance with various aspects of the present invention.
FIG. 20 graphically illustrates a simplified four-element array in a 2D implementation in accordance with various aspects of the present invention.
FIG. 21 graphically illustrates an analysis setup for DOA analysis showing RFID Tag, and antenna in accordance with various aspects of the present invention.
FIG. 22 is an interrogation space viewed as a two dimensional Gaussian density with a known mean and variance in two dimensional (x,y) Euclidean space in accordance with various aspects of the present invention.
FIG. 23 illustrates a Markov chain assumption in accordance with various aspects of the present invention.
FIG. 24 is a flow diagram illustrating steps of the general form of sequential Monte Carlo methods in accordance with various aspects of the present invention.
FIG. 25 is a flow diagram illustrating steps for the general solution to finding the location of the RFID tag/sensor in accordance with various aspects of the present invention.
FIG. 26 is a flowchart of a Differential and Genetic evolution methodology in accordance with various aspects of the present invention.
FIG. 27 is a conceptual illustration showing application of autonomous perpetual inventory to items stored on vertically racked shelves.



DETAILED DESCRIPTION
Referring now to the drawings, systems and methods for locating one or more radio frequency identification (RFID) tags are described. The systems utilize various transmitter and receiver geometries to obtain observations relevant to the location of RFID tags. The observations can be provided to any of a variety of estimators that can generate estimates for the location of the observed RFID tags.
The transmitter and receiver geometry of an RFID system influences the accuracy with which the system can estimate the location of RFID tags. Various architectures in accordance with embodiments of the invention are discussed. In a number of embodiments, one or more exciters transmit interrogation signals to illuminate the RFID tags and the reflected signals are received by a plurality of receivers. The receivers can be separate receivers and/or can be separate receiver antennas connected to a single receiver system or a multiple port exciter system. In several embodiments, a multiple port exciter system acts as both the exciter and the receiver. One of the antennas is selectively configured to transmit interrogation signals and the remaining antennas are configured to receive signals backscattered by RFID tags. In a number of embodiments, the multiport exciters do not possess the ability to read data from RFID tags and simply possess the ability to make observations useful in locating the RFID tags.
Due to instability in the RFID backscatter process, the observables that are chosen when performing location estimation can influence the accuracy of the resulting estimates. In various embodiments, the system observes the phase difference of backscattered signals from illuminated RFID tags. In several embodiments, the phase differences are observed at different transmit frequencies to provide range information. The ratio of phase difference to frequency difference is also referred to as group delay. In many embodiments, the system observes the read rate of RFID tags in response to illumination of different interrogation spaces by various exciters. The read rate is the number of times that a tag is read as a ratio of the number of opportunities that the tag had to be read. In systems that utilize extremely sensitive receivers, read rate can be considered indicative of the distance from the RFID tag to the exciter. In such systems, the overwhelming majority of tags that are activated by an exciter are read. Therefore, read rate is largely indicative of the rate of activation of the RFID tag by the transmitter.
As is discussed further below, a variety of techniques can be used to estimate location based upon one or more observables in accordance aspects of the invention. Given the complexity of the system and the numerous RFID tags potentially in a given space, statistical modeling of the RFID tag locations can provide accurate location estimates for each RFID tag within the space. As such, in various embodiments, by using many observations of the RFID tags, a probability distribution model is created. Using one or more algorithms and/or filters, the model is further refined to determine the location to the RFID tag. In several embodiments, a particle filter is utilized to create and refine the probability distribution model. In other embodiments, a variety of other techniques can be used to refine the location estimates obtained using the observables.
System Architectures
The ability to locate RFID tags within a given space is largely dependent upon the location of the antennas used to transmit interrogation signals to the RFID tags and the antennas used to receive signals backscattered by the RFID tags. A variety of geometries can be used in accordance with embodiments of the invention including geometries in which the transmit and receive functions are decoupled and can be performed by separate exciters and receivers.
In a co-pending patent U.S. patent application Ser. No. 12/054,331, filed Mar. 23, 2007, entitled “RFID Systems Using Distributed Exciter Network”, the disclosure of which incorporated by reference as if set forth in full herein, enhancement in the performance and capacity for RFID systems is achieved by separating the receive and transmit systems to manipulate the passive RFID tags. This functionality is realized by decomposing the population of RFID tags/sensors into a set of interrogation spaces (1-16, 1-32, 1-38, 1-44, 1-40, 1-28, 1-24, 1-48, 1-54, 1-56) where an exciter is placed for each target interrogation space (1-18, 1-34, 1-36, 1-46, 1-42, 1-30, 1-26, 1-58, 1-52, 1-50) as shown in FIGS. 1-2.
The size of each interrogation space can be adjusted by controlling the total emitted power from the exciter. However, it should be appreciated that emitted power of an RFID system is typically restricted by regulation and limits the interrogation range of an exciter, e.g., 20 to 30 feet. Emitter power control is implemented through the RFID reader's (1-2) exciter power management and gain controller subsystem (3-18, 3-30). In addition to adjusting the size of each interrogation space, the overall performance of the system may be further improved by selecting each exciter transmit antenna type to provide a desired level of directivity, thereby controlling the beam-width for the target interrogation space.
In a number of embodiments, the reader includes phased-array antenna that is capable of performing beam forming. The reader receive phased-array antenna beam (1-4) can be formed to focus (1-17, 1-21) to specified interrogation spaces or as a wide beam (1-20). The network of transmit antennas, also referred to as distributed exciters may be commanded by wired (2-24,2-30, 2-36, 2-12,2-56) or wireless links. The transmitted “backhaul signal” from the controller to the exciter embeds all the necessary signal characteristics and parameters to generate the desired waveform output from the exciter module to the tag. FIGS. 1 and 2 also show the RFID application management and operations server (1-7, 2-51), which is connected to the reader via the local area network (1-11, 2-50).
FIG. 3 illustrates the layout of a distributed exciter/transmitter RFID systems, showing the receive system (3-2), receive antenna array (3-4), and distributed exciters (3-6, 3-14, 3-18, 3-24 & 3-30), which in one aspect are connected to the system via coaxial cables (3-10, 3-9, 3 -16, 3-22, & 3-26). The interrogation space and transmitted power of each exciter is managed and controlled by the central unit (3-2). In FIG. 3, exciter interrogation spaces (3-8, 3-15, 3-20, 3-23, & 3-28) with different sizes are depicted. The complete receive array coverage area (3-11) is also shown. Each interrogation space (3-8, 3-14, 3-20, 3-22, 3-28) can be operated sequentially or concurrently, depending on the number of possible beams the receiving array supports.
The controller (3-30) in the system (3-2) schedules each exciter to operate in the time, frequency and space dimensions. The scheduler for S/T/FDM (Space, Time and Frequency Division Multiplexing) utilizes an optimization algorithm to maximize the probability of reading all the tags within a target interrogation space. The controller may utilize frequency hopping (while satisfying regulatory requirements) to schedule frequency channel use for each exciter. FIGS. 4A-B illustrate an example of the exciter layout (4-6) and the time line (4-4) showing the assigned frequency channels (4-8). The timeline (4-4) depicts frequency-hopped channelization in the 900 MHz ISM band (4-10). On each timeline, a different hopping sequence effectively assigns a distinct series of random frequencies to each active exciter (4-8). The algorithms described in FIG. 14, manage and optimize this activity. As different exciters are activated in accordance with the schedule, the RFID system can collect observations concerning the RFID tags. In many embodiments, the schedule provides an important role in preventing interference from multiple exciters during the collection of observations. As is discussed further below, the ability to utilize different excitation frequencies in the schedule enables the RFID system to collect observations concerning the group delay of different RFID tags.
Referring back to FIG. 1, a wireless exciter layout and deployment system is shown. In the illustrated embodiment, two RFID systems (1-2, 1-14) are provided. Each system has separate receive (1-4, 1-12) and transmit antennas (1-6, 1-13). The transmit antenna radiates a forward link to the exciter, while the receive antenna array receives the signal from the tags, within the interrogation space of each exciter. The forward link in one aspect carries additional information such as an exciter identification (ID) number, command, control and management information. The figure shows the receive coverage areas for two systems (1-22, 1-20). As noted in the figure, the system supports receive interrogation spaces (1-24, 1-48, 1-28, 1-40, 1-54, 1-56, 1-44, 1-16, 1-32, 1-38). The overlap region between the receive coverage areas (1-22, 1-20) is managed through receive array beam-forming and frequency or time coordination of exciter operations. The two systems are connected to the LAN (1-3, 1-8, 1-9) in a way that is similar to the wired exciter systems of FIG. 2, the wireless exciter management server (1-7) interfaces with the two systems (1-2, 1-14) through the LAN and manages the operations of the exciters that includes control, command, coordination, and calibration of the exciters as well as optimization of the interrogation spaces.
Interrogation of RFID Tags
A sensor or an RFID tag can be interrogated many times over a fixed time interval. For each of these interrogations, sensor data or information embedded in RFID tags may be detected by combining the impinging signal on the array to form a single (beamformed) signal for detecting the sequence of symbols transmitted by the RFID tag. Each interrogation round is comprised typically of multiple (e.g. two, referred to as RN16 and EPC packet) packets from a cingulated RFID tag. The payload in these packets typically contain a temporary address (e.g. a random 16-bit number in an RN16 type packet), once acknowledged, the tag may then transmit a packet with its information content (e.g. an Electronic Product Code (EPC)).
Multiple RFID tag interrogation signals can be transmitted at different frequencies during each interrogation round. Interrogating a tag using different frequencies enables additional observation of the tag to accurately model the received signal phase and amplitude trajectories over time, and characterize the signal dispersion with multipath reflections of the transmitted signal.
Overview of Use of Interrogation Results in Location Estimation
During an interrogation round, processing operations may include but are not limited to: estimating the relative phase difference between the signals from each of the antenna elements and the reference signal and deriving the relative range from each of the antenna elements to the RFID tag in accordance with the adjusted phase delay difference for each such antenna element. Estimating the location of the RFID tag may then be dealt with by treating the aggregate interrogation rounds as a single data base forming a “sample space”. It is also noted that reading the same RFID tag at multiple frequencies enables an estimation of the range (distance of the tag to the read point) of the signal source via “sequential ranging”. For applications where only a single reader (read point) is deployed, the reader system is able to provide location estimation without the need to “triangulate”.
Processing the signals may include deriving the adjusted phase difference between the signals from each of the other antenna elements and the reference signal, and deriving relative direction of arrival of the received signals from the RFID tag at each of the antenna elements. The direction of arrival of a signal from a single RFID tag at multiple read points may be used to further improve the estimate of the location of the RFID tag. This can be performed by combining the relative direction of arrival information derived from signals received at each array element at each read point. By using multiple interrogation cycles and arrays, each multiplicity of the number of read points in time results in a further enhancement of the overall estimate of the location of the tag.
The iterating procedure with multiple read points may include combining the RFID tag information derived from a plurality of iterations to form a probability distribution of the location of the tag, and applying an algorithm to estimate and mitigate the effects of the multipath in the direction of arrival of the signal from the source to each antenna element.
An algorithm for estimation of the angle of arrival from the received signal in a system described in FIG. 5 is addressed in co-pending U.S. patent application Ser. No. 11/770,712, filed Jun. 28, 2007, the disclosure of which is incorporated by reference above. In the application, the method by which the discrete time sampled signal from each received packet from the tag is used to estimate the AOA, using the relative phase and amplitudes of the received signal from each antenna element, is described. The algorithm described in FIG. 5, takes an FFT (5-14) of the array input (5-16), followed by cross spectral matrix computation (5-12), decomposition process (5-10), and computation of the beam steering response (5-8). The steering response computation (5-8) uses the steering vector data (5-6), which is generated and controlled using array response and calibration data base (5-2, 5-7). The beam steering response computation (5-8) is repeated for different directions by changing the cross spectral matrix (5-12).
To handle practical challenges induced by electronic components used in the radio frequency circuit of the antenna array, among other challenges, each antenna element is periodically calibrated in order to eliminate relative phase and amplitude imbalances for each antenna element and its respective in-phase and quadrature components. The calibration is performed for one or more test signals and the processing of the signals received by each antenna element may be corrected to compensate for such imbalances.
In one embodiment, where an exciter location is not known or to ensure the exciter's location has not moved, a calibration sequence occurs prior to or at various times in a location estimation procedure to determine the exciter or a dummy RFID tag location. In one embodiment, the exciter or dummy RFID tag location is determined by the RFID receiver system similar to the location estimation of the “actual” RFID tag.
A radio frequency identification system reader in one embodiment is provided employing an antenna array. In the forward channel (the transmission path between the reader and the tag), the transmit antenna array may be distributed across several physical arrays. In the case of a distributed transmit antenna, the receive antenna array can capture the impinging energy from the tag signal excited by the antenna elements of a distributed array. This approach may use spatial multiplexing to provide substantial bandwidth utilization enhancements over single antenna systems. The antenna array may support multiple frequency bands. A typical array element configuration includes an aperture-coupled feed tiled patch antenna. The tiled construction includes a matrix of identical elements in a two-dimensional plane. A low-noise amplifier (LNA) may be embedded in the antenna element itself to enhance the overall performance of the system.
For cases in which a transmit array antenna is used, beam forming can be employed to steer the transmitted beam to a desired location in space. This beam steering reduces the collisions and interference between the signals received from responding tags. Various transmission policies may be adopted, as an example: the transmit beamformer coefficients may be updated every time-slot to inject a “space hopping” pattern to maximize the received isotropic power to the RFID tags, while satisfying regulatory constraints for the maximum amount of power and dwell time.
Through periodical calibrations, the beam former may compensate for mismatches and imperfections of RF microwave devices in the front end (between the antenna and analog-digital converters (ADCs) for the receive path and between the digital-analog converters (DACs) and the antenna for the transmit path) as well as mismatches in phase and amplitude from RF-to-baseband from multiple independent parallel array element paths.
Referring now to FIG. 6, a RFID reader interrogating a group of RFID tags placed on a number of inventory items as arranged on a pallet in accordance with an embodiment of the invention is shown. The RFID system operates in the presence of interference from an exemplary interferer 6-10. The pallet of goods 6-1 includes many cases or items tagged with RFID passive tags. A transmitted interrogation signal 6-4 from an antenna 6-6 impinges upon the pallet 6-1. In response to the signal energy detected by each tag, each tag may backscatter a sequence of information using the power received from the transmitted interrogation signal or beam 6-4. In the environment, there may be man-made or natural interferences illustrated as an interferer 6-10. The receive antenna array 6-12 applies beam forming to the backscatter signal from the tag so that the received power from the tag is maximized and the power received by antenna 6-6 from the interferer 6-10 is minimized.
In FIG. 7, a functional block diagram of a reader system (e.g., FIG. 6) including an antenna array subsystem (17-1), an RF/IF subsystem (17-2), and a signal processing subsystem (17-3) is shown. Also, a synthesizer subsystem (17-4) provides the clocks and local frequencies to RF/IF subsystem of the reader system. The reader system interrogates the RFID tags on the pallet 1-1 (e.g., FIG. 1) in the presence of interference.
Antenna Geometries
RFID systems can include multiple transmit antennas and multiple receive antennas. In a distributed exciter architecture, the multiple transmit antennas are the antennas of exciters. As will be discussed below, the multiple receive antennas can be the antenna array of an RFID receiver and/or the antennas of a multiport exciter switched to make observations for the purpose of location estimation. When collecting observations for the purpose of estimating RFID tag location, the number and position of the receive antennas relative to the exciter and relative to each other can materially impact the accuracy with which any individual observation can be made. Therefore, the geometry of the transmitter and receiver antennas can impact the number of antennas required for an application with a specified location estimation precision requirement.
Linear Arrays
Referring now to FIGS. 8-9C, a reader array 18-1 relative to a single exciter 18-3 and RFID tag 18-2 is shown. The reader array is a linear array including four antennas providing four reception points. Each antenna is offset relative to each other. The exciter is positioned a specific distance d1 from the reader array and also a specific distance d2 relative to a RFID tag. The RFID tag is also located a specific distance d3 relative to the reader array.
Observations Using Receiver Arrays
In FIGS. 9A-9C, observation of the location of an RFID tag utilizing calibrated slope of the group delay as a proxy for distance from the RFID receiver system to the exciter (d1) from the exciter to the RFID tag (d2) and from the RFID tag back to the RFID receiver system (d3) in accordance with an embodiment of the invention is shown. Group delay observations are discussed in greater detail below, but can be assumed here as providing an estimate of the path length between a transmit antenna, an RFID tag and a receive antenna. An ellipse is a locus of points in a plane such that the sum of the distances to two fixed points is a constant. Such is exactly the case when the distance between a reader and exciter is known (d1) and the sum of the distances d2+d3 is known. By way of calibration we are able to determine the time (distance) between the reader (noted by a star) and an exciter (noted by a diamond). We are also able to determine the sum of times d1+d2+d3. These two distance measurements together (d1 and d1+d2+d3) imply that the tag must be somewhere on the ellipse 18-4. Note that there is a degenerate case wherein 2*d1=d1+d2+d3. This indicates that the tag is somewhere on the line segment between the reader and the exciter; exactly where cannot be determined in this case (an additional exciter, as will be described, resolves this instance). Expressions for determining the location of the intersection of a line emanating from one foci of an ellipse (in this case the reader) and a position on the ellipse can be derived.
In FIG. 9B, the case in which a tag is on the line segment between the Reader and Exciter 1 is provided. This is the degenerate case wherein 2d1=d1+d2+d3. In this case the region of possible tag location according to Exciter 1 is the line segment between the Reader and Exciter 1. If another exciter, Exciter 2 (18-4), is able to illuminate the tag, then this case can be resolved be finding the intersection between the ellipse predicted (18-5) by the foci locations of the Reader and Exciter 2 and the sum of the distances d22, distance from exciter 2 and the tag and distance d32, distance from the reader to the exciter 2. It should be appreciated that in this case the angle of arrival (AOA) information is not required to determine tag location. It can, however, be used as an additional measurement via the procedures previously described.
In FIG. 9C, two non-degenerate location predictions due to Exciter 1 and Exciter 2 are shown. Both distances d11 and d12, distances from the reader to each respective exciter, can be determined via a calibration procedure. Distances d21+d31 and d22+d32 specify left and right ellipse respectively. Angles φ1 and φ2 predict the line segment leaving the Reader and the intersection of this segment with each of the ellipses specifies the tag location. The angles φ1 and φ2 as shown appear the same. However, each angle is an independent observation due to reading the tag of interest via excitation from exciters 1 and 2 respectively.
Multiport Exciter Geometries
Distributed exciter architectures decouple the transmit and receive functions in an RFID system, with exciters being tasked with performing the transmit function. An advantage of decoupling the system in this way is that low cost exciters can be used an deployed in more locations than traditional RFID receiver systems, where providing RFID receivers in multiple locations is typically too costly. In a number of embodiments, exciters have multiple ports so that a single exciter can activate RFID tags using multiple antennas (i.e. ports). In many embodiments, the multiport exciters can possess the capability to switch some antennas to receive signals backscattered by RFID tags. Switching the function of the antennas in this way enables the multiport exciter to collect observations of the signals backscattered by the RFID tags. The exciters can make these observations without the necessity of the complex decoding circuitry utilized in RFID receivers. Enabling multiport exciters to collect observations concerning RFID tags significantly increases the number of receive antennas within an RFID system that can be utilized to collect information for use in location estimation. In addition, the antennas of a multiport exciter are typically distributed further from each other than the antennas in the linear array of an RFID receiver. Multiport exciters that can collect observations concerning RFID tags and various geometries for the location of the antennas of a multiport exciter are discussed further below.
Turning now to FIG. 10, FIG. 10 illustrates a block diagram of a multiport exciter or excitation node (eNode) having four ports (four port exciter) in accordance with various embodiments of the invention. Although much of the following discussion relates to a multiport exciter including four ports, multiport exciters including any number of ports can be utilized in accordance with embodiments of the invention. The four port exciter includes switch circuitry 19-1 to select one or more antennas 19-2. The selection of the antennas is controlled by a processor 19-3 utilizing an associated transmitter circuitry 19-4 or receiver circuitry 19-5. The transmitter circuitry handles all outgoing communications such as interrogation and calibration signals to nearby RFIDs. The receiver circuitry handles all incoming communications such as response data from interrogated RFIDs. The receiver circuitry through the switch circuitry selects one of the antennas for reception of incoming signals. Likewise, the transmitter circuitry through the switch circuitry selects one of the antennas for transmission of the outgoing signals. In most cases, multiple antennas are selected for the transmission to ensure the maximum interrogation coverage to reach the most RFIDs nearby and as described throughout the application to quickly and accurately determine the location of the RFIDs.
FIG. 11 illustrates a detailed block diagram of a multiport exciter or excitation node (eNode) in accordance with various embodiments of the invention. The excitation node includes an antenna array that transmits and receives data from RFIDs. The antenna array includes multiple antenna elements 7-1 through 7-4. Each antenna element is configured via a switch (7-5), such that one or more of the antenna elements transmits and the remaining antenna elements receive. As such, a received signal via the antenna element 7-1 is supplied to an amplifier 7-10. The receive path signal is thus amplified (7-10), bandpass filtered (7-14), and mixed directly to a baseband signal (7-20) supplied by a local oscillator (7-60). The carrier frequency used to mix the baseband signal with the received signal corresponds in frequency used to mix to RF on the transmit side (7-62). The received baseband signal is then low pass filtered (7-24) and amplified (7-28). The signal is sampled, correlated to extract phase, demodulated and decoded by a receiver signal processing circuitry (7-70). Command and control messages (non RFID-tag related data) are decoded by control circuitry (7-74). Based on the decoded command and control messages, processor (7-80) issues instructions to control transmit power level calibration (7-86) and other maintenance features. Received RFID data is forwarded to a data encoder and modulator (7-31) to satisfy aspects of different RFID protocols. Packets for transmission are upconverted (7-32), bandpass filtered (7-36), variably attenuated (7-42), and amplified (7-44). A final bandpass filter ensures that out of band emissions requirements are applied (7-52) prior to radiation out through one of a plurality (in this case four) of possible antennas. In one embodiment, a coaxial cable supplies a frequency reference, DC power, and command control. In this embodiment, local oscillator block (7-62) is replaced with a filter that spectrally purifies the coaxial fed frequency reference.
Referring now to FIG. 12, the antennas of a multiport exciter are shown configured as a distributed array of phase synchronized readers at read points 20-1, 20-2 and 20-3 and a single exciter 20-5. The location of an RFID tag 20-4 within the distributed array is also shown. The multiport exciter is configured to receive signals backscattered by the RFID tag on a plurality of ports via the antennas located at the read points 20-1, 20-2, and 20-3 and to transmit interrogation signals using a single port via the exciter antenna 20-5. Each read point is a known distance from the excitation node. For example, read points 1, 2 and 3 are spaced a specific distance d11, d21 and d31, respectively relative to the excitation node. Also, respective distances d13, d23 and d33 relative to each read points 1, 2 and 3 to the RFID tag are determinable along with the distance d22 relative to the excitation point to the RFID tag (see discussion of group delays below). Accordingly, utilizing the sums of distances d12+d13, d22+d23 and d32+d33 in conjunction with a priori known read point and excitation point locations to determine ellipses, the multiport exciter an collect observations concerning the RFID tag location. One would appreciate that no angle of arrival information is utilized or required to locate the RFID tag.
Turning now to FIGS. 13-16, exemplary excitation nodes or eNode configurations are shown. For example, in FIGS. 13A-D, observations of an RFID tag obtained by a ‘4-port’ eNode configured as a “chandelier” and the different ports act as the exciter is shown. In the chandelier configuration, each of the antenna elements is set equidistance from each other and is set in a square like shape. The 4-port eNode maintains phase synchronization between transmit and receive points using a local oscillator or via an external reference. The view is from overhead and shows eNode setup such that 3 of 4 ports receive (21-1, 21-2 and 21-3 in FIG. 13A) and 1 transmits (21-5 in FIG. 13A). The tag of interest is denoted with a square (21-4). In each figure, three ellipses are displayed. Each ellipse shares a TX antenna for one focus and has a different receiving antenna as another focus. The intersection of all three ellipses can be taken as an observation of tag location. In situations where this intersection is not unique (not shown here) information regarding which antenna excited the tag can be used to identify the most likely 3-way intersection. In one embodiment, the phase of a received tag signal is determined via correlation with a preamble sequence. Such an approach is described in U.S. patent application Ser. No. 11/770,712, filed Jun. 28, 2007, entitled “RFID Beam Forming System”, the disclosure of which is hereby incorporated by reference as if set forth in full herein.
The confidence with which observations of location estimation can be made is dependent upon the noise in the system. When an observation is made at the intersection of ellipses in the manner outlined above, the confidence of the observation can be gauged by the extent to which the ellipses are approximately parallel at the point at which they intersect (see for example FIG. 3D). When the ellipses are approximately parallel, small variations in phase noise can result in significant shifts in the observed RFID tag location. As is discussed below, the number and location of the antennas of a multiport exciter can significantly increase the confidence of location observations made using the exciter.
In FIG. 14A-D, the 4-port eNode is configured as an “offset linear array”. In an offset linear array configuration, pairs of antenna elements are linearly aligned and equally distanced from each other. Also, the first pair is offset a set distance from the second pair. The offset configuration is used to increase total percent area where the backscattered signals from an RFID tag will result in a location observation in which there is only one possible location of the RFID. As shown, three ellipses are displayed for each of the four ports of the eNode with the intersection of the ellipses identifying a tag location. As is discussed further below, each of the four sets of three ellipse observations can be passed to a particle filter process with any one result being sufficient to identify the location of the tag.
FIGS. 15A-F provide another example of a 4-port eNode configured as an offset linear array exemplifying the potential coverage to locate one or more RFID tags. For ease of the reader of the application, the array is shown with a single transmitter configuration with three ellipses drawn and the intersection of which identifying six different RFID tag locations.
FIG. 16 illustrates an example of locating an RFID tag using an “irregular” array. In such a configuration, the antenna elements are set up in a pseudo random pattern. In the illustrated example, six total receive patches (21-1, 21-2, 21-3, 21-6, 21-7 and 21-8) and one transmit patch (21-5) are used to locate a RFID tag (21-4). The arbitrary configuration of the array can also be used for group delay based location solving.
Observables Used in Location Estimation
Backscattered signals from RFID tags provide a variety of observables that can be used in location estimation. The observable used as a proxy for distance in the above discussion of transmit and receive antenna geometries is the calibrated slope of the group delay. Group delay describes the differences in phase observed at different frequencies. The manner in which group delay can be used in location estimation in accordance with embodiments of the invention is explained below. In several embodiments, observations of read rate are used in location estimation. An RFID tag's read rate can be generally described as the number of times the RFID tag is read as a ratio of the number of opportunities in which the RFID tag could have been read. Other observables that can be utilized in location estimation include, but are not limited to, phase, phase coefficient magnitude, read rate, carrier frequency, excitation node index, and receive antenna index.
Group Delay as an Observable
In FIG. 18, a flowchart describing one aspect of a location estimation procedure is provided. The process commences when the reader transmits (8-1) an activation signal to a predetermined exciter. The exciter illuminates (sends interrogation signals) a RFID tag in the exciter's transmit field (8-2). The RFID tag responds by sending information signals (8-3) in which the reader determines a group delay of the signals (8-4). The RFID receiver system causes the RFID tag to respond in which the information signals differ in frequency only and the system determines the phase difference between the different information signals. Using the ratio of the difference in phase versus the difference in frequency (i.e. the group delay), the reader determines the distance to the RFID tag. In one embodiment, the reader also determines total round trip time (8-5). As is discussed below, the distance to the RFID tag can be determined using the group delay (8-6). It should be noted that throughout this process the signals communicated to each system is frequency and phase locked.
Assuming that the exciter location from the reader is known, the received phase of the tag signal at the reader is measured. If a different tone frequency is used, a different relative phase will be measured. The difference in measured relative phases of the two tones at two different frequencies due to the round trip delay is related to the differential frequency via (assuming the exciter is co-located with the reader):




  
    
      
        
          Δ
          ⁢
          
            
          
          ⁢
          φ
        
        =
        
          2
          ⁢
          
            
              2
              ⁢
              
                
              
              ⁢
              π
              ⁢
              
                
              
              ⁢
              Δ
              ⁢
              
                
              
              ⁢
              fd
            
            c
          
        
      
    
    
      
        (
        6
        )
      
    
  




where Δφ is differential relative phases, Δf is differential frequency, d is distance, and c is the speed of light. The phase θ1 at tone frequency f1 can be measured with a 2mπ ambiguity. Similarly the phase at tone frequency f2 can be measured with a 2nπ ambiguity. As long as the differential phase is less than 2π, the phase difference of the modulo 2π measurements can be used to determine the range d given Δf. This is true as long as Δφ is less than 2π. Note that the condition can be satisfied by selecting the appropriate frequency separation given the expected range of operation. From the range d and bearing θ, the tag location can be determined for the two-dimensional example. One skilled in the art would appreciate the extension to 3D is achievable and contemplated. When the exciter is not co-located with the reader and has distance d1 to the tag, then





  
    Δ
    ⁢
    
      
    
    ⁢
    φ
  
  =
  
    
      2
      ⁢
      
        
      
      ⁢
      π
      ⁢
      
        
      
      ⁢
      Δ
      ⁢
      
        
      
      ⁢
      
        f
        ⁡
        
          (
          
            d
            +
            
              d
              1
            
          
          )
        
      
    
    c
  




Angle of Arrival (AOA) as an Observable

In systems that include the specialized case of linear antenna arrays, observations of angle of arrival (AOA) from multiple linear arrays can be used to triangulate an RFID tag. In addition, multiple observations made from a single linear array at different frequencies can be used to triangulate an RFID tag.
One example of a technique for observing location using AOA is based on a set of techniques known as Multiple Signal Classification (MUSIC) algorithms with spatial smoothing. In particular, to simplify notations, we examine the technique as applied to a four element linear array using the MUSIC algorithm with forward and backward filtering. One skilled in the art would appreciate the extension of the algorithm to an arbitrary array is achievable and contemplated.
The signals ri(t) received by the ith element of an M-element linear array each separated by a fixed distance, say λ/2, are given by




  
    
      
        
          
            r
            i
          
          ⁡
          
            (
            t
            )
          
        
        =
        
          
            
              ∑
              
                k
                =
                1
              
              N
            
            ⁢
            
              
            
            ⁢
            
              
                a
                k
              
              ⁢
              
                
                  s
                  k
                
                ⁡
                
                  (
                  t
                  )
                
              
              ⁢
              
                e
                
                  
                    -
                    j
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    (
                    
                      i
                      -
                      1
                    
                    )
                  
                  ⁢
                  π
                  ⁢
                  
                    
                  
                  ⁢
                  sin
                  ⁢
                  
                    
                  
                  ⁢
                  
                    θ
                    k
                  
                
              
            
          
          +
          
            n
            ⁡
            
              (
              t
              )
            
          
        
      
    
    
      
        (
        4
        )
      
    
  




where ak is the amplitude of the k-th multipath signal. s1(t) is the desired signal, sk(t) for k=2,3, . . . , N are multipath received signals, θk is the angle of AOA relative to the antenna boresight for the k-th signal, and n(t) is additive noise or interference.

The inphase and quadrature components, namely In, Qn denote the real and imaginary part of the received signal ri(t). In vector notation:





  
    
      
        
          
            r
            ⁡
            
              (
              t
              )
            
          
          =
          
            
              As
              ⁡
              
                (
                t
                )
              
            
            +
            
              n
              ⁡
              
                (
                t
                )
              
            
          
        
        ⁢
        
          

        
        ⁢
        
          
            
              s
              ⁡
              
                (
                t
                )
              
            
            =
            
              [
              
                
                  
                    
                      
                        s
                        1
                      
                      ⁡
                      
                        (
                        t
                        )
                      
                    
                  
                
                
                  
                    
                      
                        s
                        2
                      
                      ⁡
                      
                        (
                        t
                        )
                      
                    
                  
                
                
                  
                    ⋮
                  
                
                
                  
                    
                      
                        s
                        N
                      
                      ⁡
                      
                        (
                        t
                        )
                      
                    
                  
                
              
              ]
            
          
          ;
        
        ⁢
        
          

        
        ⁢
        
          
            A
            =
            
              [
              
                
                  a
                  ⁡
                  
                    (
                    
                      θ
                      1
                    
                    )
                  
                
                ,
                
                  a
                  ⁡
                  
                    (
                    
                      θ
                      2
                    
                    )
                  
                
                ,
                ...
                ⁢
                
                  
                
                ,
                
                  a
                  ⁡
                  
                    (
                    
                      θ
                      N
                    
                    )
                  
                
              
              ]
            
          
          ;
        
        ⁢
        
          

        
        ⁢
        
          
            a
            ⁡
            
              (
              
                θ
                i
              
              )
            
          
          =
          
            [
            
              
                
                  
                    a
                    i
                  
                
              
              
                
                  
                    
                      a
                      i
                    
                    ⁢
                    
                      e
                      
                        
                          -
                          j
                        
                        ⁢
                        
                          
                        
                        ⁢
                        π
                        ⁢
                        
                          
                        
                        ⁢
                        sin
                        ⁢
                        
                          
                        
                        ⁢
                        
                          θ
                          i
                        
                      
                    
                  
                
              
              
                
                  ⋮
                
              
              
                
                  
                    
                      a
                      i
                    
                    ⁢
                    
                      e
                      
                        
                          -
                          j
                        
                        ⁢
                        
                          
                        
                        ⁢
                        
                          (
                          
                            M
                            -
                            1
                          
                          )
                        
                        ⁢
                        π
                        ⁢
                        
                          
                        
                        ⁢
                        sin
                        ⁢
                        
                          
                        
                        ⁢
                        
                          θ
                          i
                        
                      
                    
                  
                
              
            
            ]
          
        
      
    
    
      
        (
        5
        )
      
    
  




where θ is the AOA relative to the antenna boresight. The signals s(t) includes the desired signal and (N−1) multipath signals.

Referring now to FIG. 21, the location determination of an RFID tag 10-1 through multiple AOA measurements is illustrated. In this two-dimensional rendering, the tag location can be determined from two AOA measurements when the locations of the two array antennas 10-2 and 10-3 are known. In particular, the location (x, y) of the tag can be determined from:




  
    [
    
      
        
          x
        
      
      
        
          y
        
      
    
    ]
  
  =
  
    
      
        [
        
          
            
              1
            
            
              
                
                  -
                  tan
                
                ⁢
                
                  
                
                ⁢
                
                  (
                  
                    θ
                    1
                  
                  )
                
              
            
          
          
            
              1
            
            
              
                
                  -
                  tan
                
                ⁢
                
                  
                
                ⁢
                
                  (
                  
                    θ
                    2
                  
                  )
                
              
            
          
        
        ]
      
      
        -
        1
      
    
    ⁡
    
      [
      
        
          
            0
          
        
        
          
            
              
                x
                2
              
              -
              
                tan
                ⁢
                
                  
                
                ⁢
                
                  (
                  
                    θ
                    2
                  
                  )
                
                ⁢
                
                  y
                  2
                
              
            
          
        
      
      ]
    
  




Referring now to FIG. 20, one aspect of an array antenna RFID system operating in a near field mode in terms of its ability to locate RFID tags is shown. A simplified four-element array is shown in a 2D illustration of an example of the RFID tag location provided by the system. One skilled in the art would appreciate the extension of the 2D to an arbitrary array in 3D is achievable and contemplated. The RFID tag location technique is based on measuring a phase difference 9-1 of the arrival signals between a particular element 9-3 and a reference element 9-2 or a preamble signal. The phase difference 9-1 is proportional to the range difference (r2o−r1o) of the paths 9-4 and 9-5 between the RFID tag and the two array elements 9-2 and 9-3. In particular, the differential range is given by




  
    
      
        
          
            r
            2
            o
          
          -
          
            r
            1
            o
          
        
        =
        
          
            c
            
              2
              ⁢
              
                
              
              ⁢
              π
              ⁢
              
                
              
              ⁢
              f
            
          
          ⁢
          Δ
          ⁢
          
            
          
          ⁢
          
            θ
            1
          
        
      
    
    
      
        (
        2
        )
      
    
  




where f is the carrier frequency of the RFID tag. The location of the RFID tag, uniquely determinable from x1,x2,x3,x4 and differential range (r2−r1), (r3−r1), (r4−r1) can be calculated from the known locations of the array elements (xi, yi) and the measured differential ranges from the very efficient algorithm where





  
    
      
        
          
            G
            =
            
              [
              
                
                  
                    
                      
                        x
                        2
                      
                      -
                      
                        x
                        1
                      
                    
                  
                  
                    
                      
                        r
                        2
                      
                      -
                      
                        r
                        1
                      
                    
                  
                
                
                  
                    
                      
                        x
                        3
                      
                      -
                      
                        x
                        1
                      
                    
                  
                  
                    
                      
                        r
                        3
                      
                      -
                      
                        r
                        1
                      
                    
                  
                
                
                  
                    
                      
                        x
                        4
                      
                      -
                      
                        x
                        1
                      
                    
                  
                  
                    
                      
                        r
                        4
                      
                      -
                      
                        r
                        1
                      
                    
                  
                
              
              ]
            
          
          ;
        
        ⁢
        
          

        
        ⁢
        
          
            Q
            =
            
              [
              
                
                  
                    1
                  
                  
                    0.5
                  
                  
                    0.5
                  
                
                
                  
                    0.5
                  
                  
                    1
                  
                  
                    0.5
                  
                
                
                  
                    0.5
                  
                  
                    0.5
                  
                  
                    1
                  
                
              
              ]
            
          
          ;
        
        ⁢
        
          

        
        ⁢
        
          
            h
            =
            
              
                1
                2
              
              ⁡
              
                [
                
                  
                    
                      
                        
                          
                            (
                            
                              
                                r
                                2
                              
                              -
                              
                                r
                                1
                              
                            
                            )
                          
                          2
                        
                        -
                        
                          x
                          2
                          2
                        
                        +
                        
                          x
                          1
                          2
                        
                      
                    
                  
                  
                    
                      
                        
                          
                            (
                            
                              
                                r
                                3
                              
                              -
                              
                                r
                                1
                              
                            
                            )
                          
                          2
                        
                        -
                        
                          x
                          3
                          2
                        
                        +
                        
                          x
                          1
                          2
                        
                      
                    
                  
                  
                    
                      
                        
                          
                            (
                            
                              
                                r
                                4
                              
                              -
                              
                                r
                                1
                              
                            
                            )
                          
                          2
                        
                        -
                        
                          x
                          4
                          2
                        
                        +
                        
                          x
                          1
                          2
                        
                      
                    
                  
                
                ]
              
            
          
          ;
        
        ⁢
        
          

        
        ⁢
        
          
            r
            i
            2
          
          =
          
            
              
                
                  (
                  
                    
                      x
                      i
                    
                    -
                    x
                  
                  )
                
                2
              
              +
              
                
                  y
                  2
                
                ⁢
                
                  

                
                (
                
                  
                    
                      
                        x
                        ^
                      
                    
                  
                  
                    
                      
                        y
                        ^
                      
                    
                  
                
                )
              
            
            ≈
            
              
                
                  (
                  
                    
                      G
                      T
                    
                    ⁢
                    
                      Q
                      
                        -
                        1
                      
                    
                    ⁢
                    G
                  
                  )
                
                
                  -
                  1
                
              
              ⁢
              
                G
                T
              
              ⁢
              
                Q
                
                  -
                  1
                
              
              ⁢
              h
            
          
        
      
    
    
      
        (
        3
        )
      
    
  




without loss of generality we assumed yi=0.

The solution is based on weighted linear Least Square (LS) solution to finding the intersection of hyperbolic curves defining the differential ranges. The accuracy of the solution approaches that predicted by the Cramer-Rao Bound (CRB).

Read Rate as an Observable

Read rate is the ratio of the number of times an RFID tag is read to the number of times in which the RFID tag could have been read during excitation of an exciter. Systems that utilize distributed exciter architectures can have receive sensitivity so high that the main factor influence tag read rate is path loss between transmitter and tag. Therefore, read rates are expected to be correlated to the location of the tag with respect to the exciter. For example, if hypothesis region xa is located at equal distance from exciters e1 and e2, then its respective read rates RRe1 and RRe2 for an RFID tag located within the hypothesis region are expected to be equal. In determining read rates, collisions can impact data. Typically, a balance is struck between avoiding collisions and ensuring that the number of slots provided to avoid collisions is not so great as to materially impact the performance of the system.
An excitation link margin is used to generate a probability mass function (pmf) that describes the likelihood that a tag will be read a given percentage of the time (Read Rate) if it is located within inventory region xa. Read Rate is determined time interval and dividing this quantity by the number of total possible reads that were possible in the same time duration. Read Rates (RR) will be indexed by exciter (ej) using notation RRe. Given the preceding definitions it is possible to specify the probabilities as a point on a Gaussian probability mass function:




  
    p
    ⁡
    
      (
      
        
          y
          e
        
        ❘
        
          x
          a
        
      
      )
    
  
  =
  
    
      1
      
        
          2
          ⁢
          
            
          
          ⁢
          π
          ⁢
          
            
          
          ⁢
          
            σ
            2
          
        
      
    
    ⁢
    
      e
      
        
          -
          
            
              (
              
                
                  RR
                  e
                
                -
                μ
              
              )
            
            2
          
        
        
          2
          ⁢
          
            
          
          ⁢
          
            σ
            2
          
        
      
    
  




Where μ and σ are determined as a function of excitation power, angle from exciter to hypothesis region, distance from exciter to hypothesis region, exciter radiation pattern, and tag radiation pattern. Note that prior to determining the probability of reading an RFID tag at a given location, all probabilities associated with a given exciter, e, are normalized such that:





  
    
      
        ∑
        
          a
          ∈
          H
        
        
          
        
      
      ⁢
      
        
      
      ⁢
      
        p
        ⁡
        
          (
          
            
              y
              e
            
            ❘
            
              x
              a
            
          
          )
        
      
    
    =
    1
  
  ⁢
  
    

  
  ⁢
  H
  ≡
  
    The
    ⁢
    
      
    
    ⁢
    set
    ⁢
    
      
    
    ⁢
    of
    ⁢
    
      
    
    ⁢
    all
    ⁢
    
      
    
    ⁢
    hypothesis
    ⁢
    
      
    
    ⁢
    regions
  




As is discussed further below, a variety of estimators can be utilized to determine the location of the hypothesis regions and obtain location estimates for RFID tags observable within the various hypothesis regions.
Estimation Location Using Observables
Referring now to FIG. 19, the operation provided in FIG. 18 is repeated (8-7). The repeated operation produces multiple read points. Utilizing these multiple reads and thus the information or distance estimations of the RFID tag, a probability distribution model is formed (8-8). An algorithm can be selected and applied (8-9) to determine a location estimate of the RFID tag. Additionally, a confidence level or accuracy factor can be determined. As a result of applying the algorithm the multipath effects, e.g., the direction of arrival of the signal from the source to each antenna element are accounted for and mitigated. Various estimators are discussed below.
Estimators Used to Obtain Location from Observables
The impact of noise present in observations of RFID tag location can be limited using estimators. A number of different estimators that can be used to estimate RFID tag location using any of the observables outlined above are discussed below.
Particle Filter Based Estimators
In one embodiment shown in FIG. 18 the phase, phase coefficient magnitude, read rate, carrier frequency, excitation node index, receive patch antenna index phase, and/or other observables associated with a given tag read (as described in the preceding text on observables) is passed to a Monte Carlo hypothesis testing algorithm known as a particle filter (25-4). Since a generalized 3D probability distribution function is continuous and hence technically infinite in complexity, a finite compressed description of this distribution is found. Kalman filters provide only a second-moment description of this general distribution. Unscented filters are good to 3rd moment complexity. It is also possible to consider gridded hypotheses, where a set of hypotheses are kept from across the domain of the state, and can be extended to higher point density. However, these can be very wasteful in the number of hypotheses needed to express a localized likelihood.
Particle filters are an adaptive hypothesis approach to estimation that uses a non-uniform time adaptive grid. Particles, which represent test hypotheses in state space, are generated based on the prior distribution of the state. For each observation, the likelihood that a given particle (the state possibility) generates that observation is assessed. Highly likely particles are replicated, unlikely particles are eliminated. Finally, replicated particles are randomly moved a small amount in state space, similar to a genetic mutation or annealing.
For our location estimation problem particles are associated with a (x,y,z) location and optionally a ({dot over (x)},{dot over (y)},ż) velocity. Particle filtering can be divided into an initialization process and a recurring set of processes that operate on each new measurement. We use the first measurement distribution, or other prior stats, to generate the seed particle cloud. If the state were a uniform distribution over a finite extent, these initial particles could be chosen from a grid. But in general, the prior distribution is more complicated, and random state values are chosen to seed the particle set.
The time update process (25-5) is performed whenever a new observation (25-3) enters the system. It corresponds to the propagation of the particle states and dynamic uncertainty due to the fact that some time has passed since the last update. This step is driven by physical processes, deterministic and stochastic. Given that some amount of time that has passed since the last update there is some uncertainty about the current position and velocity of each particle. We relocate each particle to a random new position and a random new velocity. The distribution used for this processes depends on the environment and the current state of the particle. As an example, if we wish to estimate the location of tags moving on a forklifts the new velocity is limited to the velocities that can be obtained by an acceleration of 1G or less in each direction. There's also a maximum absolute value of velocity that the forklift can have. The time update process is separate from the regularization step in principle, but is dependent in implementation, since both time update and regularization add noise to state particles
Next the measurement update (25-6) process computes likelihoods associated to each particle given the new measurement. The resulting likelihood is the product of the likelihoods that each observation (for instance phasor, or read rate measure) correspond to given the expected phase between eNode to tag and tag to antenna element distances. These probabilities can be evaluated with, in one embodiment, a Gaussian distribution that uses a standard deviation which depends on the receive power on the antenna when the observation is taken and also on the reliability associated with the estimated calibration coefficient. Calibration coefficients are used on each tag-read measurement in order to remove any effects that don't correspond to wave propagation. In one embodiment, given that the distance between an excitation point and a receive patch in known, one can remove excess phase rotation at each frequency compared to observed phase using a ‘backchannel’ waveform or reference tag that is co-located with the excitation point (25-10). The amount of removed excess rotation at each frequency is recorded and ‘backed-out’ of subsequent received tag measured phase data in order to compensate for phase rotation effects not due to radio propagation (such as electronic delay).
The re-sampling process (25-7) is in charge of destroying/cloning particles based on their likelihood. This is done by taking the cumulative distribution generated by the particles likelihoods and using it to generate the new particles. The more likely a particle is, the more it will be cloned. Clones of particles have the same position and velocity (in other words, they are exact clones for now; the next step (regularization) adds carefully chosen mutations)
The final step in the particle filter process, regularization (25-8), is responsible for keeping some memory of measurement likelihoods. Previous probabilities of particles are captured by reproduction and mutation. In this way particles with high are replicated. The regularization process is similar to genetic mutation or simulated annealing. Its purpose is to jitter clones to fill in gaps in the particle set. One of the known problems of particle filters is the possibility that the points collapse to a small number of hypothesis. If the cloud of particles collapses, there will be too few hypotheses to test in future measurements. The regularization process, through its introduction of random variation, is in charge of avoiding this problem.
Results are finally output for higher layer static gathering in (25-9). At this layer it is possible to compute probability densities for the location solution over time. In general one can report the quality of the final solution via variance measurement of this final layer statistic.
Bayesian Estimators
In one embodiment, signals for a selected RFID tag from which information is to be derived may be selected from signals from a plurality of RFID tags based on a spatial location of the selected RFID tag relative to the spatial location of other ones of the plurality of RFID tags. That is for a given interrogation space, only a specific population of tags are illuminated as depicted in FIG. 3 and as an example the interrogation space 3-8. For estimating the location of the tag, a Bayesian approach is used to model the probability density function of the location of an RFID tag, based on all available information such as the AOA, position of excitation node and any previous knowledge of the position of the population of the sensor(s) or tag(s), the multi path propagation environment, the frequency of the measurement, and the array response (beam pattern) where the measurement and any other auxiliary information to further inject in the apriori Bayesian model. In one aspect, the system recursively estimates the location in the three dimensional Euclidean space (position in x, y, z, that is elevation, roll, yaw).
The observed vector Ytj (for the j-th tag) measured at each antenna element comprises of discrete complex valued received signal samples rt or equivalently the in-phase and quadrature components In, Qn for each antenna element with real and complex part respectively, known position of exciter (x,y,z), beam former coefficients a, Signal-to-Noise Ratio (SNR) Estimate, gain setting a, soft metric, extrinsic information β(In,Qn), and packets (e.g. RN16+EPC code) for each interrogation space. The model measurement used is a single vector at time t, Ytj. It is assumed that the observed L-dimensional vector Ytj results from mapping the 3-dimensional Euclidean space of the location of the tag to an L-dimensional observable vector R3→RL. Different approaches of estimating the probability distribution P(xtj|Ytj) recursively are provided in which xtj is the location coordinates of the j-th tag in 3 dimensions. The conditional expectation (i.e. mean value E(x|Y)) of this density represents that the location of the tag or equivalently is isomorphic to the estimation of this sequence.
Referring now to FIG. 22, for entire space or volume 12-1, an exciter activated by the reader produces a RFID location estimate that graphically is shown in 12-4. As multiple iterations of reads occur, the RFID location estimates for multiple RFIDs are graphically shown in 12-5. The peaks or centroid of the cones identifies the location of an RFID. The surrounding portion of the cone identifies the accuracy or certainty of the identified location. For example, the peak 12-5a being stepper provides an highly accurate location of an RFID tag while the peak 12-5b being flatter provides a less accurate estimate location of the RFID tag.
With a priori knowledge of the location of the transmitter/exciter (11-2), the problem of estimating a tag's location can be reduced to finding the location of tag in the cube shown in 12-1. Utilizing hypothetical testing, the cube can be further quantized for location of each tag to smaller cubes as shown in 12-2, with each location treated as sphere 12-3. The probability distribution of the location of population of the tags in the interrogation space can be viewed as a two dimensional Gaussian density with a known mean and variance in two dimensional (x,y) Euclidean space. The spheres projected into circles can also respectively be viewed as a two dimensional Gaussian density with a known mean and variance in two dimensional (x,y) Euclidean space as illustrated by graph 12-5. In case of three dimensional sphere 12-3 in a three dimensional Euclidean space, the (x,y,z) dimension of each point becomes the support of a three dimensional Gaussian density. In this manner, for certain class of algorithms described later, the algorithm can be initialized with a known a priori probability density models as illustrated by graph 12-5.
Referring now to FIGS. 23-25, exemplary procedures and formulations to further refine and/or provide additional accuracy to the location estimation of an RFID tag are provided. In the following, the observed sample space Ω={Ytj, ∀t, j} is denoted. P(xtj|Ytj) represents the probability distribution function location at time t, based on all the past AOA measurements. Bayes models provide a probabilistic framework for the recursive estimation of P(xtj|θ), where the vector θ=(θj, . . . θt) defines the angle of arrival vector.
In an indoor propagation environment, the direction of the dominant signal may be due to a reflected signal instead of the direct path in some cases. This situation is accounted for to avoid an erroneous estimate of the actual location of the source. The location of a tag {xt;t ∈N},xt ∈X (t may also represent an iteration index) is modeled as a 1st order Markov process with initial distribution p(x0) and the Markov relation P(xt|xt−1). The observed sequence of tag signals Yt ∈Ω may include both complex and real-valued measurements and estimates made by the reader system for each array element are provided in FIG. 23.
The observed vector from the j-th tag is denoted by Ytj=(ytj, yt−1j, yt−2j, . . . y0j) with each ytj is a vector. The P(xtj|Ytj) probability density function in one aspect is obtained recursively in two stages, namely prediction and update stages. The a priori probability density function at time step t used to predict xt (for clarity the dependency on j is removed) is

P(xt|Yt−1)=∫P(xt|xt−1)P(xt−1|Yt−1)dxt−1  (7)

and the update via Bayes rule is





  
    
      
        
          P
          ⁡
          
            (
            
              
                x
                t
              
              ❘
              
                Y
                t
              
            
            )
          
        
        =
        
          
            
              P
              ⁡
              
                (
                
                  
                    y
                    t
                  
                  ❘
                  
                    x
                    t
                  
                
                )
              
            
            ⁢
            
              P
              ⁡
              
                (
                
                  
                    x
                    t
                  
                  ❘
                  
                    Y
                    
                      t
                      -
                      1
                    
                  
                
                )
              
            
          
          
            P
            ⁡
            
              (
              
                
                  y
                  t
                
                ❘
                
                  Y
                  
                    t
                    -
                    1
                  
                
              
              )
            
          
        
      
    
    
      
        (
        8
        )
      
    
  




where, P(yt|yt−1)=∫P(yt|xt)P(xt|yt−1)dxt with initial condition P(x0|Y0)

Equation (8) can be viewed as P(xt|Yt)=WtP(xt|Yt−1) where the weight is defined by





  
    
      
        
          W
          t
        
        =
        
          
            P
            ⁡
            
              (
              
                
                  y
                  t
                
                ❘
                
                  x
                  t
                
              
              )
            
          
          
            P
            ⁡
            
              (
              
                
                  y
                  t
                
                ❘
                
                  Y
                  
                    t
                    -
                    1
                  
                
              
              )
            
          
        
      
    
    
      
        (
        9
        )
      
    
  




In various aspects, multiple approaches for recursive estimation of P(xtj|Ytj) are provided. FIG. 24 outlines the steps of the general form of sequential Monte Carlo methods. The conditional density function P(xtj|Ytj) is updated in each iteration 14-1, the weights are updated based on a function (to be defined later) of previous values of the weights and possibly a random parameter p (to be defined shortly) in 14-2. The prediction step 14-3 involves computing P(xt+1j|Ytj) and then obtaining a new sample Yt+1j) from the sample space. This last step is referred to as resampling.
One resampling approach is to evaluate the density with a pointwise approximation. Using a classical Monte Carlo method, the empirical distribution of xt is given by an application of histogram averaging via




  
    
      P
      ^
    
    ⁡
    
      (
      
        x
        t
      
      )
    
  
  =
  
    
      1
      N
    
    ⁢
    
      
        ∑
        
          i
          =
          1
        
        N
      
      ⁢
      
        
      
      ⁢
      
        δ
        ⁡
        
          (
          
            
              x
              t
            
            -
            
              x
              ⁡
              
                (
                i
                )
              
            
          
          )
        
      
    
  




where {x(i)} is drawn from a random source with a probability distribution P(x). Each time a set of measurements is made, the likelihood of each prior measurement can be estimated.

In accordance with various aspects, the system initializes multiple solutions as described earlier. FIG. 25 provides a general approach in accordance with various aspect of finding the location of an RFID tag/sensor. Beginning with multiple candidate solutions and each solution set itself are applied to one of the many choices for estimating the likelihood as shown in 15-2, by sampling Ω in 15-1, and computing the probability density P(xt+1j|Ytj). Various techniques outlined in 15-3 such as rejection sampling, importance sampling and sampling importance resampling (SIR), simulated annealing, particle filtering and unscented transform approaches can be used. Each of these techniques utilize a slightly different approach to computing the weight sequence in resampling over time, where resampling is performed with replacement N-times from Ω in all the cases.
A Sampling Importance Resampling Estimator
A recursive SIR approach is performed as follows:

    
    
        1. Set t=0 and get M samples x0i∈Ω for i=1, . . . , M
        2. Weight Update: Compute the likelihood weights wi=P(yt|xti) for i=1, . . . , M
        3. Normalize the weights by
    
    






  ∂
  
    =
    
      
        
          ∑
          
            j
            =
            1
          
          M
        
        ⁢
        
          
        
        ⁢
        
          
            w
            j
          
          ⁢
          
            
          
          ⁢
          with
          ⁢
          
            
          
          ⁢
          
            w
            i
            *
          
        
      
      =
      
        
          w
          i
        
        ∂
      
    
  




    
    
        4. Resampling: Generate a new set {tilde over (x)}ti ∈Ω with i=1, . . . , N with replacement N times from the discrete set {xtj, j=1, . . . , M} with P({tilde over (x)}ti=xtj)=wj*;
        5. Prediction: predict each of the resampled states independently k-time, where xi+1(i−1)k+m∝P(xt+1|{tilde over (x)}ti) with i=1, . . . ,N and m=1, . . . , k
        6. go to step 2 and repeat t=t+1
    
    


To avoid a degenerate solution where after some iterations only one candidate state vector value is present, the resampling step may modified by using a known distribution around the expected location of RFID tags near the exciter. The choice of importance function in each coordinate will be an independent identically distributed Gaussian distributed density N(m, σ) with the mean m and variance σ2 of the density to be equal to the location of the exciter plus a correction term (mid-range between exciter and the farthest tag illuminated by the exciter) and variance σ2 to be equal to one of the diameters of the ellipsoid in the three dimensional Euclidean space.
In this case the importance sampling is achieved by generating samples from a proposed distribution q(Xt|Yt)=q(xt|xt−1i, Yt)q(Xt−1|Yt−1). In this version to determine the degeneracy of the particle cloud, the relative efficiency of the importance sampling procedure is related by the ratio between the variance of the importance sampling estimate and the variance of the estimate if a perfect Monte Carlo simulation was possible. The quantity can be estimated by




  
    
      N
      ^
    
    eff
  
  =
  
    1
    
      
        ∑
        i
        N
      
      ⁢
      
        
      
      ⁢
      
        w
        i
        2
      
    
  




and Nthresh is a preselected threshold where the resampling procedure is applied to the set of the particles.

An Enhanced Particle Filter Estimator

In one embodiment, an enhanced particle filtering approach begins with a generation or selection of N inputs or samples (Set t=0 and




  
    w
    0
    i
  
  =
  
    1
    N
  




get N samples x0i ∈Ω for i=1, . . . , N from q(x0|y0)). Weights for each sample (i=1, . . . , N) are then computed in accordance with the following function:





  
    w
    t
    i
  
  =
  
    
      w
      
        t
        -
        1
      
      i
    
    ⁢
    
      
        p
        ⁡
        
          (
          
            
              y
              t
            
            ❘
            
              x
              
                t
                -
                1
              
              i
            
          
          )
        
      
      
        q
        ⁡
        
          (
          
            
              
                x
                t
              
              ❘
              
                x
                
                  t
                  -
                  1
                
                i
              
            
            ,
            
              Y
              t
            
          
          )
        
      
    
  




and normalized:





  ∂
  
    =
    
      
        
          ∑
          
            j
            =
            1
          
          M
        
        ⁢
        
          
        
        ⁢
        
          
            w
            j
          
          ⁢
          
            
          
          ⁢
          with
          ⁢
          
            
          
          ⁢
          
            w
            i
          
        
      
      =
      
        
          w
          i
        
        ∂
      
    
  




If the relative efficiency is greater than a preselected threshold ({circumflex over (N)}eff>Nthresh) then resampling is skipped. Otherwise, resampling is performed by generating a new set {tilde over (x)}ti∈Ω with i=1, . . . , N with replacement Ntimes from the discrete set {xtj, j=1, . . . , M} with P({tilde over (x)}ti=xtj)=wj and weights are reset





  
    w
    0
    i
  
  =
  
    
      1
      N
    
    .
  




Prediction is then performed for each of the states or resampled states independently of k-time, where xi+1i∝q(xt+1|xti, Yt+1) with i=1, . . . , N and m=1, . . . , k. The process is then repeated for the next set (t=t+1) and the computation of the weights for the new samples.

A Metropolis-Hastings Algorithm Estimator

Using a Markov chain model for the observed sequence and estimation when a proposed distribution is used to generate the samples, the Metropolis-Hastings algorithm, a candidate sample z is drawn from the proposal q(z|x) and accepted with a probability given by (p,q,π representing different distributions)




  
    α
    ⁢
    
      
    
    ⁢
    
      (
      
        x
        ,
        z
      
      )
    
  
  =
  
    min
    ⁢
    
      
    
    ⁢
    
      (
      
        1
        ,
        
          
            
              π
              ⁡
              
                (
                z
                )
              
            
            ⁢
            
              q
              ⁡
              
                (
                
                  x
                  ❘
                  z
                
                )
              
            
          
          
            
              π
              ⁡
              
                (
                x
                )
              
            
            ⁢
            
              q
              ⁡
              
                (
                
                  z
                  ❘
                  x
                
                )
              
            
          
        
      
      )
    
  




The candidate is accepted or rejected, as the Markov chain moves to the new data set, while the rejection leaves the Markov chain at the current data point in the state space. If π(x)=p(x|y) is chosen, then the acceptance probability is simply:





  
    α
    ⁡
    
      (
      
        x
        ,
        z
      
      )
    
  
  =
  
    min
    ⁡
    
      (
      
        1
        ,
        
          
            p
            ⁡
            
              (
              
                y
                ❘
                z
              
              )
            
          
          
            q
            ⁡
            
              (
              
                y
                ❘
                x
              
              )
            
          
        
      
      )
    
  




Metropolis-Hastings algorithm is summarized as follows:

    
    
        1. Set t=0 and choose x0 randomly or deterministically
        2. Sample z ̃q(z|xt) and u ̃U(0,1)
        3. Compute acceptance probability: α(x,z)
        4. Predict: If u≦α(x,z) accept the new sample xt+1=z otherwise xt+1=xt 
        5. Go to step 2 and repeat t=t+1

In step 4, by adopting a statistical mechanics approach with introducing an energy or fitness function for the state of the system, then the probability density in phase space of the point representing xt is proportional to e−βE(xt) where

    
    






  
    β
    =
    
      1
      kT
    
  
  ,




T is the absolute temperature in Kelvin and k is the Boltzman constant 1.38×10−23 J/Kelvin. The energy or fitness improvement with transitioning from one state to another can be characterized as the difference between the two energy state, i.e. ΔE=E(xt+1)−E(xt) such that the energy is reduced in each iteration, that is transition probabilities of the state is:





  
    x
    
      t
      +
      1
    
  
  =
  
    {
    
      
        
          
            
              x
              ~
            
            t
          
        
        
          
            with
            ⁢
            
              
            
            ⁢
            probability
            ⁢
            
              
            
            ⁢
            
              e
              
                
                  -
                  β
                
                ⁢
                
                  
                
                ⁢
                Δ
                ⁢
                
                  
                
                ⁢
                E
              
            
          
        
      
      
        
          
            x
            t
          
        
        
          
            
              with
              ⁢
              
                
              
              ⁢
              probability
              ⁢
              
                
              
              ⁢
              1
            
            -
            
              e
              
                
                  -
                  β
                
                ⁢
                
                  
                
                ⁢
                Δ
                ⁢
                
                  
                
                ⁢
                E
              
            
          
        
      
    
  




where {tilde over (x)}t ∈Ω. If an additional constraint is applied to reduce the temperature T monotonically such that Tn<Tn−1<Tn−2 in each iteration for a set of the data with the initial condition of T0>>Tn−1<Tn−2, it is expected for the solution to converge to the near optimal estimate, by utilizing the trajectory of the solution phase space with the property of following the states of an aperiodic and irreducible Markov chain.

An Unscented Transform Estimator

Unscented transform is another approach to estimation of the location for the RFID tags. By defining the covariance matrix P=E ((x− x)(x− x)T) where x denotes the mean value of the random variable x, the problem of approximating the distribution of an N-dimensional random variable with a mean and covariance is approached. The affine transform x= x+(√{square root over (X)})z is defined where √{square root over (X)} is the matrix square root of X with property √{square root over (X)}√{square root over (X)}T=X. The unscented transform approach is thus summarized as follows:
1. Initialize

 x0=E[x0]P0=E[(x0− x0)(x0− x0)T]

 x0a=E[xa]=[ x0T00]T 





  
    P
    0
    a
  
  =
  
    
      E
      ⁡
      
        [
        
          
            (
            
              
                x
                0
                a
              
              -
              
                
                  x
                  _
                
                0
                a
              
            
            )
          
          ⁢
          
            
              (
              
                
                  x
                  0
                  a
                
                -
                
                  
                    x
                    _
                  
                  0
                  a
                
              
              )
            
            T
          
        
        ]
      
    
    =
    
      [
      
        
          
            
              P
              0
            
          
          
            0
          
          
            0
          
        
        
          
            0
          
          
            Q
          
          
            0
          
        
        
          
            0
          
          
            0
          
          
            R
          
        
      
      ]
    
  




2. Define




  
    χ
    
      t
      -
      1
    
    a
  
  =
  
    [
    
      
        
          
            x
            _
          
          
            t
            -
            1
          
          a
        
        ⁢
        
          
        
        ⁢
        
          
            x
            _
          
          
            t
            -
            1
          
          a
        
      
      ±
      
        
          
            (
            
              
                n
                a
              
              +
              λ
            
            )
          
          ⁢
          
            P
            
              t
              -
              1
            
            a
          
        
      
    
    ]
  




3. Time update



  
    
      χ
      
        t
        ❘
        
          t
          -
          1
        
      
      x
    
    =
    
      f
      ⁡
      
        (
        
          
            χ
            
              t
              -
              1
            
            x
          
          ,
          
            χ
            
              t
              -
              1
            
            v
          
        
        )
      
    
  




  
    
      
        x
        _
      
      
        t
        ❘
        
          t
          -
          1
        
      
    
    =
    
      
        ∑
        
          i
          =
          0
        
        
          2
          ⁢
          
            
          
          ⁢
          
            n
            a
          
        
      
      ⁢
      
        
      
      ⁢
      
        
          W
          i
          
            (
            m
            )
          
        
        ⁢
        
          χ
          
            i
            ,
            
              t
              ❘
              
                t
                -
                1
              
            
          
          x
        
      
    
  




  
    
      P
      
        t
        ❘
        
          t
          -
          1
        
      
    
    =
    
      
        ∑
        
          i
          =
          0
        
        
          2
          ⁢
          
            
          
          ⁢
          
            n
            a
          
        
      
      ⁢
      
        
      
      ⁢
      
        
          
            
              W
              i
              
                (
                c
                )
              
            
            ⁡
            
              [
              
                
                  χ
                  
                    i
                    ,
                    
                      t
                      ❘
                      
                        t
                        -
                        1
                      
                    
                  
                  x
                
                -
                
                  
                    x
                    _
                  
                  
                    t
                    ❘
                    
                      t
                      -
                      1
                    
                  
                
              
              ]
            
          
          ⁡
          
            [
            
              
                χ
                
                  i
                  ,
                  
                    t
                    ❘
                    
                      t
                      -
                      1
                    
                  
                
                x
              
              -
              
                
                  x
                  _
                
                
                  t
                  ❘
                  
                    t
                    -
                    1
                  
                
              
            
            ]
          
        
        T
      
    
  




  
    
      Y
      
        t
        ❘
        
          t
          -
          1
        
      
    
    =
    
      h
      ⁡
      
        (
        
          
            χ
            
              t
              ❘
              
                t
                -
                1
              
            
            x
          
          ,
          
            χ
            
              t
              -
              1
            
            n
          
        
        )
      
    
  




  
    
      
        y
        _
      
      
        t
        ❘
        
          t
          -
          1
        
      
    
    =
    
      
        ∑
        
          i
          =
          0
        
        
          2
          ⁢
          
            
          
          ⁢
          
            n
            a
          
        
      
      ⁢
      
        
      
      ⁢
      
        
          W
          i
          
            (
            m
            )
          
        
        ⁢
        
          Y
          
            i
            ,
            
              t
              ❘
              
                t
                -
                1
              
            
          
        
      
    
  



4. Weight update

Wtc=Wt−1cP(yt|xt)

λ is a composite scaling parameter, na=nx+nv+nn, Q is process noise covariance. R is measurement noise covariance matrix.

A Differential Evolution Based Estimator

Another layer of optimization for finding the location of the RFID tag is to start from a population (instead of a single solution) of possible solutions. The initial population is chosen judiciously to cover the space of the exciter range as much as possible. In one aspect, a uniform probability distribution for all random locations is initially utilized. In case a preliminary solution is available, the initial population is often generated by adding normally distributed random deviations to the nominal solution xnominal. Differential evolution (DE) provides an approach for generating trial parameter vectors. DE generates new parameter vectors by adding a weighted difference vector between two population members to a third member. If the resulting vector yields a lower objective function value than a predetermined population member, the newly generated vector will replace the vector with which it was compared in the following generation. The comparison vector can but need not be part of the generation process mentioned above. In addition the best parameter vector xBest,G is evaluated for every generation G in order to keep track of the progress that is made during the minimization process. Extracting distance and direction information from the population to generate random deviations results into a converging solution. A trial vector is introduced for each generation v=xr1,G+μ(xr2,G−xr3,G) with r1,r2,r3 randomly chosen between 1 and L, where L is the number of generations to follow and is a fixed parameter throughout the evolution and μ controls the step size of the differential variation from one generation to the other. This methodology is summarized in FIG. 26, starting with a population of feasible solutions 16-1, then performing some fitness computation in 16-2, population pruning and mutation in 16-3, checking a stopping rule in 16-3.
An Ant Colony Optimization Based Estimator
In various other embodiments, other nonlinear stochastic optimization algorithms are utilized by considering a population of solutions and updating each solution's viability via some selected metric. A metric used frequently and referred to as ant colony optimization, referred to as pheromone is defined by




  
    p
    ij
    k
  
  =
  
    {
    
      
        
          
            
              
                τ
                ij
                α
              
              
                
                  ∑
                  
                    l
                    ∈
                    
                      N
                      i
                      k
                    
                  
                  
                    
                  
                
                ⁢
                
                  
                
                ⁢
                
                  τ
                  il
                  α
                
              
            
            ⁢
            
              
            
          
        
        
          
            
              
            
            ⁢
            
              
                if
                ⁢
                
                  
                
                ⁢
                j
              
              ∈
              
                N
                i
                k
              
            
          
        
      
      
        
          0
        
        
          
            
              if
              ⁢
              
                
              
              ⁢
              j
            
            ∉
            
              N
              i
              k
            
          
        
      
    
  




When in iteration t, consider N possible solutions (as opposed to following one solution) and follow k solutions and compute the probability of solution j by setting a solution metric τij←τij+Δτk with initial condition τij←(1−p)τij, ∀(i,j)∈A. Nik denotes the number of solutions in the neighborhood of kth solution in the ith iteration. In this manner, potential degeneracy problems are avoided at an algorithmic level by considering multiple solutions concurrently in the solution space. This can be applied to any of the algorithms described above, by considering each solution as a single point in a planar graph and finding the best path in the graph via the solution metric outlined here. This approach is similar to so called “genetic programming” or “ant colony optimization”.

Stopping Rules

In the accordance with various aspects, the approaches provided are without any specific constraints on the form or type of stopping rule. For brevity here, a number of different stopping rules are provided as used in accordance various aspects of the present invention. Here a distance is computed d(xt, xt+1), for example |xt−xt+1| and if d(xt,xt+1)<<∈ the algorithm is stopped. A region of attraction is defined by A={xt, d(xt,x*)<<ε} where x* denotes the optimal solution and ε being a small positive number. For algorithms utilizing a discrete Markov chain approach such as the Metropolis-Hastings method, the fraction of the uncovered state space is minimized such that a region of attraction is reached. In this approach a count is used for visiting each state of Ω and then incrementing it each time the state is visited. The stopping rule is such that




  
    
      Min
      i
    
    ⁢
    
      C
      i
    
  
  >
  1




and in addition the distance criterion is met.

Location Estimation in Vertical Racked Shelving Applications

An end application of the present invention is described in FIG. 27. The figure details a series of adjacent vertical racked shelves used to store inventory items. Such shelving commonly appears in warehouses to store inventory. With present technology the inventory must be manually counted, often with the aid of barcode reading devices, by moving from one section of the shelving to another and recording an item's serial identifier along with shelf x,y,z location. In contrast the RFID location system as described throughout this description in various embodiments is able to provide continuous status regarding items stored on shelves without movement of gear or personnel from one area to the next. This is achieved in one embodiment through regular static placement of radio frequency excitation points overhead in the area between aisles. Utilizing excitation power control and/or read rates for an RFID tag on a per exciter basis in conjunction with the particle location procedures items in applications such as vertical racked storage can be located. In particular, read rates for an RFID tag on a per exciter basis and per excitation power level provide z dimension information for the location of an RFID tag. It should however be appreciated that there is a special case of vertical racked storage, floor level storage (also known as floor staging of goods), such that the vertical location of goods (z) is known a-priori to be a known constant. It should also be appreciated that a special case of vertical racked storage exists when items are simply stacked on top of one another. In this case no physical shelf separates items in the “z” dimension; rather item height is delineated by stacking order.
While the above description contains many specific embodiments of the invention, these should not be construed as limitations on the scope of the invention, but rather as an example of one embodiment thereof. Accordingly, the scope of the invention should be determined not by the embodiments illustrated, but by the appended claims and their equivalents.

## Claims

1. A method of locating one or more radio frequency identification (RFID) tags comprising:
illuminating at least one RFID tag by an exciter using a plurality of frequencies;
receiving information signals from the illuminated at least one RFID tag by a plurality of receive antennas;
determining a group delay for the received information signals from the at least one illuminated RFID tag received by each of the plurality of receive antennas;
determining the path length between the exciter, the at least one illuminated RFID tag, and each of the plurality of receive antennas using the determined group delay of the received information signals at each of the plurality of receive antennas:
determining a plurality of ellipses based on the locations of each of the plurality of receive antennas, the location of the exciter, and the determined path lengths; and
identifying a location of the at least one RFID tag based on the determined ellipses.

2. The method of claim 1 further comprising transmitting an activation signal from a reader to an exciter, the reader and exciter sharing a common geometric characteristic relative to each other.

3. The method of claim 1 wherein the shared common geometric characteristic is an ellipsoid wherein the reader and the exciter are foci of the ellipsoid.

4. The method of claim 1 wherein identifying the location of the at least one RFID tag is based on a frequency derivate of the received information signals.

5. The method of claim 1 wherein identifying the location of the at least one RFID tag is based on a ratio of the phase derivate versus the frequency derivate.

6. The method of claim 1 wherein identifying the location of the at least one RFID tag is based on a read rate derivate of the received information signals.

7. A radio frequency identification (RFID) system for locating one or more RFID tags, the system comprising:
a plurality of antennas configured to selectively transmit interrogation signals through at least two of the plurality of antennas and to selectively receive information signals from at least one RFID tag through one of the plurality of antennas different from the at least two of the plurality of antennas; and
a reader configured to:
activate the antennas configured to selectively transmit interrogation signals;
determine the path length between the receive antenna, the at least one illuminated RFID tag, and each of the plurality of transmit antennas using the determined group delays of the received information signals;
determine a plurality of ellipses based on the locations of each of the plurality of receive antennas, the location of the transmit antenna, and the determined path lengths; and
identify a location of the at least one RFID tag based on the determined ellipses.

8. The system of claim 7 wherein the plurality of antennas are arranged in a uniform pattern.

9. The system of claim 7 wherein the plurality of antennas are positioned equidistant from each other.

10. The system of claim 7 wherein at least two of the plurality of antennas are positioned as foci for a substantially ellipsoid that identifies a locus of potential locations of the at least one RFID tag.

11. The system of claim 7 wherein the plurality of antennas are positioned in pairs with each pair being foci for a substantially ellipsoid that identifies a locus of potential locations of the at least one RFID tag and each pair positioned to minimize overlapping of each substantially ellipsoid.

12. The system of claim 7 wherein the plurality of antennas are positioned around the at least one exciter, each location of each of the plurality of antennas differing from each other.

13. The system of claim 7 wherein the exciter uses a carrier frequency to mix a reference signal with the received information signals.

14. The system of claim 13 wherein the reference signal is a pilot and a preamble signal.

15. A method of locating one or more radio frequency identification (RFID) tags comprising:
illuminating at least one RFID tag by a plurality of transmit antennas using interrogation signals at a plurality of frequencies;
receiving a plurality of information signals from the illuminated at least one RFID tag by a receive antenna, where the plurality of information signals include information signals generated in response to interrogation signals sent at different frequencies from each transmit antenna;
determining a group delay for each group of received information signals from the at least one illuminated RFID tag received by the receive antenna that were sent in response to interrogation signals from each transmit antenna;
determining the path length between the receive antenna, the at least one illuminated RFID tag, and each of the plurality of transmit antennas using the determined group delays of the received information signals;
determining a plurality of ellipses based on the locations of each of the plurality of transmit antennas, the location of the receive antenna, and the determined path lengths; and
identifying a location of the at least one RFID tag based on the determined ellipses.

16. The method of claim 15 further comprising transmitting an activation signal from a reader to an exciter, the reader and exciter sharing a common geometric characteristic relative to each other, the reader comprising the receive antenna, and the exciter comprising at least one of the plurality of transmit antennas.

17. The method of claim 16 wherein the shared common geometric characteristic is an ellipsoid wherein the reader and the exciter are foci of the ellipsoid.

18. The method of claim 15 wherein identifying the location of the at least one RFID tag is based on a frequency derivate of the received information signals.

19. The method of claim 15 wherein identifying the location of the at least one RFID tag is based on a ratio of the phase derivate versus the frequency derivate.

20. The method of claim 15 wherein identifying the location of the at least one RFID tag is based on a read rate derivate of the received information signals.