{"title":"Localization in NLOS environments using TOA, AOD, and Doppler-shift","authors":"Behailu Y. Shikur, T. Weber","doi":"10.1109/WPNC.2014.6843297","DOIUrl":null,"url":null,"abstract":"In this paper, we consider localization in non-line-of-sight environments. We present algorithms to estimate the most likely position or the most likely trajectory of a mobile station given a sequence of time-of-arrival, angle-of-departure, and doppler-shift observations. Discretized positions are considered for computational feasibility of the proposed algorithms. The mobility model of the mobile station is defined by a Markov model. The most likely position and the most likely trajectory of the mobile station are efficiently computed using the forward-backward algorithm and the Viterbi algorithm, respectively given the whole sequence of observations. An online Bayesian recursive algorithm which estimates the most probable position of the mobile station is also proposed. It is shown, through simulations, that we can get a satisfactory performance given that the mobile station is not stationary during the course of the tracking time.","PeriodicalId":106193,"journal":{"name":"2014 11th Workshop on Positioning, Navigation and Communication (WPNC)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 11th Workshop on Positioning, Navigation and Communication (WPNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WPNC.2014.6843297","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
Abstract
In this paper, we consider localization in non-line-of-sight environments. We present algorithms to estimate the most likely position or the most likely trajectory of a mobile station given a sequence of time-of-arrival, angle-of-departure, and doppler-shift observations. Discretized positions are considered for computational feasibility of the proposed algorithms. The mobility model of the mobile station is defined by a Markov model. The most likely position and the most likely trajectory of the mobile station are efficiently computed using the forward-backward algorithm and the Viterbi algorithm, respectively given the whole sequence of observations. An online Bayesian recursive algorithm which estimates the most probable position of the mobile station is also proposed. It is shown, through simulations, that we can get a satisfactory performance given that the mobile station is not stationary during the course of the tracking time.