Use of Area Layout Information for RSSI-Based Indoor Target Tracking Methods

Daisuke ANZAI; Kentaro YANAGIHARA; Kyesan LEE; Shinsuke HARA

doi:10.1587/transcom.E94.B.1924

Use of Area Layout Information for RSSI-Based Indoor Target Tracking Methods

Daisuke ANZAI, Kentaro YANAGIHARA, Kyesan LEE, Shinsuke HARA

Full Text Views

0

Share
Cite this

Summary :

For an indoor area where a target node is tracked with anchor nodes, we can calculate the priori probability density functions (pdfs) on the distances between the target and anchor nodes by using its shape, three-dimensional sizes and anchor nodes locations. We call it “the area layout information (ALI)” and apply it for two indoor target tracking methods with received signal strength indication (RSSI) assuming a square location estimation area. First, we introduce the ALI to a target tracking method which tracks a target using the weighted sum of its past-to-present locations by a simple infinite impulse response (IIR) low pass filter. Second, we show that the ALI is applicable to a target tracking method with a particle filter where the motion of the target is nonlinearly modelled. The performances of the two tracking methods are evaluated by not only computer simulations but also experiments. The results demonstrate that the use of ALI can successfully improve the location estimation performance of both target tracking methods, without huge increase of computational complexity.

Publication: IEICE TRANSACTIONS on Communications Vol.E94-B No.7 pp.1924-1932

Publication Date: 2011/07/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1587/transcom.E94.B.1924

Type of Manuscript: PAPER

Category: Network

Cite this

Copy

Daisuke ANZAI, Kentaro YANAGIHARA, Kyesan LEE, Shinsuke HARA, "Use of Area Layout Information for RSSI-Based Indoor Target Tracking Methods" in IEICE TRANSACTIONS on Communications, vol. E94-B, no. 7, pp. 1924-1932, July 2011, doi: 10.1587/transcom.E94.B.1924.
Abstract: For an indoor area where a target node is tracked with anchor nodes, we can calculate the priori probability density functions (pdfs) on the distances between the target and anchor nodes by using its shape, three-dimensional sizes and anchor nodes locations. We call it “the area layout information (ALI)” and apply it for two indoor target tracking methods with received signal strength indication (RSSI) assuming a square location estimation area. First, we introduce the ALI to a target tracking method which tracks a target using the weighted sum of its past-to-present locations by a simple infinite impulse response (IIR) low pass filter. Second, we show that the ALI is applicable to a target tracking method with a particle filter where the motion of the target is nonlinearly modelled. The performances of the two tracking methods are evaluated by not only computer simulations but also experiments. The results demonstrate that the use of ALI can successfully improve the location estimation performance of both target tracking methods, without huge increase of computational complexity.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/transcom.E94.B.1924/_p

Copy

@ARTICLE{e94-b_7_1924,
author={Daisuke ANZAI, Kentaro YANAGIHARA, Kyesan LEE, Shinsuke HARA, },
journal={IEICE TRANSACTIONS on Communications},
title={Use of Area Layout Information for RSSI-Based Indoor Target Tracking Methods},
year={2011},
volume={E94-B},
number={7},
pages={1924-1932},
abstract={For an indoor area where a target node is tracked with anchor nodes, we can calculate the priori probability density functions (pdfs) on the distances between the target and anchor nodes by using its shape, three-dimensional sizes and anchor nodes locations. We call it “the area layout information (ALI)” and apply it for two indoor target tracking methods with received signal strength indication (RSSI) assuming a square location estimation area. First, we introduce the ALI to a target tracking method which tracks a target using the weighted sum of its past-to-present locations by a simple infinite impulse response (IIR) low pass filter. Second, we show that the ALI is applicable to a target tracking method with a particle filter where the motion of the target is nonlinearly modelled. The performances of the two tracking methods are evaluated by not only computer simulations but also experiments. The results demonstrate that the use of ALI can successfully improve the location estimation performance of both target tracking methods, without huge increase of computational complexity.},
keywords={},
doi={10.1587/transcom.E94.B.1924},
ISSN={1745-1345},
month={July},}

Copy

TY - JOUR
TI - Use of Area Layout Information for RSSI-Based Indoor Target Tracking Methods
T2 - IEICE TRANSACTIONS on Communications
SP - 1924
EP - 1932
AU - Daisuke ANZAI
AU - Kentaro YANAGIHARA
AU - Kyesan LEE
AU - Shinsuke HARA
PY - 2011
DO - 10.1587/transcom.E94.B.1924
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E94-B
IS - 7
JA - IEICE TRANSACTIONS on Communications
Y1 - July 2011
AB - For an indoor area where a target node is tracked with anchor nodes, we can calculate the priori probability density functions (pdfs) on the distances between the target and anchor nodes by using its shape, three-dimensional sizes and anchor nodes locations. We call it “the area layout information (ALI)” and apply it for two indoor target tracking methods with received signal strength indication (RSSI) assuming a square location estimation area. First, we introduce the ALI to a target tracking method which tracks a target using the weighted sum of its past-to-present locations by a simple infinite impulse response (IIR) low pass filter. Second, we show that the ALI is applicable to a target tracking method with a particle filter where the motion of the target is nonlinearly modelled. The performances of the two tracking methods are evaluated by not only computer simulations but also experiments. The results demonstrate that the use of ALI can successfully improve the location estimation performance of both target tracking methods, without huge increase of computational complexity.
ER -