Title: A New Look at Bounding Integrity Risk in the Presence of Time-Correlated Errors
Author(s): Steven E. Langel, Mathieu Joerger, Samer M. Khanafseh and Boris S. Pervan
Published in: Proceedings of the 30th International Technical Meeting of The Satellite Division of the Institute of Navigation (ION GNSS+ 2017)
September 25 - 29, 2017
Oregon Convention Center
Portland, Oregon
Pages: 2436 - 2451
Cite this article: Langel, Steven E., Joerger, Mathieu, Khanafseh, Samer M., Pervan, Boris S., "A New Look at Bounding Integrity Risk in the Presence of Time-Correlated Errors," Proceedings of the 30th International Technical Meeting of The Satellite Division of the Institute of Navigation (ION GNSS+ 2017), Portland, Oregon, September 2017, pp. 2436-2451.
Full Paper: ION Members/Non-Members: 1 Download Credit
Sign In
Abstract: A new approach is developed to upper bound integrity risk for safety-critical GNSS applications when the autocorrelation functions of measurement and process noise are uncertain. The algorithm is recursive and significantly expands the applicable range of existing methods. In Kalman filtering, models must be specified for autocorrelated measurement and process noise. This paper assumes that the noise processes are the output of known linear systems driven by white noise. However, the system parameters are only known to lie in specified intervals. Following the approach in [6], an augmented state model is first developed to propagate the estimate error covariance matrix when there is parameter uncertainty. It is shown that the error variance for a specified state is a polynomial in the unknown parameters whose order grows linearly with time. An exact upper bound on integrity risk is determined by maximizing the variance. Next, a recursive algorithm is derived to update the variance’s Taylor series expansion. This enables an approximate bound to be established by maximizing a polynomial whose order is low and remains fixed over time. The Taylor remainder theorem is used to introduce conservatism and provide justification that the approximate bound is at least as large as the exact bound. For a one-dimensional navigation problem, we show that the number of series terms needed to obtain a tight upper bound on integrity risk is less than 10.