Lower Bounds in Optimal Integrity Monitoring

Juan Blanch and Todd Walter

Peer Reviewed

Abstract:	The goal of integrity monitoring in positioning algorithms consists in finding a test statistic and an estimator that meets both the integrity requirements and the alert requirements under a set of conditions. The search for such test statistics can be cast as an optimization problem where the goal is to minimize the integrity risk while maintaining the alert requirements. In this work, we provide results that extend previous results in two ways. First, we provide a lower bound on the integrity risk for linear unbiased estimators (but not necessarily optimal). Second we provide a lower on the integrity risk in the case of fault detection and exclusion. The results developed in this work here are very general. In particular, they are applicable to both snapshot solutions and Kalman filter solutions, and to any combination of sensors.
Published in:	Proceedings of the ION 2019 Pacific PNT Meeting April 8 - 11, 2019 Hilton Waikiki Beach Honolulu, Hawaii
Pages:	915 - 924
Cite this article:	Blanch, Juan, Walter, Todd, "Lower Bounds in Optimal Integrity Monitoring," Proceedings of the ION 2019 Pacific PNT Meeting, Honolulu, Hawaii, April 2019, pp. 915-924. https://doi.org/10.33012/2019.16788
Full Paper:	ION Members/Non-Members: 1 Download Credit Sign In