Bayesian Cramer-Rao Lower Bound for Magnetic Field-Based Localization

被引:2
|
作者
Siebler, Benjamin [1 ]
Sand, Stephan [1 ]
Hanebeck, Uwe D. [2 ]
机构
[1] German Aerosp Ctr DLR, Inst Commun & Nav, D-82234 Oberpfaffenhofen, Germany
[2] Karlsruhe Inst Technol KIT, Intelligent Sensor Actuator Syst Lab, D-76131 Karlsruhe, Germany
关键词
Bayesian Cramer-Rao lower bound; finger-printing; Gaussian process; indoor localization; magnetic field-based localization; particle filter; INDOOR LOCALIZATION;
D O I
10.1109/ACCESS.2022.3223693
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we show how to analyze the achievable position accuracy of magnetic localization based on Bayesian Cramer-Rao lower bounds and how to account for deterministic inputs in the bound. The derivation of the bound requires an analytical model, e.g., a map or database, that links the position that is to be estimated to the corresponding magnetic field value. Unfortunately, finding an analytical model from the laws of physics is not feasible due to the complexity of the involved differential equations and the required knowledge about the environment. In this paper, we therefore use a Gaussian process (GP) that approximates the true analytical model based on training data. The GP ensures a smooth, differentiable likelihood and allows a strict Bayesian treatment of the estimation problem. Based on a novel set of measurements recorded in an indoor environment, the bound is evaluated for different sensor heights and is compared to the mean squared error of a particle filter. Furthermore, the bound is calculated for the case when only the magnetic magnitude is used for positioning and the case when the whole vector field is considered. For both cases, the resulting position bound is below 10 cm indicating an high potential accuracy of magnetic localization.
引用
收藏
页码:123080 / 123093
页数:14
相关论文
共 50 条
  • [1] Bayesian Cramer-Rao Lower Bounds for Magnetic Field-based Train Localization
    Siebler, Benjamin
    Sand, Stephan
    Hanebeck, Uwe D.
    [J]. 2023 IEEE/ION POSITION, LOCATION AND NAVIGATION SYMPOSIUM, PLANS, 2023, : 814 - 820
  • [2] THE BAYESIAN CRAMER-RAO LOWER BOUND IN ASTROMETRY
    Mendez, R. A.
    Echeverria, A.
    Silva, J.
    Orchard, M.
    [J]. VII REUNION DE ASTRONOMIA DINAMICA EN LATINOAMERICA (ADELA 2016), 2018, 50 : 23 - 24
  • [3] THE BAYESIAN CRAMER-RAO LOWER BOUND IN ASTROMETRY
    Mendez, R. A.
    Echeverria, A.
    Silva, J.
    Orchard, M.
    [J]. XV LATIN AMERICAN REGIONAL IAU MEETING, 2016, 2017, 49 : 52 - 52
  • [4] THE BAYESIAN CRAMER-RAO LOWER BOUND IN PHOTOMETRY
    Espinosa, Sebastian
    Silva, Jorge F.
    Mendez, Rene A.
    Orchard, Marcos
    [J]. VII REUNION DE ASTRONOMIA DINAMICA EN LATINOAMERICA (ADELA 2016), 2018, 50 : 50 - 51
  • [5] Lognormal Mixture Cramer-Rao Lower Bound for Localization
    Buyukcorak, Saliha
    Kurt, Gunes Karabulut
    Yongacoglu, Abbas
    [J]. 2015 INTERNATIONAL WIRELESS COMMUNICATIONS & MOBILE COMPUTING CONFERENCE (IWCMC), 2015, : 132 - 136
  • [6] A New Cramer-Rao Lower Bound for TOA-based Localization
    Jia, Tao
    Buehrer, R. Michael
    [J]. 2008 IEEE MILITARY COMMUNICATIONS CONFERENCE: MILCOM 2008, VOLS 1-7, 2008, : 1507 - 1511
  • [7] A Cramer-Rao Lower Bound of CSI-Based Indoor Localization
    Gui, Linqing
    Yang, Mengxia
    Yu, Hai
    Li, Jun
    Shu, Feng
    Xiao, Fu
    [J]. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2018, 67 (03) : 2814 - 2818
  • [8] Bayesian Periodic Cramer-Rao Bound
    Routtenberg, Tirza
    Tabrikian, Joseph
    [J]. IEEE SIGNAL PROCESSING LETTERS, 2022, 29 : 1878 - 1882
  • [9] MODIFIED BAYESIAN CRAMER-RAO LOWER BOUND FOR NONLINEAR TRACKING
    Ozdemir, Onur
    Niu, Ruixin
    Varshney, Pramod K.
    Drozd, Andrew L.
    [J]. 2011 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, 2011, : 3972 - 3975
  • [10] A TIGHTER BAYESIAN CRAMER-RAO BOUND
    Bacharach, Lucien
    Fritsche, Carsten
    Orguner, Umut
    Chaumette, Eric
    [J]. 2019 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2019, : 5277 - 5281