IP Library Granted Patent US 12,517,260
Granted Patent B2
US 12,517,260 · App. 17/894,660 · Granted Jan 6, 2026

Systems and methods for redundant integrity monitoring

Inventors: Jonathan Fetter-Degges (Washington, DC); John Karvounis (Bowie, MD); Carole Teolis (Glendale, MD)
Assignee: TRX SYSTEMS, INC.
G01S19/21G01S19/08G01S19/37G01S19/396G01S19/45
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,517,260
App. No.
17/894,660
Granted
Jan 6, 2026
Kind
B2
Abstract

System, computer program products, and methods for detecting and compensating for sensor interference. Sensor interference may result from environmental interference or from electronic signal interference. Sensor location input may be adapted or rejected when interference is detected. The system can monitor the accuracy, as well as the integrity, of all navigation sensors. The system can also automatically eliminate the faulty or compromised data from a final navigation solution.

Claims (27)

1 . A method for automatically adjudicating sensor input for use in a navigation solution, comprising:

identifying N potentially compromised sensor inputs, generating a first navigation solution including trusted sensor input and without the N potentially compromised sensor inputs, and outputting the first navigation solution; and

utilizing one or more levels of integrity monitoring, including computing a state divergence value within a state space filter based on changes in uncertainty after sensor input is applied, to determine if one or more of the N potentially compromised sensor inputs can be validated, generating at least a second navigation solution including the trusted sensor input and with one or more of the N potentially compromised sensor inputs, and

based on a validation, automatically eliminating non validated sensor inputs and outputting the second navigation solution as a position and map estimate for use in a navigation system, including applying the second navigation solution to constrain further state updates within the state space filter.

2 . The method of claim 1 , wherein the first navigation solution and the second navigation solution are generated by a particle filter that contains a first set of particles that do not apply the N potentially compromised sensor inputs and a second set of particles that apply one or more of the N potentially compromised sensor inputs.

3 . The method of claim 2 , wherein the utilizing one or more levels of integrity monitoring includes maintaining first integrity values for sensor inputs in the first set of particles and second integrity values for the second set of particles and correlating the first integrity values and the second integrity values from new sensor input to new sensor input throughout a duration of a period.

4 . The method of claim 1 , wherein the first navigation solution and the second navigation solution are generated by a Kalman filter, wherein the Kalman filter does not apply the N potentially compromised sensor inputs to derive the first navigation solution, wherein the N potentially compromised sensor inputs are applied to one or more additional navigations solutions including the second navigation solution, wherein each of the one or more additional navigation solutions applies a different weight based on application of the N potentially compromised sensor inputs.

5 . The method of claim 1 , wherein the utilizing one or more levels of integrity monitoring includes a plurality of navigation solutions, wherein each navigation solution among the plurality of navigation solutions includes the trusted sensor input and a different sensor input among the N potentially compromised sensor inputs and includes a full navigation solution that includes the trusted sensor input and each of the N potentially compromised sensor inputs.

6 . The method of claim 5 , wherein the full navigation solution is utilized as the navigation solution when all of the sensor inputs are validated.

7 . The method of claim 5 , wherein the full navigation solution is eliminated and rewound including only the trusted sensor input when all of the sensor inputs are not validated.

8 . A computer-implemented method for automatically adjudicating sensor input for use in a navigation solution, comprising:

receiving, by a computing device comprising a processor and memory, input data from a sensor and a preprocessed integrity estimate of the input data;

executing, by the computing device, a state space filter configured to generate a navigation solution based on the input data;

splitting the navigation solution within the state space filter into a trusting solution and an untrusting solution based on the preprocessed integrity estimate;

performing, by the computing device, a cross consistency check of the trusting solution and the untrusting solution based on input data from at least one additional sensor;

adjusting, by the computing device, the state space filter based on the cross consistency check;

computing, by the computing device, a divergence within the state space filter based on changes in uncertainty after sensor input is applied, wherein the divergence comprises at least one of a difference in estimated position, velocity, or uncertainty covariance;

automatically determining, by the computing device, whether the divergence exceeds a predetermined threshold, and in response, updating a trust score associated with the sensor input;

adjusting, by the computing device, a weighting of the sensor input in the state space filter based on the updated trust score;

fusing all, by the computing device, part or none of the trusting solution and the untrusting solution into the navigation solution based on the updated trust score;

based on the updated trust score indicating the sensor input is not validated, automatically eliminating the sensor input from participation in the navigation solution; and

outputting, by the computing device, the navigation solution as a position and map estimate for use in a navigation system, including applying the navigation solution in subsequent navigation processing by adjusting the state space filter and constraining subsequent state updates based on the navigation solution.

9 . The method of claim 8 , wherein the state space filter is a particle filter that contains a first set of particles corresponding to the untrusting solution and a second set of particles corresponding to the trusting solution.

10 . The method of claim 9 , wherein the performing a cross consistency check includes maintaining first integrity values for sensor inputs in the first set of particles and second integrity values for the second set of particles and correlating the first integrity values and the second integrity values from new sensor input to new sensor input throughout a duration of a period.

11 . The method of claim 9 , wherein the adjusting the state space filter based on the cross consistency check and the adjusting the state space filter based on the divergence includes adjusting a first particle distribution of the first set of particles and a second particle distribution of the second set of particles.

12 . The method of claim 8 , wherein the state space filter is a Kalman filter, wherein the Kalman filter does not apply potentially compromised sensor inputs to derive the untrusting solution, and applies the potentially compromised sensor inputs to derive the trusting solution.

13 . The method of claim 12 , wherein the adjusting the state space filter based on the cross consistency check and the adjusting the state space filter based on the divergence includes adjusting a solution weight of the untrussing solution and the trusting solution.

Assignments (3)
SECURITY INTEREST Recorded Mar 23, 2026
From: FREEFLIGHT ACQUISITION CORPORATION; ACR ELECTRONICS, INC.; TRX SYSTEMS, INC.
To: ARES CAPITAL CORPORATION, AS COLLATERAL AGENT
Reel/Frame 075170/0859 →
CONFIRMATORY LICENSE Recorded Oct 26, 2023
From: TRX SYSTEMS INC
To: UNITED STATES GOVERNMENT AS REPRESENTED BY THE SECRETARY OF THE ARMY
Reel/Frame 065360/0885 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 24, 2022
From: FETTER-DEGGES, JONATHAN; KARVOUNIS, JOHN; TEOLIS, CAROLE
To: TRX SYSTEMS, INC.
Reel/Frame 060889/0594 →
Continuity (2)
Provisional Application 63236559 · Aug 24, 2021
Related Publication 20230065658A1 · Mar 2, 2023
References Cited (129)
US 6024655A · Coffee · 2000 [cited by applicant]
US 6560531B1 · Joshi · 2003 [cited by applicant]
US 7106189B2 · Burnenske et al. · 2006 [cited by applicant]
US 7299056B2 · Anderson · 2007 [cited by applicant]
US 7304571B2 · Halsey et al. · 2007 [cited by applicant]
US 7890262B2 · Judd et al. · 2011 [cited by applicant]
US 8032153B2 · Dupray et al. · 2011 [cited by applicant]
US 8145419B2 · Onome et al. · 2012 [cited by applicant]
US 8150650B2 · Goncalves et al. · 2012 [cited by applicant]
US 8331335B2 · Chhabra · 2012 [cited by applicant]
US 8462745B2 · Alizadeh-Shabdiz · 2013 [cited by applicant]
US 8473241B2 · Foxlin · 2013 [cited by applicant]
US 8504292B1 · Cote et al. · 2013 [cited by applicant]
US 8521418B2 · Ma et al. · 2013 [cited by applicant]
US 8538687B2 · Plocher et al. · 2013 [cited by applicant]
US 8688375B2 · Funk et al. · 2014 [cited by applicant]
US 8706414B2 · Funk et al. · 2014 [cited by applicant]
US 8712686B2 · Bandyopadhyay et al. · 2014 [cited by applicant]
US 8751151B2 · Funk et al. · 2014 [cited by applicant]
US 8812015B2 · Das et al. · 2014 [cited by applicant]
US 9148764B2 · Das et al. · 2015 [cited by applicant]
US 9733091B2 · Kordari et al. · 2017 [cited by applicant]
US 9759561B2 · Young et al. · 2017 [cited by applicant]
US 10088313B2 · Young et al. · 2018 [cited by applicant]
US 11337034B1 · Doty · 2022 [cited by examiner]
US 12136277B2 · Al-Husseini · 2024 [cited by examiner]
US 20040021569A1 · Lepkofker et al. · 2004 [cited by applicant]
US 20050242947A1 · Burneske et al. · 2005 [cited by applicant]
US 20070121560A1 · Edge · 2007 [cited by applicant]
US 20080033645A1 · Levinson et al. · 2008 [cited by applicant]
US 20080077326A1 · Funk et al. · 2008 [cited by applicant]
US 20090019402A1 · Ke et al. · 2009 [cited by applicant]
US 20090043504A1 · Bandyopadhyay et al. · 2009 [cited by applicant]
US 20090060085A1 · Nadler et al. · 2009 [cited by applicant]
US 20090179869A1 · Slotznick · 2009 [cited by applicant]
US 20090248304A1 · Roumeliotis et al. · 2009 [cited by applicant]
US 20090262974A1 · Lithopoulos · 2009 [cited by applicant]
US 20090321094A1 · Thomas · 2009 [cited by applicant]
US 20100187406A1 · Van Dalen et al. · 2010 [cited by applicant]
US 20100305845A1 · Alexandre et al. · 2010 [cited by applicant]
US 20110032152A1 · Lo et al. · 2011 [cited by applicant]
US 20110080848A1 · Khorashadi et al. · 2011 [cited by applicant]
US 20110098921A1 · Miller et al. · 2011 [cited by applicant]
US 20110172906A1 · Das et al. · 2011 [cited by applicant]
US 20110182238A1 · Marshall et al. · 2011 [cited by applicant]
US 20110204895A1 · Zeller et al. · 2011 [cited by applicant]
US 20110212717A1 · Rhoads et al. · 2011 [cited by applicant]
US 20110238308A1 · Miller et al. · 2011 [cited by applicant]
US 20110282622A1 · Canter · 2011 [cited by applicant]
US 20120021764A1 · Enright · 2012 [cited by applicant]
US 20120072052A1 · Powers et al. · 2012 [cited by applicant]
US 20120093408A1 · Tang et al. · 2012 [cited by applicant]
US 20120143495A1 · Dantu · 2012 [cited by applicant]
US 20120203453A1 · Lundquist et al. · 2012 [cited by applicant]
US 20120232795A1 · Robertson et al. · 2012 [cited by applicant]
US 20120235865A1 · Nath et al. · 2012 [cited by applicant]
US 20130024117A1 · Pavetti et al. · 2013 [cited by applicant]
US 20130046505A1 · Brunner et al. · 2013 [cited by applicant]
US 20130096817A1 · Fauci et al. · 2013 [cited by applicant]
US 20130131985A1 · Weiland et al. · 2013 [cited by applicant]
US 20130179067A1 · Trowbridge et al. · 2013 [cited by applicant]
US 20130267260A1 · Chao et al. · 2013 [cited by applicant]
US 20130293416A1 · Waters et al. · 2013 [cited by applicant]
US 20130311134A1 · Kordari et al. · 2013 [cited by applicant]
US 20130321391A1 · Troy et al. · 2013 [cited by applicant]
US 20130331121A1 · Bandyopadhyay et al. · 2013 [cited by applicant]
US 20130332064A1 · Funk · 2013 [cited by applicant]
US 20130332065A1 · Hakim et al. · 2013 [cited by applicant]
US 20130345967A1 · Pakzad · 2013 [cited by applicant]
US 20140002307A1 · Mole et al. · 2014 [cited by applicant]
US 20140139375A1 · Faragher et al. · 2014 [cited by applicant]
US 20140141796A1 · Marti et al. · 2014 [cited by applicant]
US 20140156180A1 · Marti et al. · 2014 [cited by applicant]
US 20140162686A1 · Lee et al. · 2014 [cited by applicant]
US 20150005000A1 · Gyorfi et al. · 2015 [cited by applicant]
US 20150031390A1 · Robertson et al. · 2015 [cited by applicant]
US 20150097731A1 · Russell · 2015 [cited by applicant]
US 20150153182A1 · Tu et al. · 2015 [cited by applicant]
US 20150346317A1 · Patel et al. · 2015 [cited by applicant]
US 20210003229A1 · Karatsinides · 2021 [cited by examiner]
US 20210107537A1 · Ross · 2021 [cited by examiner]
US 20210311203A1 · Reis · 2021 [cited by examiner]
US 20220055655A1 · Navas Sanchez · 2022 [cited by examiner]
US 20220066015A1 · Burghardt · 2022 [cited by examiner]
WO WO2009021068A1 · 2009 [cited by applicant]
WO WO2011097018A1 · 2011 [cited by applicant]
WO WO2012050932A1 · 2012 [cited by applicant]
WO WO2012072957A1 · 2012 [cited by applicant]
U.S. Appl. No. 13/566,956, filed Aug. 3, 2012, Karvounis. [cited by applicant]
U.S. Appl. No. 13/616,350, filed Sep. 14, 2012, Bandyopadhyay et al. [cited by applicant]
U.S. Appl. No. 13/616,370, filed Sep. 14, 2012, Bandyopadhyay et al. [cited by applicant]
U.S. Appl. No. 13/616,408, filed Sep. 14, 2012, Bandyopadhyay et al. [cited by applicant]
U.S. Appl. No. 14/262,618, filed Apr. 25, 2014, Funk et al. [cited by applicant]
U.S. Appl. No. 14/262,627, filed Apr. 25, 2014, Funk et al. [cited by applicant]
U.S. Appl. No. 61/658,883, filed Jun. 12, 2012, Bandyopadhyay et al. [cited by applicant]
U.S. Appl. No. 61/783,799, filed Mar. 14, 2013, Karvounis et al. [cited by applicant]
U.S. Appl. No. 61/783,908, filed Mar. 14, 2013, Funk et al. [cited by applicant]
U.S. Appl. No. 61/792,856, filed Mar. 15, 2013, Funk et al. [cited by applicant]
Jolliffe; “Principal Component” 2nd edition; New York; 2002; p. 1-519. [cited by applicant]
Turk et al.; “Face Recognition Using Eigenfaces”; Vision and Modeling Group; IEEE; 1991; p. 586-591. [cited by applicant]
Tommasini et al.; “Making Good Features Track Better”; IEEE Computer Vision and Pattern Recognition; 1998; 6 pages. [cited by applicant]
Thrun et al.; “The Graph SLAM Alogrithm with Applications to Large-Scale Mapping of Urban Structures”; International Journal on Robotics Research; vol. 25 No. 6; 2006; p. 403-429. [cited by applicant]
Thrun et al.; “A Probabilistic Approach to Concurrent Mapping and Localization for Mobile Robots”; Machine Learning and Autonomous Robots; 31/5; 1998; 25 pages. [cited by applicant]
Stanley; Implementation of Kalman Filter to Tracking Custom Four-Wheel Drive Four-Wheel-Steering Robotic Platform; Univ or Maryland; Master Thesis; 2010; 96 pages. [cited by applicant]
Noguchi et al.; “A Surf-based Spatio-Temporal Feature for Feature-fusion-based Action Recognition” Trends and Topics in Computer Vision; 2012; 14 pages. [cited by applicant]
Napora; “Implementation, Evaluation, and Applications of Mobile Mesh Networks for Platforms in Motion”; Univ of Maryland; Master Thesis; 2009; 105 pages. [cited by applicant]
Mahalanobis; “On the Generalized Distance in Statistics”; Proceedings of the National Institute of Sciences of India; vol. 2 No. 1; Apr. 1936; p. 49-55. [cited by applicant]
Lemaire et al.; “SLAM with Panoramic Vision”; Journal of Field Robotics; vol. 24 No. 1-2; Feb. 2007; 30 pages. [cited by applicant]
Jensfelt et al.; “A Framework for Vision Based Bearing only 3D SLAM” IEEE Int. Conf. on Robotics and Automation; May 2006; p. 1944-1950. [cited by applicant]
Harris et al.; “A Combined Corner and Edge Detector”; Proceedings of the 4th Alvey Vision Conference; 1988; p. 147-151. [cited by applicant]
Gregory et al.; “Fast and Accurate Collision Detection for Haptic Interaction Using a Three Degree-of-Freedom Force-Feedback Device”; Computational Geometry, 2000; 24 pages. [cited by applicant]
Whyte; “Uncertain Geometry in Robotics”; IEEE Journal of Robotics and Automation; vol. 4 No. 1; Feb. 1988; p. 23-31. [cited by applicant]
Davison et al.; MonoSLAM: Real-Time Single Camera SLAM; IEEE Transactions on Pattern Analysis and Machine Intelligence; vol. 29 No. 6; Jun. 2007; 16 pages. [cited by applicant]
Bouguet; “Pyramidal Implementation of the Lucas Kanade Feature Tracker Description of the Algorithm”; Intel Corporation; 2001; 9 pages. [cited by applicant]
Bailey et al.; “Simultaneous Localization and Mapping (SLAM); Part II”; IEEE Robotics and Automation Magazine; vol. 13 No. 3; Sep. 2006; p. 108-117. [cited by applicant]
Chong et al.; “Feature-based Mapping in Real, Large Scale Environments using an Ultrasonic Array”; The International Journal of Robotics Research; vol. 18 No. 1; Jan. 1999; 44 pages. [cited by applicant]
DeSouza et al.; “Vision for Mobile Robot Navigation: A Survey”; IEEE Transactions on Pattern Analysis and Machine Intelligence; vol. 24 No. 2; Feb. 2002; p. 237-267. [cited by applicant]
Mourikis et al.; “SC-KF Mobile Robot Localization: A Stochastic Cloning Kalman Filter for Processing Relative-State Measurements”; IEEE Transactions on Robotics; vol. 23 No. 4; Aug. 2007; p. 717-730. [cited by applicant]
“Parallel Programming and Computing Platform”; www.nvidia.com/object/cuda.sub.--home.html; NVIDIA; 2009; accessed Oct. 23, 2012; 4 pages; no authors. [cited by applicant]
“Developing apps for Windows Phone or Xbox”; http://create.msdn.com; Microsoft; © 2012; accessed Oct. 23, 2012; 2 pages; no authors. [cited by applicant]
“OpenCV (Open Source Computer Vision)”; http://opencv.willowgarage.com/wiki/Welcome?action=print; Intel; 2009; accessed Oct. 23, 2012; 2 pages; no authors. [cited by applicant]
Teschner et al.; “Optimized Spatial Hashing for Collision Detection of Defromable Objects”; Vision Modeling and Visualization; Korea University; 2003; 39 pages. [cited by applicant]
Bay et al.; “Speeded-Up Robust Features (SURF)”; Computer Vision and Image Understanding; vol. 110 No. 3; 2008; p. 346-359. [cited by applicant]
Whyte et al.; “Simultaneous Localization and Mapping: Part I”; IEEE Robotics & Automation Magazine; Jun. 2006; p. 99-108. [cited by applicant]
Bradley et al.; “Face Tracking and Pose Approximation” Computer Research Association; Aug. 2009; 7 pages. [cited by applicant]
Gregory et al.; “A Framework for Fast and Accurate Collision Detection for Haptic Interaction”; IEEE Proceedings of Virtual Reality; 1999; 8 pages. [cited by applicant]
“TRX 3-D Tracking System”; http://www.trxsystems.com; TRX Systems, Inc.; 2009; 2 pages; No Author. [cited by applicant]
Kabasch; A discussion of the solution for the best rotation to relate two sets of vectors; Acta Crystallographica; vol. 34; Sep. 1978; p. 827-828. [cited by applicant]
European Patent Application No. 13803670.2; Extended Search Report; dated Jan. 25, 2016; 7 pages. [cited by applicant]