.png){kind=icon}
返回
Optimal Range-Difference-Based Localization Considering Geometrical Constraints
.png){kind=icon}
PRE
AI
DOI：10.1109/JOE.2008.926960.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper proposes a new type of algorithm aimed at finding the traditional maximum-likelihood (TML) estimate of the position of a target given time-difference-of-arrival (TDOA) information, contaminated by noise. The novelty lies in the fact that a performance index, akin to but not identical with that in maximum likelihood (ML), is a minimized subject to a number of constraints, which flow from geometric constraints inherent in the underlying problem. The minimization is in a higher dimensional space than for TML, and has the advantage that the algorithm can be very straightforwardly and systematically initialized. Simulation evidence shows that failure to converge to a solution of the localization problem near the true value is less likely to occur with this new algorithm than with TML. This makes it attractive to use in adverse geometric situations.
Keyword:
Localization
range difference
sensor networks
target tracking
time-difference-of-arrival (TDOA)
期刊
IF:
5.3
论文数:
2.6K
被引数:
7.4K
机构
引用论文
Adaptation in rapidly time-varying environments using coefficient filters.png)
[Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing
[Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal ProcessingIF0
PREAI
分享收藏
查看更多内容