IP Library › Granted Patent US 12,462,695
Granted Patent B2
US 12,462,695 · App. 17/957,357 · Granted Nov 4, 2025

Conflict resolution for malformed blocked airspace designations

Inventors: William Edward Hammersla, III (Mechanicsville, MD); Joe Galindo (Washington, DC); Justin P. Oberman (Chicago, IL); Michael Manatrizio (Atlanta, GA)
Assignee: Glass Aviation Holdings, Inc.
G08G5/34G08G5/55G08G5/59
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,462,695
App. No.
17/957,357
Granted
Nov 4, 2025
Kind
B2
Abstract

In some aspects, the techniques described herein relate to a method including: receiving, by a processor, blocked airspace description data; converting, by a processor, a flight path into a plurality of latitude-longitude pairs; expanding, by the processor, the blocked airspace description data into a plurality of potential blocked airspace sub-regions, each of the potential blocked airspace sub-regions including a geographical area; identifying, by the processor, a subset of the potential blocked airspace sub-regions based on comparing flight steps between respective latitude-longitude pairs and geographic areas of the potential blocked airspace sub-regions; and using, by the processor, the subset of the potential block airspace sub-regions to adjust the flight path.

Claims (44)

1 . A method comprising:

receiving, by one or more processors, blocked airspace description data;

converting, by the one or more processors, a flight path into a plurality of latitude-longitude pairs;

expanding, by the one or more processors, the blocked airspace description data into a plurality of potential blocked airspace sub-regions, each of the potential blocked airspace sub-regions including a geographical area;

comparing, by the one or more processors, a plurality of flight steps between the plurality of respective latitude-longitude pairs of the flight path to one or more geographic areas associated with each of the plurality of potential airspace sub-regions;

determining, by the one or more processors, one or more intersections between the plurality of flight steps and the plurality of potential airspace sub-regions based on the comparison;

filtering, by the one or more processors, the plurality of potential blocked airspace sub-regions to a list of one or more potential blocked airspaces based on the one or more intersections; and

adjusting, by the one or more processors, the flight path based on the list of one or more potential blocked airspaces.

2 . The method of claim 1 , wherein converting a flight path into a plurality of latitude-longitude pairs comprises converting a plurality of fixes in the flight path into the plurality of latitude-longitude pairs.

3 . The method of claim 1 , wherein expanding the blocked airspace description data into a plurality of potential blocked airspace sub-regions comprises identifying an ambiguous blocked airspace identifier in the blocked airspace description data and identifying a plurality of blocked airspace regions that encompass the ambiguous blocked airspace identifier.

4 . The method of claim 1 , wherein expanding the blocked airspace description data into a plurality of potential blocked airspace sub-regions comprises identifying a rule for processing an ambiguous blocked airspace identifier in the blocked airspace description data and applying the rule to the ambiguous blocked airspace identifier, the rule including a format and processing directive.

5 . The method of claim 1 , wherein expanding the blocked airspace description data into a plurality of potential blocked airspace sub-regions comprises identifying at least one error in the blocked airspace description data and generating a set of blocked airspace identifiers permutations based on the at least one error.

6 . The method of claim 1 , wherein determining, by the one or more processors, one or more intersections between the plurality of flight steps and the plurality of potential airspace sub-regions comprises determining if a line segment of a given flight steps passes through a geographic area of a potential blocked airspace sub-region.

7 . The method of claim 6 , wherein determining, by the one or more processors, one or more intersections between the plurality of flight steps and the plurality of potential airspace sub-regions comprises determining if a line segment of a given flight steps intersects at least one border of a geographic area of a potential blocked airspace sub-region.

8 . A non-transitory computer-readable storage medium for tangibly storing computer program instructions capable of being executed by one or more computer processors, the computer program instructions defining steps of:

receiving blocked airspace description data;

converting a flight path into a plurality of latitude-longitude pairs;

expanding the blocked airspace description data into a plurality of potential blocked airspace sub-regions, each of the potential blocked airspace sub-regions including a geographical area;

identifying a subset of the potential blocked airspace sub-regions based on comparing flight steps between respective latitude-longitude pairs and geographic areas of the potential blocked airspace sub-regions; and

comparing a plurality of flight steps between the plurality of respective latitude-longitude pairs of the flight path to one or more geographic areas associated with each of the plurality of potential airspace sub-regions;

determining one or more intersections between the plurality of flight steps and the plurality of potential airspace sub-regions based on the comparison;

filtering the plurality of potential blocked airspace sub-regions to a list of one or more potential blocked airspaces based on the one or more intersections; and

adjusting the flight path based on the list of one or more potential blocked airspaces.

9 . The non-transitory computer-readable storage medium of claim 8 , wherein converting a flight path into a plurality of latitude-longitude pairs comprises converting a plurality of fixes in the flight path into the plurality of latitude-longitude pairs.

10 . The non-transitory computer-readable storage medium of claim 8 , wherein expanding the blocked airspace description data into a plurality of potential blocked airspace sub-regions comprises identifying an ambiguous blocked airspace identifier in the blocked airspace description data and identifying a plurality of blocked airspace regions that encompass the ambiguous blocked airspace identifier.

11 . The non-transitory computer-readable storage medium of claim 8 , wherein expanding the blocked airspace description data into a plurality of potential blocked airspace sub-regions comprises identifying a rule for processing an ambiguous blocked airspace identifier in the blocked airspace description data and applying the rule to the ambiguous blocked airspace identifier, the rule including a format and processing directive.

12 . The non-transitory computer-readable storage medium of claim 8 , wherein expanding the blocked airspace description data into a plurality of potential blocked airspace sub-regions comprises identifying at least one error in the blocked airspace description data and generating a set of blocked airspace identifiers permutations based on the at least one error.

13 . The non-transitory computer-readable storage medium of claim 8 , wherein determining one or more intersections between the plurality of flight steps and the plurality of potential airspace sub-regions comprises determining if a line segment of a given flight steps passes through a geographic area of a potential blocked airspace sub-region.

14 . The non-transitory computer-readable storage medium of claim 13 , wherein determining one or more intersections between the plurality of flight steps and the plurality of potential airspace sub-regions comprises determining if a line segment of a given flight steps intersects at least one border of a geographic area of a potential blocked airspace sub-region.

15 . A device comprising:

one or more processors; and

a storage medium for tangibly storing thereon logic for execution by the one or more processors, the logic comprising instructions for:

receiving blocked airspace description data;

converting a flight path into a plurality of latitude-longitude pairs

expanding the blocked airspace description data into a plurality of potential blocked airspace sub-regions, each of the potential blocked airspace sub-regions including a geographical area;

comparing, by the one or more processors, a plurality of flight steps between the plurality of respective latitude-longitude pairs of the flight path to one or more geographic areas associated with each of the plurality of potential airspace sub-regions;

determining, by the one or more processors, one or more intersections between the plurality of flight steps and the plurality of potential airspace sub-regions based on the comparison;

filtering, by the one or more processors, the plurality of potential blocked airspace sub-regions to a list of one or more potential blocked airspaces based on the one or more intersections; and

adjusting the flight path based on the list of one or more potential blocked airspaces.

16 . The device of claim 15 , wherein expanding the blocked airspace description data into a plurality of potential blocked airspace sub-regions comprises identifying an ambiguous blocked airspace identifier in the blocked airspace description data and identifying a plurality of blocked airspace regions that encompass the ambiguous blocked airspace identifier.

17 . The device of claim 15 , wherein expanding the blocked airspace description data into a plurality of potential blocked airspace sub-regions comprises identifying a rule for processing an ambiguous blocked airspace identifier in the blocked airspace description data and applying the rule to the ambiguous blocked airspace identifier, the rule including a format and processing directive.

18 . The device of claim 15 , wherein expanding the blocked airspace description data into a plurality of potential blocked airspace sub-regions comprises identifying at least one error in the blocked airspace description data and generating a set of blocked airspace identifiers permutations based on the at least one error.

19 . The device of claim 15 , wherein determining one or more intersections between the plurality of flight steps and the plurality of potential airspace sub-regions comprises determining if a line segment of a given flight steps passes through a geographic area of a potential blocked airspace sub-region.

20 . The device of claim 19 , wherein determining one or more intersections between the plurality of flight steps and the plurality of potential airspace sub-regions comprises determining if a line segment of a given flight steps intersects at least one border of a geographic area of a potential blocked airspace sub-region.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 30, 2022
From: HAMMERSLA, WILLIAM EDWARD, III; GALINDO, JOE; OBERMAN, JUSTIN P.; MANATRIZIO, MICHAEL
To: GLASS AVIATION HOLDINGS, INC.
Reel/Frame 061272/0302 →
Continuity (2)
Continuation In Part 17706816 · Mar 29, 2022
Related Publication 20230316935A1 · Oct 5, 2023
References Cited (23)
US 20140018979A1 · Goossen et al. · 2014 [cited by applicant]
US 20160180715A1 · Burke · 2016 [cited by applicant]
US 20170278409A1 · Johnson · 2017 [cited by examiner]
US 20180293898A1 · Redmann · 2018 [cited by examiner]
US 20200058225A1 · Heiberg · 2020 [cited by examiner]
US 20210255616A1 · Surace · 2021 [cited by applicant]
US 20210351987A1 · Gomez · 2021 [cited by applicant]
US 20210351997A1 · Luft et al. · 2021 [cited by applicant]
US 20210358311A1 · Tantardini et al. · 2021 [cited by applicant]
US 20220058964A1 · Johnson · 2022 [cited by applicant]
US 20220083920A1 · Lester · 2022 [cited by applicant]
US 20220406200A1 · Bush · 2022 [cited by examiner]
US 20230121171A1 · Bosworth · 2023 [cited by examiner]
US 20230267839A1 · Hawley · 2023 [cited by examiner]
US 20230316936A1 · Hammersla, III · 2023 [cited by applicant]
US 20240161634A1 · Faccin · 2024 [cited by examiner]
JP 2014040231A · 2014 [cited by applicant]
International Search Report and Written Opinion to corresponding International Application No. PCT/US23/65016 mailed Sep. 28, 2023. [cited by applicant]
Dorsey, “The FAA Just Made it Easier to Fly Your Drone Near Airports,” pp. 1-17, The Points Guy, <URL: https://thepointsguy.com/news/faa-made-it-easier-fly-drone-near-airports/> (2018). [cited by applicant]
Hammersla III et al., Office Action dated Jul. 17, 2024, directed to U.S. Appl. No. 17/706,816; 9 pages. [cited by applicant]
Hammersla III et al., Office Action dated Nov. 21, 2023, directed to U.S. Appl. No. 17/706,816; 21 pages. [cited by applicant]
International Search Report and Written Opinion to corresponding International Application No. PCT/US23/65016 mailed Sep. 28, 2023, 13 pages. [cited by applicant]
Dorsey, “The FAA Just Made it Easier to Fly Your Drone Near Airports,” pp. 1-17 (2018). [cited by applicant]