IP Library › Granted Patent US 12,292,515
Granted Patent B2
US 12,292,515 · App. 17/948,218 · Granted May 6, 2025

Generating and distributing GNSS risk analysis data for facilitating safe routing of autonomous drones

Inventors: Matthew Pottle (Paignton, GB); Esther Anyaegbu (Northampton, GB); Colin Richard Ford (Carmarthen, GB); Paul Hansen (Cambridge, GB); Ronald Toh Ming Wong (Paignton, GB); Jeremy Charles Bennington (Greenwood, IN); Samuel Nardoni (Paignton, GB)
Assignee: Spirent Communications PLC
G01S19/08H04L67/12G08G1/0968
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,292,515
App. No.
17/948,218
Granted
May 6, 2025
Kind
B2
Abstract

Disclosed is route planning using a worst-case risk analysis and, if needed, a best-case risk analysis of GNSS coverage. The worst-case risk analysis identifies cuboids or 2d regions through which a vehicle can be routed with assurance that adequate GNSS coverage will be available regardless of the time of day that the vehicle travels. The best-case risk analysis identifies cuboids or 2d regions through which there is adequate coverage at some times during the day. In case path finding using the worst-case risk analysis fails, a best-case risk analysis can be requested and used to find alternate potential path(s). Time dependent forecast data that covers regions along the alternate potential path(s) can be requested and used to route vehicles, including autonomous drones, from starting points to destinations. This includes generation, distribution and use of risk analysis data, implemented as methods, systems and articles of manufacture.

Claims (57)

1. A method of generating and distributing GNSS data for facilitating safe routing of autonomous drones, the method including:

obtaining three to fifty days of historical GNSS satellite path data, at least two of which are non-consecutive days, for a region of calculation;

generating, using the historical GNSS satellite path data, a worst-case risk analysis for the region of calculation that reveals cuboids in the region of interest through which a drone can fly through with configurably adequate GNSS coverage for autonomous flight irrespective of the time of flight, including:

sampling, over a range of hours of historical GNSS satellite path data, using a three-dimension model of the region of calculation, including ray casting from the cuboids to the historical paths of the GNSS satellites using the three-dimensional model to determine precision of GNSS coverage for cuboids; and

for each cuboid in the region of calculation, determining the lowest precision of GNSS coverage during the consecutive span of hours;

receiving and responding to a request for the worst-case risk analysis for a region of interest within the region of calculation by distributing the worst-case risk analysis for the region of interest.

2. The method of claim 1 , further including indicating in the worst-case analysis the cuboids for which adequate GNSS coverage is not dependent on time-of-day.

3. The method of 1, wherein configurably adequate is met when the precision of GNSS coverage satisfies requirements of a Federal Aviation Administration (FAA).

4. The method of claim 1 , wherein the historical GNSS satellite path data includes three to ten non-consecutive days.

5. The method of claim 1 , wherein the non-consecutive days are separated by 5 to 20 days.

6. The method of claim 1 , wherein the sampling is conducted on an interval between once per half-second and once per 90 seconds.

7. The method of claim 1 , wherein the range of hours of historical GNSS satellite path data is between 12 to 24 hours.

8. The method of claim 1 , further including:

wherein the worst-case risk analysis includes inadequate coverage zones; and

wherein the generating further includes padding worst zones with a buffer zone that extends outward from the inadequate coverage zones up to 10 meters.

9. The method of claim 8 , wherein the buffer zone extends outward up to 5 meters.

10. The method of claim 8 , further including:

generating, using the historical satellite data, a best-case risk analysis for the region of calculation that reveals cuboids in which, for at least a period of time in the historical GNSS satellite path data, a time-sensitive route is available; and

receiving a request for the best-case analysis for the region of interest and responding by distributing the best-case risk analysis.

11. The method of claim 10 , further including:

requesting and receiving a forecast for at least the requested range of time covering at least the likely route; and

finding in the forecast at least one time during which the drone can fly from the starting location to the destination through the cuboids that have the configurably adequate GNSS coverage for a period within the range of time.

12. A non-transitory computer readable medium impressed with computer program instructions that, when executed on hardware, cause the hardware to carry out actions of generating and distributing GNSS data for facilitating safe routing of autonomous drones, the actions including:

obtaining three to fifty days of historical GNSS satellite path data, at least two of which are non-consecutive days, for a region of calculation;

generating, using the historical GNSS satellite path data, a worst-case risk analysis for the region of calculation that reveals cuboids in the region of interest through which a drone can fly through with configurably adequate GNSS coverage for autonomous flight irrespective of the time of flight, including:

sampling, over a range of hours of historical GNSS satellite path data, using a three-dimension model of the region of calculation, including ray casting from the cuboids to the historical paths of the GNSS satellites using the three-dimensional model to determine precision of GNSS coverage for cuboids; and

for each cuboid in the region of calculation, determining the lowest precision of GNSS coverage during the consecutive span of hours;

receiving and responding to a request for the worst-case risk analysis for a region of interest within the region of calculation by distributing the worst-case risk analysis for the region of interest.

13. The computer readable medium of 12 , wherein configurably adequate is met when the precision of GNSS coverage satisfies requirements of a Federal Aviation Administration (FAA).

14. The computer readable medium of claim 12 , wherein the historical GNSS satellite path data includes three to ten non-consecutive days.

15. The computer readable medium of claim 12 , wherein the non-consecutive days are separated by 5 to 20 days.

16. The computer readable medium of claim 12 , further including:

wherein the worst-case risk analysis includes inadequate coverage zones; and

wherein the generating further includes padding worst zones with a buffer zone that extends outward from the inadequate coverage zones up to 10 meters.

17. The computer readable medium of claim 16 , wherein the buffer zone extends outward up to 5 meters.

18. The computer readable medium of claim 16 , further including:

generating, using the historical satellite data, a best-case risk analysis for the region of calculation that reveals cuboids in which, for at least a period of time in the historical GNSS satellite path data, a time-sensitive route is available; and

receiving a request for the best-case analysis for a second requested range of time and the region of interest and responding by distributing the best-case risk analysis.

19. The computer readable medium of claim 18 , further including:

requesting and receiving a forecast for at least the requested range of time covering at least the likely route; and

finding in the forecast at least one time during which the drone can fly from the starting location to the destination through the cuboids that have the configurably adequate GNSS coverage for a period within the range of time.

20. A system including hardware and a non-transitory computer readable medium impressed with computer program instructions that, when executed on the hardware, cause the hardware to carry out actions of generating and distributing GNSS data for facilitating safe routing of autonomous drones, the actions including:

obtaining three to fifty days of historical GNSS satellite path data, at least two of which are non-consecutive days, for a region of calculation;

generating, using the historical GNSS satellite path data, a worst-case risk analysis for the region of calculation that reveals cuboids in the region of interest through which a drone can fly through with configurably adequate GNSS coverage for autonomous flight irrespective of the time of flight, including:

sampling, over a range of hours of historical GNSS satellite path data, using a three-dimension model of the region of calculation, including ray casting from the cuboids to the historical paths of the GNSS satellites using the three-dimensional model to determine precision of GNSS coverage for cuboids; and

for each cuboid in the region of calculation, determining the lowest precision of GNSS coverage during the consecutive span of hours;

receiving and responding to a request for the worst-case risk analysis for a region of interest within the region of calculation by distributing the worst-case risk analysis for the region of interest.

21. The computer readable medium of claim 20 , further including:

wherein the worst-case risk analysis includes inadequate coverage zones; and

wherein the generating further includes padding worst zones with a buffer zone that extends outward from the inadequate coverage zones up to 10 meters.

22. The computer readable medium of claim 21 , wherein the buffer zone extends outward up to 5 meters.

23. The computer readable medium of claim 21 , further including:

generating, using the historical satellite data, a best-case risk analysis for the region of calculation that reveals cuboids in which, for at least a period of time in the historical GNSS satellite path data, a time-sensitive route is available; and

receiving a request for the best-case analysis for a second requested range of time and the region of interest and responding by distributing the best-case risk analysis.

24. The computer readable medium of claim 23 , further including:

requesting and receiving a forecast for at least the requested range of time covering at least the likely route; and

finding in the forecast at least one time during which the drone can fly from the starting location to the destination through the cuboids that have the configurably adequate GNSS coverage for a period within the range of time.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 14, 2022
From: POTTLE, MATTHEW; ANYAEGBU, ESTHER; FORD, COLIN RICHARD; HANSEN, PAUL; WONG, RONALD TOH MING; BENNINGTON, JEREMY CHARLES; NARDONI, SAMUEL
To: SPIRENT COMMUNICATIONS, PLC
Reel/Frame 061748/0894 →
Continuity (6)
Continuation In Part 17706421 · Mar 28, 2022
Continuation 17374885 · Jul 13, 2021
Provisional Application 63407579 · Sep 16, 2022
Provisional Application 63161386 · Mar 15, 2021
Provisional Application 63051849 · Jul 14, 2020
Related Publication 20230016836A1 · Jan 19, 2023
References Cited (210)
US 4284160A · DeLiban et al. · 1981 [cited by applicant]
US 5548814A · Lorang et al. · 1996 [cited by applicant]
US 5761486A · Watanabe et al. · 1998 [cited by applicant]
US 6191708B1 · Davidson · 2001 [cited by applicant]
US 6208841B1 · Wallace et al. · 2001 [cited by applicant]
US 6396825B1 · Jasper et al. · 2002 [cited by applicant]
US 6560459B1 · Wong · 2003 [cited by applicant]
US 6571082B1 · Rahman et al. · 2003 [cited by applicant]
US 6636721B2 · Threadgill et al. · 2003 [cited by applicant]
US 7224941B2 · Liu · 2007 [cited by applicant]
US 7324588B2 · Green et al. · 2008 [cited by applicant]
US 7349670B2 · Mlinarsky et al. · 2008 [cited by applicant]
US 7395060B2 · Liu · 2008 [cited by applicant]
US 7398056B1 · Ebert et al. · 2008 [cited by applicant]
US 7508868B2 · Chang · 2009 [cited by applicant]
US 7539489B1 · Alexander · 2009 [cited by applicant]
US 7555420B2 · Wang et al. · 2009 [cited by applicant]
US 7606165B2 · Qiu et al. · 2009 [cited by applicant]
US 7646338B2 · Monnerat · 2010 [cited by applicant]
US 7693082B2 · Wright · 2010 [cited by applicant]
US 7809404B2 · Daniels et al. · 2010 [cited by applicant]
US 8150675B1 · Ortmanns et al. · 2012 [cited by applicant]
US 8213957B2 · Bull et al. · 2012 [cited by applicant]
US 8223068B2 · Allan et al. · 2012 [cited by applicant]
US 8364090B2 · Ramasamy et al. · 2013 [cited by applicant]
US 9008964B2 · Mansour · 2015 [cited by applicant]
US 9519063B2 · Davis et al. · 2016 [cited by applicant]
US 9945956B2 · Chhokra et al. · 2018 [cited by applicant]
US 11131774B2 · Miya et al. · 2021 [cited by applicant]
US 11150353B2 · Nishi et al. · 2021 [cited by applicant]
US 12072425B2 · Knoedler · 2024 [cited by examiner]
US 20010004380A1 · Mannermaa · 2001 [cited by applicant]
US 20010033627A1 · Syrjarinne · 2001 [cited by applicant]
US 20020066055A1 · Kim · 2002 [cited by applicant]
US 20020102992A1 · Koorapaty et al. · 2002 [cited by applicant]
US 20030061018A1 · Snyder · 2003 [cited by applicant]
US 20030236089A1 · Beyme et al. · 2003 [cited by applicant]
US 20050004787A1 · Kubischta et al. · 2005 [cited by applicant]
US 20050085223A1 · Liu · 2005 [cited by applicant]
US 20060040616A1 · Wheatley · 2006 [cited by applicant]
US 20060046658A1 · Cruz et al. · 2006 [cited by applicant]
US 20060072466A1 · Wang et al. · 2006 [cited by applicant]
US 20060209866A1 · Steenkiste et al. · 2006 [cited by applicant]
US 20060223522A1 · Guo et al. · 2006 [cited by applicant]
US 20060229018A1 · Mlinarsky et al. · 2006 [cited by applicant]
US 20060229019A1 · Mlinarsky · 2006 [cited by applicant]
US 20060229020A1 · Mlinarsky et al. · 2006 [cited by applicant]
US 20060233111A1 · Wright · 2006 [cited by applicant]
US 20060239198A1 · Mlinarsky et al. · 2006 [cited by applicant]
US 20060247828A1 · Ardila · 2006 [cited by examiner]
US 20060252419A1 · Liu · 2006 [cited by applicant]
US 20060264178A1 · Noble et al. · 2006 [cited by applicant]
US 20070010940A1 · Tan et al. · 2007 [cited by applicant]
US 20070019769A1 · Green et al. · 2007 [cited by applicant]
US 20070257838A1 · Cheng · 2007 [cited by applicant]
US 20080056340A1 · Foegelle · 2008 [cited by applicant]
US 20080111738A1 · Han · 2008 [cited by applicant]
US 20080239972A1 · Omar · 2008 [cited by applicant]
US 20080287140A1 · Lee et al. · 2008 [cited by applicant]
US 20090002233A1 · Huang et al. · 2009 [cited by applicant]
US 20090047925A1 · Rahman · 2009 [cited by applicant]
US 20090051590A1 · Pitt et al. · 2009 [cited by applicant]
US 20090094492A1 · Music et al. · 2009 [cited by applicant]
US 20090305702A1 · Toppinen et al. · 2009 [cited by applicant]
US 20100019937A1 · Mori et al. · 2010 [cited by applicant]
US 20100033370A1 · Lopez et al. · 2010 [cited by applicant]
US 20100066599A1 · Liu et al. · 2010 [cited by applicant]
US 20100145616A1 · van Diggelen et al. · 2010 [cited by applicant]
US 20100233969A1 · Frolik et al. · 2010 [cited by applicant]
US 20100273504A1 · Bull et al. · 2010 [cited by applicant]
US 20100304686A1 · Kennedy et al. · 2010 [cited by applicant]
US 20110199255A1 · Murray et al. · 2011 [cited by applicant]
US 20110217937A1 · Cook · 2011 [cited by applicant]
US 20110230143A1 · Lundstrom et al. · 2011 [cited by applicant]
US 20110234455A1 · Rosenfeld et al. · 2011 [cited by applicant]
US 20110257923A1 · Boulton · 2011 [cited by applicant]
US 20110263215A1 · Asplund et al. · 2011 [cited by applicant]
US 20110306306A1 · Reed · 2011 [cited by applicant]
US 20120209519A1 · Basnayake · 2012 [cited by applicant]
US 20120282946A1 · Wigren · 2012 [cited by applicant]
US 20120309323A1 · Guo et al. · 2012 [cited by applicant]
US 20130021912A1 · Finlow-Bates et al. · 2013 [cited by applicant]
US 20130106655A1 · Pujante Cuadrupani · 2013 [cited by applicant]
US 20130154879A1 · Ramakrishnan et al. · 2013 [cited by applicant]
US 20130162466A1 · McDanell et al. · 2013 [cited by applicant]
US 20130217418A1 · Maurin et al. · 2013 [cited by applicant]
US 20140024318A1 · Sevindik et al. · 2014 [cited by applicant]
US 20140267690A1 · Morin et al. · 2014 [cited by applicant]
US 20140336923A1 · Hwang et al. · 2014 [cited by applicant]
US 20140343765A1 · Suiter et al. · 2014 [cited by applicant]
US 20150065165A1 · Zhang et al. · 2015 [cited by applicant]
US 20150226857A1 · Davies · 2015 [cited by applicant]
US 20150301190A1 · Osipov et al. · 2015 [cited by applicant]
US 20160097861A1 · Li et al. · 2016 [cited by applicant]
US 20160146944A1 · Geren et al. · 2016 [cited by applicant]
US 20160280401A1 · Driscoll et al. · 2016 [cited by applicant]
US 20160282473A1 · Driscoll et al. · 2016 [cited by applicant]
US 20170059715A1 · Wietfeldt et al. · 2017 [cited by applicant]
US 20170070971A1 · Wietfeldt et al. · 2017 [cited by applicant]
US 20180074209A1 · Madhow et al. · 2018 [cited by applicant]
US 20180292839A1 · Wei et al. · 2018 [cited by applicant]
US 20180372877A1 · Syrjarinne · 2018 [cited by applicant]
US 20190094379A1 · Chhokra et al. · 2019 [cited by applicant]
US 20190250277A1 · Miya et al. · 2019 [cited by applicant]
US 20190265365A1 · Skupin et al. · 2019 [cited by applicant]
US 20200274643A1 · Kodaypak et al. · 2020 [cited by applicant]
US 20210303932A1 · Stefik · 2021 [cited by examiner]
US 20220018971A1 · Bennington et al. · 2022 [cited by applicant]
US 20220120914A1 · Johnson et al. · 2022 [cited by applicant]
CN 101776766A · 2010 [cited by applicant]
CN 106131101A · 2016 [cited by applicant]
CN 108680937A · 2018 [cited by applicant]
CN 109212570A · 2019 [cited by applicant]
CN 109417595A · 2019 [cited by applicant]
CN 111197986A · 2020 [cited by examiner]
CN 114580168A · 2022 [cited by examiner]
EP 3064964A1 · 2016 [cited by applicant]
GB 2492547A · 2013 [cited by applicant]
GB 2601861A · 2022 [cited by applicant]
JP H06334636A · 1994 [cited by applicant]
JP H0962353A · 1997 [cited by applicant]
KR 2023073417A · 2023 [cited by examiner]
TW 201022705A · 2010 [cited by applicant]
WO 9903009A2 · 1999 [cited by applicant]
WO 2010093999A2 · 2010 [cited by applicant]
WO 2011046455A1 · 2011 [cited by applicant]
WO WO2020057292A1 · 2020 [cited by examiner]
WO 2022015873A2 · 2022 [cited by applicant]
U.S. Appl. No. 13/786,020, filed Mar. 5, 2013, U.S. Pat. No. 9,519,063, Dec. 13, 2016, Granted. [cited by applicant]
U.S. Appl. No. 17/374,885, filed Jul. 13, 2021, U.S. Pat. No. 11,287,531, Mar. 29, 2022, Granted. [cited by applicant]
U.S. Appl. No. 17/374,882, filed Jul. 13, 2021, U.S. Pat. No. 11,789,161, Oct. 17, 2023, Granted. [cited by applicant]
U.S. Appl. No. 17/374,891, filed Jul. 13, 2021, U.S. Pat. No. 11,536,855, Dec. 23, 2022, Granted. [cited by applicant]
U.S. Appl. No. 17/948,171, filed Sep. 19, 2022, US 20230128817, Apr. 27, 2023, Pending. [cited by applicant]
U.S. Appl. No. 17/948,176, filed Sep. 16, 2022, US 20230118946, Apr. 20, 2023, Pending. [cited by applicant]
U.S. Appl. No. 17/948,182, filed Sep. 16, 2022, US 20230121760, Apr. 20, 2023, Pending. [cited by applicant]
U.S. Appl. No. 17/948,190, filed Sep. 16, 2022, US 20230118232, Apr. 20, 2023, Pending. [cited by applicant]
U.S. Appl. No. 17/948,213, filed Sep. 19, 2022, Pending. [cited by applicant]
U.S. Appl. No. 18/369,114, filed Sep. 15, 2023, US 20240103181, Mar. 18, 2024, Pending. [cited by applicant]
U.S. Appl. No. 18/369,119, filed Sep. 15, 2023, US 20240094402, Mar. 21, 2024, Pending. [cited by applicant]
PCT/US21/41664, Jul. 14, 2021, WO2022015873, Jan. 20, 2022, Expired. [cited by applicant]
2110165.4, Jul. 14, 2021, GB 2601584, Jun. 8, 2022, Pending. [cited by applicant]
2110163.9, Jul. 14, 2021, GB 2601860, Jun. 15, 2022, Pending. [cited by applicant]
2110163.9, Jul. 14, 2021, GB 2601861, Jun. 15, 2022, Pending. [cited by applicant]
2391957.2, Jan. 25, 2023, Pending. [cited by applicant]
2413424.9, Sep. 12, 2024, Pending. [cited by applicant]
U.S. Appl. No. 17/948,171, filed Sep. 16, 2022, US 20230128817, Apr. 27, 2023, Pending. [cited by applicant]
U.S. Appl. No. 18/369,114, filed Sep. 15, 2023, Pending. [cited by applicant]
U.S. Appl. No. 18/369,119, filed Sep. 15, 2023, Pending. [cited by applicant]
User Manual—Detailed Guide to Usage of Application, Spirent Communications, dated Jul. 1, 2020, 17 pages. [cited by applicant]
PNT—Assurance System Architecture, Navigation Assurance Forecast, Spirent, dated Jun. 2020, 7 pages. [cited by applicant]
Autonomous emergency manoeuvering and movement monitoring for road and transport security, TransSec, dated Jul. 31, 2018, 33 pages. [cited by applicant]
Recommendation ITU-R P.1407-7, Multipath propagation and parameterization of its characteristics, Radiocommunication Sector of International Telecommunication Union, dated Aug. 2019, 31 pages. [cited by applicant]
Recommendation ITU-R P.681-11, Propagation data required for the design systems in the land mobile-satellite service, Radiocommunication Sector of International Telecommunication Union, dated Aug. 2019, 63 pages. [cited by applicant]
Radisic et. al., The Effect of Terrain Mask on RAIM Availability, Journal of Navigation, dated Jan. 2010, 15 pages. [cited by applicant]
Gadgil, Ring Buffers, Kalyani Gadgil's blog, dated Feb. 4, 2019, 5 pages. Retrieved on Jun. 18, 2020. Retrieved from the internet [URL: https://kalyanigadgil.wordpress.com/2019/02/04/ring-buffers/]. [cited by applicant]
Hsu et. al., NLOS Correction/Exclusion for GNSS Measurement Using RAIM and City Building Models, Sensors, published Jul. 17, 2015, 21 pages. [cited by applicant]
GNSS Planning Website, Trimble, dated Jul. 27, 2018, 5 pages. [cited by applicant]
Spirent, Realistic Multipath and Obscuration Simulation—Simulating the Impact of the Local Environment on GNSS Signals, Spirent Sim3D, dated Jan. 2020, 4 pages. [cited by applicant]
Spirent, SimGEN Software Suite for Spirent GNSS Constellation Simulation Systems, dated May 2020, 45 pages. [cited by applicant]
GNSS Mission Planning, Navmatix, 4 pages. Retrieved on Jun. 17, 2020. Retrieved from the internet [URL: http://gnssmissionplanning.com/ ]. [cited by applicant]
Recommendation ITU-R P.2145-2, Model Parameters for the physical-statisical wideband model, Radiocommunication Sector of International Telecommunication Union, dated Sep. 2017, 101 pages. [cited by applicant]
Rakipi et. al., Integrity Monitoring in Navigation Systems: Fault Detection and Exclusion RAIM Algorithm Implementation, Journal of Computer Communications, published May 28, 2018, 9 pages. [cited by applicant]
Technical Standard Order, Traffic Awareness Beacon System (TABS), Federal Aviation Administration—Department of Transportation, dated Oct. 10, 2014, 48 pages. [cited by applicant]
Berres et. al., GNSS Receiver Performance Assessment in Varied Multipath Environments with Real-World Simulation System, Association for Unmanned Vehicle Systems International (AUVSI) Proceedings, dated 2020, 17 pages. [cited by applicant]
Diggelen, End Game for Urban GNSS: Google's Use of 3D Building Models, Inside GNSS (IG), dated Mar. 21, 2021, 16 pages. Retrieved on Jul. 6, 2021. Retrieved from the internet [URL: https://insidegnss.com/end-game-for-ur… [cited by applicant]
NovAtel Inc., An Introduction to GNSS—Chapter 5—Resolving Errors—Real-Time Kinematic, Second Edition, published 2015, 2 pages. [cited by applicant]
Section 2—Area Navigation (RNAV) and Required Navigation Performance (RNP), Federal Aviation Administration, 8 pages. Retrieved on Oct. 22, 2021. Retrieved from the internet [URL: https://tfmlearning.faa.gov/publication… [cited by applicant]
Synopsys, The 6 Levels of Vehicle Autonomy, dated 2021, 7 pages. Retrieved on Oct. 22, 2021. Retrieved from the internet [URL: https://www.synopsys.com/automotive/autonomous-driving-levels.html ]. [cited by applicant]
Stanford, Ray Tracing Alternatives, dated 1997-98, 2 pages. Retrieved on Jun. 15, 2021. Retrieved from the internet [URL: https://cs.stanford.edu/people/eroberts/courses/soco/projects/1997-98/ray-tracing/alternatives.ht… [cited by applicant]
Li et. al., A Tightly Coupled Positioning Solution for Land Vehicles in Urban Canyons, Hindawi, Journal of Sensors, dated 2017, 11 pages. [cited by applicant]
OneSky SDSP Services, OneSky Systems Inc., 7 pages. Retrieved on Oct. 22, 2021. Retrieved from the internet [URL: https://saas.onesky.xyz/SDSP/Documentation/Navigation ]. [cited by applicant]
PCT/US2021/041664—Partial Search Report dated Nov. 4, 2021, 18 pages. [cited by applicant]
Nakaaki et al., “Development of a Precision Index and a Precision Forecast System for RTK-GNSS”, 2019 IEEE Vehicular Networking Conference (VNC), 3-5-1 Johoku, Hamamatsu, Shizuoka 432-8011, Japan, Dec. 4, 2019, pp. 1-7. [cited by applicant]
Suh et al, “Evaluation of Satellite-Based Navigation Services in Complex Urban Environments Using a Three-Dimensional GIS”, IEICE Transaction on Communication, Communications Society, Tokyo, JP, vol. E90B, No. 7, Jul. 1… [cited by applicant]
Causa et al., “Multi-UAV Path Planning for Autonomous Missions in Mixed GNSS Coverage Scenarios”, SENSORS, vol. 18, No. 12, Nov. 29, 2018, 27 pages. [cited by applicant]
Spirent, “Enabling reliable GNSS performance for autonomous urban driving”, a Spirent Ebook, Oct. 5, 2021, 12 pages. [cited by applicant]
Parkinson et al., “Global Positioning System: Theory and Applications”, vol. 1, vol. 163 Progress in Astronautics and Aeronautics, Published by the American Institute of Aeronautics and Astronautics, Inc., Washington, D… [cited by applicant]
Geohash, Wikipedia—Geohash 2008 public domain, 7 pages, retrieved on Dec. 22, 2010. Retrieved from the internet [URL: http://en.wikipedia.org/wiki/Geohash ]. [cited by applicant]
Anonymous, Algorithm for Finding Nearby Points?—Stack Overflow, 3 pages, retreieved on Dec. 22, 2010. Retrieved from the internet [URL: http://stackoverflow.com/questions/838344/algorithm-for-finding-nearby-points ]. [cited by applicant]
Butler, Playing Nice—LBS and Hybrid location technologies, EETImes, dated Dec. 8, 2009, 4 pages. Retrieved on Dec. 22, 2010. Retrieved from the internet [URL: https://www.eetimes.com/General/DisplayPrintViewContent?cont… [cited by applicant]
Kojo, Seawind: a WIreless Network Emulator, Proceedings of 11th GI/ITG Conference of Measuring, Modelling and Evaluation of Computer and Communication Systems, 2001, 16 pages. [cited by applicant]
CiteSeerX—Seawind: a Wireless Network Emulator Summary, dated 2001, 2 pages, retrieved on Feb. 20, 2014. Retrieved from the internet [URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.3281]. [cited by applicant]
INS—Integrated Navigation Systems, GNSS Product Design, GNSS Solutions. Retrieved on Sep. 21, 2012. Retrieved from the internet [URL: http://inavsystems.com/index_files?Page607.htm ]. [cited by applicant]
Global Positioning System. Wikipedia, the Free Encyclopedia. last modified on Nov. 6, 2012, retrieved on Nov. 9, 2012. Retrieved from the internet <http://en.wikipedia.org/w/index.php?title=Global_Positioning_System&oil… [cited by applicant]
Synchros Interactive, Proximity Searching with GeoHash, dated Aug. 2, 2010, 4 pages. Retrieved on Dec. 22, 2010. Retrieved from the internet [URL: http://www.synchrosinteractive.com/blog/1-software/38-geohash ]. [cited by applicant]
Eppstein, Geometry in Action, Cartography and Geographic Information Systems, 6 pages, retrieved on Dec. 9, 2010. Retrieved from the internet [URL: http://www.ics.uci.edu/˜eppstein/gina/carto.html ]. [cited by applicant]
Gupta R, How to Use GNSS Simulators to Test RTK Positioning Systems, Spirent.com, Feb. 1, 2016, 6 pages (downloaded from https://spirent.com/blogs/how-to-use-gnss-simulators-to-test-RTK). [cited by applicant]
Obst et al “Urban Multipath Detection and Mitigation with Dynamic 3D Maps for Reliable Land Vehicle Localization”, Proceedings of IEEE Ion Plans 2012, /Ion Plans, Apr. 26, 2012 (Apr. 26, 2012), pp. 685-691. [cited by applicant]
Zhang et al “A New Path Planning Algorithm Using a GNSS Localization Error Map for UAVs in an Urban Area”, Journal of Intelligent, vol. 94, No. 1, Aug. 3, 2018 (2018-08-03) , pp. 219-235. [cited by applicant]
PCT/US2021/041664—Internatioal Search Report & Written Opinion dated Mar. 31, 2022, 34 pages. [cited by applicant]
GB2110163.9—Partial Search Report dated Apr. 6, 2022 , 2 page. [cited by applicant]
GB2110164.7—Search Report dated Apr. 6, 2022 , 2 pages. [cited by applicant]
GB2110165.4—Search Report dated Apr. 4, 2022 , 1 pages. [cited by applicant]
Anonymous, The Essential CDN Guide—Chapter 1, What is a CDN, Imperva, retreived on Jun. 3, 2022, 14 pages. Retrieved from the internet [URL: https://www.imperva.com/learn/performance/what-is-cdn-how-it-works/ ]. [cited by applicant]
Misener, SAE Connected Vehicle Standards, SAE International, CES 2016, dated Jan. 6, 2016, 10 pages. [cited by applicant]
Pineiro et al., How to evaluate models: Observed vs. predicted or predicted vs. observed, Ecological Modelling, dated Sep. 2008, 2 pages. [cited by applicant]
GB2110163.9—Search Report dated Apr. 12, 2022 , 2 pages. [cited by applicant]
Imperva, The Essential CDN Guide, Chapter 1: What is a CDN?, Apr. 22, 2019, 5 pages. [cited by applicant]
PCT/US2021/041664—2nd Written Opinion dated Dec. 12, 2022, 16 pages. [cited by applicant]
GB2110165.4—Further Search Report dated Jan. 20, 2023, 3 pages. [cited by applicant]
PCT/US2021/041664—International Preliminary Report of Patentability dated Mar. 14, 2023, 17 pages. [cited by applicant]
GB2301057.2—Combined Search and Examination Report dated Jul. 21, 2023, 9 pages. [cited by applicant]
GNSS Foresight, Spirent Communications, Inc., Jun. 12, 2022, 9 pages (downloaded from https.www.spirent.com/products/gnss-foresight-forecasting.com). [cited by applicant]
GNSS Foresight for aviation, Spirent Communications, Inc. Jan. 2022, 4 pages. [cited by applicant]
Achieving Reliable GNSS Performance for Autonomous UAS Navigation, Spirent Communications, Inc,, MCD00454, Issue 1-00, Sep. 2021, 12 pages. [cited by applicant]
Spirent Charts the Way Forward For Autonomous Systems with Industry-first BVLOS Mission Ebabler, Spirent Communications, Inc., Sep. 20, 2021 (downloaded from hhttps://www.spirent.com/newsroom/press-releases/spirent-char… [cited by applicant]
Spirent Brings Realistic Testing to Emerging LEO Satellite Applications, Spirent Communications, Inc., Dec. 4, 2022, 4 pages (downloaded from https://www.spirent.com/newsroom/press-releases/spirent-brings-realistic-test… [cited by applicant]
LEO Azimuth Tracking! APRS.org, (downloaded Sep. 14, 2023 from http://aprs.org/LEO-tracking.htm). [cited by applicant]
Giggenbach et al, System Aspects of Optical Leo-To-Ground Links, ICSO 2016 International Conference on Space Optics, Oct. 18-21, 2016, 8 pages. [cited by applicant]
GB2301057.2—Response to Combined Search and Examination Report filed Sep. 16, 2024, 14 pages. [cited by applicant]