Improved Time of Arrival Measurement Model for Non-Convex Optimization with Noisy Data

Juri Sidorenko, Volker Schatz, Norbert Scherer-Negenborn, Michael Arens, Urs Hugentobler

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

The quadratic system provided by the Time of Arrival technique can be solved analytical or by non-linear least squares minimization. In real environments the measurements are always corrupted by noise. This measurement noise effects the analytical solution more than non-linear optimization algorithms. On the other hand it is also true that local optimization tends to find the local minimum, instead of the global minimum. This article presents an approach how this risk can be significantly reduced in noisy environments. The main idea of our approach is to transform the local minimum to a saddle point, by increasing the number of dimensions. In addition to numerical tests we analytically prove the theorem and the criteria that no other local minima exists for non-trivial constellations.

Original languageEnglish
Title of host publicationIPIN 2018 - 9th International Conference on Indoor Positioning and Indoor Navigation
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781538656358
DOIs
StatePublished - 13 Nov 2018
Event9th International Conference on Indoor Positioning and Indoor Navigation, IPIN 2018 - Nantes, France
Duration: 24 Sep 201827 Sep 2018

Publication series

NameIPIN 2018 - 9th International Conference on Indoor Positioning and Indoor Navigation

Conference

Conference9th International Conference on Indoor Positioning and Indoor Navigation, IPIN 2018
Country/TerritoryFrance
CityNantes
Period24/09/1827/09/18

Keywords

  • localization
  • navigation
  • non-linear optimization
  • time of arrival

Fingerprint

Dive into the research topics of 'Improved Time of Arrival Measurement Model for Non-Convex Optimization with Noisy Data'. Together they form a unique fingerprint.

Cite this