13.01.2013 Views

Each - Draper Laboratory

Each - Draper Laboratory

Each - Draper Laboratory

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

estimates may be large enough to preclude the initial use of<br />

an extended Kalman filter, and other means (e.g., particle<br />

filters, multiple-hypothesis filters, information filters) must<br />

be used at least initially to get within the linear range of an<br />

extended Kalman filter.<br />

The form of (16) indicates that accurate estimation of the<br />

multipath parameters {w, c} depends on meeting several<br />

conditions: 1) relatively accurate tag location estimates<br />

over a sufficient length of time, 2) tag motion sufficient to<br />

ensure observability of the parameters, 3) relatively small<br />

variation of the of multipath parameters as the tag moves<br />

through the indoor environment, and 4) persistence of<br />

the sequence of reflections. In the sequel, it is shown for a<br />

representative indoor scenario that the parameter variations<br />

tend to be relatively small as the tag moves through space,<br />

allowing reasonably accurate estimates of the multipath<br />

parameters to be obtained.<br />

Data Association<br />

A generic measurement data association algorithm is<br />

depicted in Figure 4. At any time, data for all current and<br />

past detected indirect paths are stored, both as all past raw<br />

measurement associated with that path and the coefficients<br />

of low-order ordinary least squares regression models of<br />

the path delays. When a new measurement is obtained,<br />

the distance to all current paths is calculated by comparing<br />

the predicted values in the current database with the<br />

new value. If the minimum distance is less than a prespecified<br />

threshold, then the closest current path is updated,<br />

including the regression model. If the distance exceeds the<br />

threshold, a new indirect path is started. Note that new<br />

indirect paths may be started if a new path appears, an old<br />

path reappears, or a current path changes by a relatively<br />

large amount due to tag motion since the last measurement<br />

of that indirect path. The output of the data association<br />

algorithm is the identity of the path associated with the<br />

current measurement.<br />

Step 1<br />

Step 2<br />

New<br />

measurement<br />

(y)<br />

Start new path<br />

Prediction based on<br />

OLS path model<br />

Find distance to current<br />

closest path<br />

Figure 4. Generic measurement data association<br />

algorithm.<br />

8 Innovative Indoor Geolocation Using RF Multipath Diversity<br />

no<br />

d, k<br />

d 0 is used in the filter to model the uncertainty<br />

associated with the unknown control u(i − 1).<br />

From (16), the indirect path length measurements are<br />

modeled as<br />

,<br />

,<br />

(22)<br />

where n(i) is zero-mean Gaussian measurement error.<br />

Updating at a measurement is performed using the extended<br />

Kalman filter update equations (cf., Reference [11])<br />

where<br />

(23)<br />

is the measurement residual and K(i) is the optimal gain<br />

matrix:<br />

where<br />

(24)

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!