Table - PMC

Skip to main content

View full-text article in PMC

. 2019 Aug 22;19(17):3658. doi: 10.3390/s19173658

Algorithm 1 Localization algorithm.

1:
if $S P_{i} (t - 1) n o t s e t$ then
2:
$/ /$ TAGi $h a s n o t b e e n l o c a l i z e d b e f o r e$
3:
$S P_{i} (t) \leftarrow C P_{i} (t)$
4:
$P (S P_{i} (t)) \leftarrow P_{e n t r y}$
5:
else
6:
if $C P_{i} (t) = S P_{i} (t - 1)$ then
7:
$/ /$ TAGi $d i d n^{'} t m o v e f r o m t h e l a s t a n t e n n a$
8:
$S P_{i} (t) \leftarrow C P_{i} (t)$
9:
$P (S P_{i} (t)) \leftarrow P (S P_{i} (t - 1)) + P_{d e l t a}$
10:
if $C P_{i} (t) \neq S P_{i} (t - 1)$ then
11:
if $a d j a c e n t (C P_{i} (t), S P_{i} (t - 1))$ then
12:
$/ /$ TAGi $m o v e d t o a n a d j a c e n t a n t e n n a$
13:
$S P_{i} (t) \leftarrow C P_{i} (t)$
14:
$P (S P_{i} (t)) \leftarrow P_{e n t r y}$
15:
else
16:
$/ /$ TAGi $i s c o n s t r a i n e d$
17:
if $P (S P_{i} (t - 1)) > P_{m i n}$ then
18:
$/ /$ TAGi $c a n n o t j u m p$
19:
$S P_{i} (t) \leftarrow S P_{i} (t - 1)$
20:
$P (S P_{i} (t)) \leftarrow P (S P_{i} (t - 1)) - P_{d e l t a}$
21:
else
22:
$/ /$ TAGi $c a n j u m p$
23:
$S P_{i} (t) \leftarrow C P_{i} (t)$

24:
$P (S P_{i} (t)) \leftarrow P (S P_{i} (t - 1)) + P_{d e l t a}$