. 2016 Feb 4;16(2):193. doi: 10.3390/s16020193

Table 1.

Parameters included in the map-matching algorithm.

Parameters
Point-to-point distance	$W_{d 2} = K_{d} \cdot [1 - \frac{\bar{d} (G N S S, l i n k k)}{R}]$	(1)
Perpendicular distance	$W_{d} = K_{d 2} \cdot [1 - \frac{d (G N S S, l i n k k)}{R}]$	(2)
Direction	$W_{a} = K_{a} \cdot \| c o s \propto_{k} \|$	(3)
Belonging	$W_{b} = K_{b} \cdot β_{k}$	(4)
Perpendicularity	$W_{p} = {\begin{matrix} K_{p} i f t h e c o n d i t i o n i s s a t i s f i e d \\ 0 i f t h e c o n d i t i o n i s n o t s a t i s f i e d \end{matrix}$	(5)
Segment s Final Weight
$W_{T, s} = \frac{\sum_{k = 1}^{n_{s}} (W_{a, k} + W_{b, k} + W_{d, k} + W_{d 2, k})}{n_{s}} + W_{p, k}$		(6)