Review of range-based positioning algorithms

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 posit...

Full description

Bibliographic Details
Main Authors: Yan, J., Tiberius, C.C.J.M., Janssen, G.J.M., Teunissen, Peter, Bellusci, G.
Format: Journal Article
Published: Institute of Electrical and Electronics Engineers 2013
Online Access:http://hdl.handle.net/20.500.11937/35706
_version_ 1848754568561688576
author Yan, J.
Tiberius, C.C.J.M.
Janssen, G.J.M.
Teunissen, Peter
Bellusci, G.
author_facet Yan, J.
Tiberius, C.C.J.M.
Janssen, G.J.M.
Teunissen, Peter
Bellusci, G.
author_sort Yan, J.
building Curtin Institutional Repository
collection Online Access
description 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.
first_indexed 2025-11-14T08:42:29Z
format Journal Article
id curtin-20.500.11937-35706
institution Curtin University Malaysia
institution_category Local University
last_indexed 2025-11-14T08:42:29Z
publishDate 2013
publisher Institute of Electrical and Electronics Engineers
recordtype eprints
repository_type Digital Repository
spelling curtin-20.500.11937-357062017-09-13T15:30:50Z Review of range-based positioning algorithms Yan, J. Tiberius, C.C.J.M. Janssen, G.J.M. Teunissen, Peter Bellusci, G. 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. 2013 Journal Article http://hdl.handle.net/20.500.11937/35706 10.1109/MAES.2013.6575420 Institute of Electrical and Electronics Engineers fulltext
spellingShingle Yan, J.
Tiberius, C.C.J.M.
Janssen, G.J.M.
Teunissen, Peter
Bellusci, G.
Review of range-based positioning algorithms
title Review of range-based positioning algorithms
title_full Review of range-based positioning algorithms
title_fullStr Review of range-based positioning algorithms
title_full_unstemmed Review of range-based positioning algorithms
title_short Review of range-based positioning algorithms
title_sort review of range-based positioning algorithms
url http://hdl.handle.net/20.500.11937/35706