{'fraction_non_alphanumeric': 0.03472941481097877, 'fraction_numerical': 0.006505696530295184, 'mean_word_length': 4.429098576700053, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Accurate and Robust Indoor Localization Systems using Ultra-wideband Signals

Indoor localization systems that are accurate and robust with respect to propagation channel conditions are still a technical challenge today. In particular, for systems based on range measurements from radio signals, non-line-of-sight (NLOS) situations can result in large position errors. In this paper, we address these issues using measurements in a representative indoor environment. Results show that conventional tracking schemes using high- and a low-complexity ranging algorithms are strongly impaired by NLOS conditions unless a very large signal bandwidth is used. Furthermore, we discuss and evaluate the performance of multipath-assisted indoor navigation and tracking (MINT), that can overcome these impairments by making use of multipath propagation. Across a wide range of bandwidths, MINT shows superior performance compared to conventional schemes, and virtually no degradation in its robustness due to NLOS conditions.


I. INTRODUCTION
Indoor localization systems face many difficulties when they are to be deployed in practice [1]. Optical systems might become unusable in emergency situations due to fire and smoke; signal strength based systems are sensitive to fading effects; fingerprinting systems need dedicated training phases; etc. Range-measurement-based systems using radio signals, which are in the focus of this paper, offer advantages like the capability of being integrated in existing radio devices such as smartphones, the potential of low-power implementations and moderate infrastructure requirements. However, they face challenging performance impairments caused by propagation effects like strong reflections or diffuse scattering.
To counter these impairments, a large signal bandwidth is beneficial for two main reasons: First, the temporal resolution and therefore the attainable accuracy is increased. Second, the line-of-sight (LOS) path can be separated from other signal parts easier, which improves the robustness, i.e. the percentage of cases in which the attainable accuracy can be achieved. For these reasons, systems using ultra-wideband (UWB) signals are promising candidates for both accurate and robust indoor localization [2].
In this paper, we examine the performance of a conventional range-based UWB indoor localization and tracking system in a representative indoor environment with several anchor nodes. Using channel measurements along a reference trajectory, mimicking the walking path of a pedestrian user, we show the dependence of the robustness and accuracy of the localization on changing propagation conditions. The LOS path is estimated using the maximum-likelihood method as well as using a low-complexity ranging algorithm. These estimates are provided as inputs to an extended Kalman filter (EKF), which tracks the user's position. The presence of strong reflections in the measurement signal can lead to a large bias in the estimate of the propagation delay of the direct path between user and anchor. This is especially true in non-LOS (NLOS) situations, where the direct path is blocked. Overall, a degradation of the robustness of the system is the result.
Usual countermeasures are to detect such situations based on signal statistics and discard the corresponding measurements [3], [4]. In advanced schemes like [5], [6], machine learning techniques are used to mitigate the range bias in NLOS situations. However, these approaches discard positionrelated information that is inherent in the geometric structure of reflected MPCs. The usefulness of this information has been shown in [7]- [10].
We have shown in previous work [9]- [11] that by using additional floor plan information, these reflected signal paths can be used for localization. Extracting these paths from the channel measurements and associating them to the floor plan, signal reflections can be seen as direct signals coming from virtual anchor (VA) nodes. In this way, one physically existing anchor node is turned into a set of virtual anchors, and NLOS situations no longer render this anchor useless for localization. This scheme, which we call multipath-assisted indoor navigation and tracking (MINT), can thus deliver the desired robustness with respect to the propagation conditions. However, the effect of diffuse scattering is especially pronounced in indoor environments due to the presence of objects like, e.g., furniture. This makes the extraction of the reflected components from the measurements and the required data association challenging. To highlight these issues in a practical setting, this paper extends our previous work in [11] with the use of multiple base stations, a detailed performance analysis of the proposed algorithms and a comparison to standard tracking schemes employed in indoor localization.
The key contributions of this work are: • We show the performance and the robustness issues of a conventional, EKF based tracking system with respect to channel conditions. This is done in a representative indoor environment using measured signals. • Making explicit use of multipath, robustness and accuracy can be increased. We discuss an implementation of the proposed MINT approach and examine its performance. ations for indoor localization systems, i.e. the importance of a large bandwidth and propagation channel conditions is shown.
This paper is organized as follows: Section II explains the scenario, the measurement campaign and the geometrical modeling of the environment. A short overview over performance bounds for MINT is given in Section III, while Section IV discusses channel estimation and ranging algorithms. Tracking is explained in Section V and a detailed discussion of results is given in Section VI.
II. SCENARIO, MEASUREMENTS, AND GEOMETRIC MODELING Fig. 1 shows the scenario used in this paper. It is the ground floor of a large three-storey building with open ceilings in the corridor areas in all but the uppermost floors. Walls are made of reinforced concrete (shown as black outer lines) and doors (shown in grey) are made of metal. The long grey outer lines on the upper and lower side are large windows with some metal pillars in-between. We placed four base stations (BSs) at known locations and measured the UWB channel between them and a moving agent. The latter was moved along a trajectory consisting of 220 points spaced by 10 cm. The obstruction shown near the center of the corridor has not been present in the measurements. It is introduced artificially in the performance evaluations to show the influence of NLOS scenarios on the localization, c.f. Section VI.

A. Geometric Modeling of the Environment
If a floor plan of the building is available, the BS positions a i , i = 1, . . . , 4, can be mirrored with respect to reflecting surfaces like walls to obtain so-called first-order virtual anchors (VAs) at positions a ′ i . Using these, the procedure can be repeated to obtain second-order VAs a ′′ i , and so on. The visibility regions of these VAs, i.e. the regions where the corresponding reflections are possible, can be computed by ray tracing as explained in [12]. If the corresponding MPCs are detectable at the moving agent, they can be associated to the VAs and used for localization. Fig. 1 shows a subset of VAs for BSs 3 and 4 together with two example signal paths.
In an analogous manner to [11], the overall set of VAs for the i-th BS is denoted as Here, the superscript indicating the VA order has been dropped as it is not important in the upcoming discussion. A function f vis (a j , p) determines the visibility of the j-th VA at a position p, i.e.
The set of expected visible VAs at a specific position p ℓ can then be computed evaluating (2) for all VAs in (1) In the following, we omit the BS index i wherever it should be clear from the context that the respective quantity exists for all BSs. It can be seen from (3) that a set of anchor nodes significantly larger than the set of BSs can potentially used for localization. We call this approach multipath-assisted indoor navigation and tracking (MINT). However, the challenges are as manifold as the potential gains: First, the MPCs corresponding to the VAs need to be detected in the signal received at the agent, which depends on influences such as e.g. material parameters or reflection angles. Second, together with deterministic MPCs, also some scattered, non-specular components will cause a certain level of clutter in the measurements. Third, the detected MPCs need to be associated to the VAs to make their position-related information accessible. Summarizing, a moving agent needs to perform detection of MPCs in the presence of possibly strong diffuse multipath and noise as well as subsequently a robust data association procedure to infer its location.

B. Channel Measurements
Measurements were performed in the frequency domain with a vector network analyzer (VNA) over the full FCC bandwidth from 3.1 to 10.6 GHz. These measurements have also been used in [10]- [12]. The discrete frequency representation of the channel's transfer function at position p ℓ is denoted as H ℓ [k]. Using a frequency spacing of ∆f , it corresponds to a Fourier series (FS) of a time-domain channel impulse response (CIR) h ℓ (τ ). This CIR is periodic with a period of τ max = 1/∆f , which is the maximum resolvable delay. The FS representation allows an arbitrarily fine time resolution ∆τ to be achieved. Using an IFFT with size N FFT = ⌈(∆f ∆τ ) −1 ⌉, the time domain equivalent baseband signal is obtained as In (4), S[k] is the discrete frequency domain representation of a raised-cosine pulse s(t) with pulse duration T p and roll-off factor β R [13]. It is used to cut out the desired band of the signal as well as to filter it to facilitate an MPC estimation algorithm. The frequencies f c and f 0 are the desired center frequency and the lower band edge of the extracted band, respectively. This procedure is similar to [14]. Examples for r ℓ (τ ) obtained in this way are shown in Fig. 2 for BS 3 over the trajectory.

III. CHANNEL INFLUENCE ON LOCALIZATION
The received signal at the ℓ-th trajectory position p ℓ , corresponding to the processing in (4), is modeled as [9] It consists of a sum of K ℓ deterministic MPCs, scaled and shifted by the complex amplitudes α k,ℓ and propagation delays τ k,ℓ , respectively. The signal ν ℓ (t) is a stochastic process modeling the diffuse multipath (DM), i.e. diffuse scattering at rough surfaces and other propagation mechanisms that are not captured by the specular part of the channel. It is observed at the agent as a convolution with the transmit pulse s(t). Finally, w ℓ (t) denotes additive white Gaussian noise (AWGN) with two-sided power spectral density N 0 /2. We expect that the deterministic part of r ℓ (t) can be modeled by the set of VAs A ℓ . In [9], we have derived the Cramér-Rao lower bound (CRLB) on the position error for the MINT scheme, based on the received signal r ℓ (t). It is given as the inverse of the equivalent Fisher Information matrix (EFIM) [8]. If all K ℓ deterministic MPCs are orthogonal at p ℓ , i.e. there is no path overlap in the delay domain, the EFIM can be decomposed as where β denotes the effective (RMS) bandwidth of s(t) and c is the speed of light. The decomposition is instructive since it separates the channel's influence from the geometry of the VAs. The former is given by the signal-to-interference-plusnoise-ratio (SINR) of the deterministic MPCs. For the k-th MPC at position p ℓ , it is defined as [9] Here, interference is understood as the contribution of the DM, which is given by the power delay profile (PDP) of the DM, S ν,ℓ at the delay τ k,ℓ of the respective MPC, scaled with the pulse duration. This PDP is defined as the second central moment of the DM process ν ℓ (t).
The influence of the geometry is accounted for by the ranging direction matrix J r (φ k,ℓ ) [8], [9], which is defined as This matrix has one eigenvector pointing in the direction φ k,ℓ , the angle from the VA at a k to position p ℓ . The SINR in (7) is used in the performance evaluations to emulate changes of propagation conditions caused by the artificial obstruction that is shown in Fig. 1.

IV. CHANNEL ESTIMATION AND RANGING
Conventional time-of-arrival (ToA) localization requires an estimate of the time-of-flight of the signal from the BS to the agent. This process is called ranging [15]. In this work, we consider two different ranging algorithms, maximum likelihood (ML) and jump-back search-forward (JBSF). The former is computationally intensive since it requires channel estimation, while the latter is a popular low-complexity algorithm. The MINT approach requires range estimates to all the MPCs that are modeled by VAs, i.e., an estimation of the deterministic part of the UWB channel as for ML ranging.

A. Channel Estimation and ML Ranging
It has been shown that the MPCs corresponding to the VAs can carry a large fraction of the energy of the received signal [12], hence we extract thoseK ℓ MPCs that result in the minimum energy of the difference signal where T is the observation interval. Of course the parameter K ℓ should be related to K ℓ in (5). However, without the knowledge of the position, a value has to be chosen that allows for the extraction of the geometrically relevant paths over the entire scenario. The choice of this parameter will be discussed in Section VI-B.
For this work, we assume a separable channel, i.e. there is no overlap between deterministic MPCs. In this case, (9) can be performed path-per-path. The amplitudes α k,ℓ are nuisance parameters to this estimation and can be obtained by a projection of the unit-energy pulse s(t), shifted to the estimated delayτ k,ℓ , onto the received signal where * denotes complex conjugation. With the separable channel assumption, this procedure is similar to [16]. For MINT, the set of estimated arrival times in (9), converted to distances, constitutes the measurement input to the tracking algorithms. Additionally, a data association (DA) scheme is necessary, which will be described in Section V-A. For ML ranging, only the propagation delay of the first arriving path, the LOS path, is interesting and can be obtained from (9) asτ (ML)

B. Jump-back Search-forward (JBSF) Ranging
If real-time localization is desired, a channel estimation like (9) might not be feasible. JBSF is a threshold-based ranging algorithm that also works for low-complexity receiver structures like energy detectors [15]. Backwards from the maximum of the received signal at delay τ max , a search-back window of length τ sb is defined. The JBSF range estimate is the minimum delay within this window that exceeds a certain threshold τ (JBSF) LOS,ℓ = min{τ : τ max − τ sb ≤τ ≤ τ max , |r ℓ (τ )| ≥ A ξ }.
(12) The choice of the threshold A ξ is usually based on the noise level.
An illustrative example for the channel estimation and ranging algorithms is given in Fig. 3. In this case, the LOS path is not separable from the rest of the channel. Since the amplitude of the second arriving MPC is larger, it is detected in an earlier iteration of the ML estimator. Due to the separable channel assumption, the ML estimator is constrained not to estimate any MPCs within one T p of already detected ones, hence the LOS path is not detected. However, the LOS component is above the threshold of JBSF and within its search-back window, so JBSF can outperform the ML estimator in this case.

V. TRACKING AND DATA ASSOCIATION
The conventional tracking schemes based on ranging and the MINT approach are both implemented in this work using extended Kalman filters (EKFs) [17], [18] employing linearized observation equations for the estimated path delays. As in [11], we use a simple constant-velocity state-space model of the moving agent node. Stacking the position p = [p x , p y ] T and velocity Here, ∆T is the update interval and n a,ℓ denotes the driving process noise, which allows for motion at non-constant velocity. The measurement inputs for the conventional tracking scheme using EKFs are either the ML or JBSF ranging estimates. Using (11) or (12), ranging is performed to each of the four BSs. The entries of the vector of distance estimates are obtained as z

A. MINT Using EKF with Data Association (DA)
For the MINT scheme implemented using an EKF, the MPC estimation in (9) only results in an unordered set of distance estimates, i.e. Z (i) To obtain a suitable input for the observation equations of the EKF, a DA scheme is necessary. As the association to the BS is known, we only consider the DA for one BS and drop the index i. After the DA, all associated distance estimates are stacked into one measurement vector.
The employed DA approach is the same as used in [11] and is just shortly re-sketched here. We introduce a set C ℓ of correspondence variables [19], whose n-th entry c ℓ,n represents the association of the n-th entry of Z ℓ and is defined as c ℓ,n = j, if z ℓ,n corresponds to VA a j (j = 1, . . . , N VA ) 0, if z ℓ,n corresponds to clutter. (14) Using the predicted position of the EKF, p − ℓ , the set of expected visible VAs A ℓ can be computed using (2) and (3). From this, the set of expected path lengths, denoted as D ℓ , can be obtained by calculating the Euclidean distances d(a j , p − ℓ ) between all VAs a j ∈ A ℓ and the position p − ℓ . The task of the DA is now to match the two sets Z ℓ and D ℓ in an optimum way.
The approach used is optimal sub-pattern assignment [20]. Noting that the cardinality of D ℓ is K ℓ (c.f. (3)) and assuming thatK ℓ ≥ K ℓ , which can always be ensured by filling up Z ℓ with dummy clutter, we search the sub-pattern of Z ℓ that fits best to the set D ℓ . Using a distance function d (dc) (·), that simply saturates at the cut-off distance d c , this is expressed as Here, ΠK ℓ is the set of permutations of positive integers up toK ℓ and the vector π opt holds the permutation with the minimum cumulative distance in the sense of the cutoff distance function d (dc) (·). Hence, the first K ℓ entries of π opt contain the indices of those entries of Z ℓ that have been optimally assigned to D ℓ . As a last step in the DA process, we reject those measurements for which d (dc) (d ℓ,i , z ℓ,πopt,i ) = d c , i.e. those that have been assigned at a distance greater or equal than the cutoff distance. This is done to have a mechanism to tune the DA to the uncertainty in the MPC delay estimates. As UWB signals are used, if an MPC is detectable at all, its delay will have a relatively small uncertainty that depends on the used pulse duration T p and the inaccuracies of the floor plan. Hence, the correspondence variables in (14) are obtained as The optimal sub-pattern assignment can be efficiently implemented using the Munkres algorithm [21].

B. Genie-aided Data Association (GADA) for Evaluation
The DA discussed above depends crucially on the EKF's predicted position p − ℓ . To enable an evaluation of the localization performance where the errors due to false DA are mostly eliminated, we use a so-called genie-aided version of the DA (GADA). The GADA relies on the true position p ℓ for performing the DA, i.e. in the calculation of the set D ℓ . This can be used to benchmark the usefulness of the MPC delay estimates for localization using MINT.

VI. RESULTS
This section illustrates the accuracy and robustness of the proposed indoor tracking algorithms for the scenario in Fig. 1. A first rough evaluation of the propagation conditions can be obtained by evaluating the K-factor with respect to the LOS component, i.e. the ratio of its energy to the energy of the rest of the CIR. It is estimated using (9) and (10), where only the LOS component is subtracted from r ℓ (t), i.e.  Fig. 4 showsK LOS,ℓ for all BSs over the trajectory, estimated using the original measurements (without the obstruction) with T p = 0.5 ns. Some geometric influences, like the drop in K LOS in the NLOS regions of BSs 3 and 4 or the general distance dependence can be easily observed. Other causes of large variations are not immediately intuitive and require more careful inspection of the local propagation conditions. For example, the drop of K LOS for BS 1 around position 90 is due to strong scattered components from metal pillars within the lower windows, c.f. Fig. 1.

A. Evaluation Setup
The "obstruction" introduced in Fig. 1 is meant to model a change in the propagation environment, e.g. a group of people. As it causes NLOS regions for all BSs, its influence on the tracking performance is interesting. MINT is not aware of this obstruction in its floor plan knowledge. The original channel measurements where performed without this obstruction, hence they need to be modified. For this, we calculate the positions which are now in NLOS due to the changed conditions. At these positions, we reduce K LOS by a factor of 10 dB, which is done by subtracting the LOS component and adding it again with a suitable amplitude and its original phase. To enable a fair comparison with MINT, we also change the amplitudes of all the MPCs affected by the change in visibility conditions. We do so by reducing their SINR (7) also by 10 dB. Note that this factor leaves the LOS component still detectable in most cases, while for the later arriving MPCs it causes an effective loss of the respective component Using a roll-off factor of β R = 0.5, the center frequency is always f c = 7 GHz, except for T p = 0.2 ns which corresponds to the full measurement bandwidth, hence the overall center frequency f c = 6.85 GHz has to be used. Table I contains an overview of all relevant parameters for these setups.
b) EKF parameters: The EKF's measurement noise covariance matrix is R = σ 2 z I, where I is the identity matrix. For the variance σ 2 z , we choose values based on the expected ranging uncertainty, i.e. it is slightly increased with the pulse duration T p . The same consideration applies for the DA cutoff distance d c used in (15) and (16). Table I lists the values used in the different measurement parameter setups.
The choice of the process noise variance σ 2 a depends on the maximum velocity in e.g. the x-direction, denoted as v x,max . The process noise, assumed to be Gaussian, should allow movement at this velocity. Hence, we select the 3σ point of the velocity noise as v x,max and obtain for the corresponding process noise variance in the acceleration domain In this paper, we choose to model pedestrian motion and set v x,max = 1.5 m/s. The update interval is ∆T = 0.1 s, resulting in a magnitude of the velocity in xor y-direction of 1 m/s along straight segments of the trajectory. The conventional tracking schemes and MINT always use the same σ 2 z and σ 2 a for every pulse duration considered. c) Initialization: All EKFs are initialized with the correct position and zero velocity. We note that this is a more challenging problem for MINT than for the conventional schemes, since the DA depends on the estimated position. However, we have addressed this problem for a different implementation of MINT in [22] using a Gaussian-sum filter [23]. In this approach, a bank of parallel weighted Kalman filters (KFs) is used to represent multiple initial position hypotheses. After convergence, the KFs with small weights can be discarded. This can also be applied for the MINT implementation in this paper. d) Channel estimation and ranging: The choice ofK ℓ in (9), i.e. the number of extracted components, is based on the average number of expected visible VAs in the localization environment. For the performance evaluations, we take into account VAs up to order two and fixK ℓ =K = 20. However, we define a threshold between the noise floor and the maximum amplitude of the received signal, below which no further MPCs are extracted. The noise signalŵ ℓ (t) is estimated from the pre-LOS part of r ℓ (t). Denoting the time average of a signal with · , the threshold is obtained as [12] A γ,ℓ = γ · (max{|r ℓ (t)|} − |ŵ ℓ (t)| ) + |ŵ ℓ (t)| .
In this paper, γ = 0.1 is used. The JBSF ranging threshold A ξ in (12) is also chosen using a relative threshold ξ, in the same manner as γ in (19). For every pulse duration used, we selected a threshold at which ranging works well in the unobstructed scenario, c.f. Table I. The length of the search-back window τ sb is chosen for each BS as the maximum distance between the BS and any firstorder VA, expressed in ns. This corresponds to the maximum delay difference of the LOS component and any first-order reflection. The reasoning behind this is the assumption that if the LOS component is not the maximum itself, then the maximum will be among the first-order MPCs. A value of 100 ns is selected for the geometry in Fig. 1. It approximately corresponds to the excess delay of the reflection path on the far right end of the corridor.

C. Ranging Performance Results
A comparison of the performance of ML and JBSF ranging algorithms in terms of the ranging error CDF is shown in Fig. 5 with and without the obstruction. A pulse duration of T p = 1 ns has been used for this. The most striking result is that JBSF closely approaches ML ranging for all cases, at a much lower computational complexity. One reason for the good performance of JBSF is the rather low noise level in the VNA measurements. However, when looking at the instantaneous ranging errors over the trajectory (not shown), some isolated outliers of JBSF can be observed. The implications for the localization performance will be discussed in the next subsection.

D. Localization and Tracking Performance Results
Table I contains detailed performance results in terms of RMS position error, the mean number of associated MPCs for MINT and the average horizontal dilution of precision (HDOP). The latter value is calculated as the average of the instantaneous HDOP values over the trajectory. These are the ratio of instantaneous position error and RMS ranging error [15], hence they provide snap-shots of the quality of the localization geometry. For MINT, the RMS ranging error is computed from those range estimates that have been associated to VAs by the DA procedure.
Looking at the RMS position error in Table I obtained using both ranging methods reveals that the EKF using ML ranging still clearly outperforms the one using JBSF. This behavior would not be suspected by looking at the ranging CDFs alone. The few isolated outliers of JBSF mentioned above cause the gap in localization performance. As this subsection shows, MINT does not show such robustness issues with respect to ranging outages. Fig. 6 contains the position error CDFs for all considered pulse durations. MINT using EKF-GADA always shows the best performance of all tracking algorithms. Although this is just an upper bound for this implementation of MINT, it shows the potential gain of exploiting multipath propagation. This is not only true for the achieved accuracy, but also for the robustness with respect to difficult propagation conditions, since MINT using EKF-GADA shows almost no performance loss for the obstructed scenario. Also with realistic DA, MINT is able to overcome impairments caused by the obstruction better than the conventional approaches. The conventional approaches show significant performance impairments, especially when the pulse duration is increased.   Fig. 1), in the right column, signals have been modified according to the obstruction.
Only for pulse durations of T p = 0.2 ns and T p = 1 ns, MINT with DA can not provide a performance gain. In the first case, the channel estimation can resolve very closely spaced MPCs that are challenging for the DA due to their clustered structure. In the second case, interference by pulse overlap situations causes the detection of several MPCs to fail. Since neither the channel estimation (9) nor the DA as proposed here can deal with path overlap situations, this is identified as an important topic for future research.
An unexpected result is obtained for T p = 4 ns, which, corresponding to a −3 dB bandwidth of 250 MHz, is no longer UWB by definition [24]. Although MINT generally benefits from a large bandwidth, it can yield the largest performance and robustness gain here. The conventional tracking schemes show outliers due to very large ranging biases, while MINT still exploits information from some MPCs, although their number decreases significantly (c.f. Table I). The mentioned large ranging biases are also the reason for the lower HDOP in the obstructed scenario in these parameter setups. Furthermore, it should be noted that in terms of the RMS position error, MINT using the EKF-DA always outperforms the conventional EKF approach using JBSF ranging.
An illustrative example for T p = 0.5 ns and the NLOS scenario is shown in Figs. 7 and 8. The estimated trajectories of the agent node are displayed in Fig. 7. While MINT and the EKF using ML range estimates can both follow the trajectory well, the EKF employing JBSF ranging is severely impaired by the NLOS regions of BSs 1 and 4 (at the start of the trajectory), BS 4 (around position 120, c.f. Fig. 1) and BS 3 and 2 (near the end of the trajectory). As Fig. 8 confirms, in the first two of these NLOS regions, rather large values of the instantaneous HDOP occur. This highlights the bad geometry for conventional schemes when there are ranging outages. For MINT, most of the HDOP values along the trajectory are below one, indicating excellent geometry for localization. This is due to the large set of virtual BSs spanned by the VAs (c.f. (6) and (8)).

VII. CONCLUSION AND FUTURE WORK
We have presented a comparison of conventional indoor UWB ranging and tracking schemes and an implementation of the proposed MINT approach using data from a measurement campaign in a representative indoor environment. The influence of NLOS situations on the accuracy and robustness of these systems has been investigated. Results confirm the potentials of MINT: Using floor plan information, multipath propagation can be efficiently used to obtain position-relevant information in situations where conventional approaches fail. Even at comparably low bandwidths, MINT shows a clear gain in localization performance.
Ongoing and future work includes the modeling of floor plan uncertainties and the combination of localization and channel estimation. The latter can be used to reduce the amount of clutter in the extracted path delay estimates. Also, other implementations of MINT, e.g. using soft classification in the data association, are within the scope of our work.

ACKNOWLEDGMENT
The authors thank Daniel Arnitz and Thomas Gigl for their invaluable help in the channel measurement campaign. This work was partly supported by the Austrian Science Fund (FWF) within the National Research Network SISE project