Review of range-based positioning algorithms
MetadataShow full item record
This tutorial reviews algorithms which turn measured ranges into position solutions. From their basic mathematical principles, we relate and compare relevant aspects of these algorithms. Special attention is given to the direct (non-iterative) algorithms, which are frequently applied in indoor positioning. Most of them are shown to be essentially the same, as they can be related through applying different weighting schemes. This tutorial is intended as a useful guide to help researchers and system designers evaluate and select appropriate range-based positioning algorithms for their applications at hand.
Copyright © 2013 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Showing items related by title, author, creator and subject.
Adaptive antenna array beamforming using a concatenation of recursive least square and least mean square algorithmsSrar, Jalal Abdulsayed (2011)In recent years, adaptive or smart antennas have become a key component for various wireless applications, such as radar, sonar and cellular mobile communications including worldwide interoperability for microwave ...
Tun, Min Han (2007)With the advancement of computer technology, demand for more accurate and intelligent monitoring systems has also risen. The use of computer vision and video analysis range from industrial inspection to surveillance. ...
Line, J.; Webster, R.; Pindor, B.; Mitchell, D.; Trott, Cathryn (2017)We present new software to cross-match low-frequency radio catalogues: the Positional Update and Matching Algorithm. The Positional Update and Matching Algorithm combines a positional Bayesian probabilistic approach with ...