Reliable bounding zones and inconsistency measures for GPS positioning using geometrical constraints

Dbouk Hani and Schön Steffen: Reliable bounding zones and inconsistency measures for GPS positioning using geometrical constraints. In: Acta cybernetica, (24) 3. pp. 573-591. (2020)

[thumbnail of cybernetica_024_numb_003_573-591.pdf]
Cikk, tanulmány, mű

Download (6MB) | Preview


Reliable confidence domains for positioning with Global Navigation Satellite System (GNSS) and inconsistency measures for the observations are of great importance for any navigation system, especially for safety critical applications. In this work, deterministic error bounds are introduced in form of intervals to assess remaining observation errors. The intervals can be determined based on expert knowledge or - as in our case - based on a sensitivity analysis of the measurement correction process. Using convex optimization, bounding zones are computed for GPS positioning, which satisfy the geometrical constraints imposed by the observation intervals. The bounding zone is a convex polytope. When exploiting only the navigation geometry, a confidence domain is computed in form of a zonotope. We show that the relative volume between the polytope and the zonotope can be considered as an inconsistency measure. A small polytope volume indicates bad consistency of the observations. In extreme cases, empty sets are obtained which indicates large outliers. We explain how shape and volume of the polytopes are related to the positioning geometry. Furthermore, we propose a new concept of Minimum Detectable Biases. Using the example of the Klobuchar ionospheric model and Saastamoinen tropospheric model, we show how observation intervals can be determined via sensitivity analysis of these correction models for a real measurement campaign. Taking GPS code data from simulations and real experiments, a comparison analysis between the proposed deterministic bounding method and the classical least-squares adjustment has been conducted in terms of accuracy and reliability. It shows that the computed polytopes always enclose the reference trajectory. In case of large outliers, large position deviations persist in the least-squares solution while the polytope algorithm yields empty sets and thus successfully detects the cases with outliers.

Item Type: Article
Heading title: Interval methods in control and robotics
Journal or Publication Title: Acta cybernetica
Date: 2020
Volume: 24
Number: 3
ISSN: 0324-721X
Page Range: pp. 573-591
Language: English
Publisher: University of Szeged, Institute of Informatics
Place of Publication: Szeged
Event Title: Summer Workshop on Interval Methods (11.) (2018) (Rostock)
Related URLs:
DOI: 10.14232/actacyb.24.3.2020.16
Uncontrolled Keywords: Számítástechnika, Kibernetika, Vezérléstechnika, Robotika
Additional Information: Bibliogr.: p. 589-591. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2020. Jul. 30. 13:23
Last Modified: 2022. Jun. 21. 09:21

Actions (login required)

View Item View Item