System and method to operate radio of aircraft to connect to radio towers according to command and control communication plan
US-2024282198-A1 · Aug 22, 2024 · US
US2016358480A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2016358480-A1 |
| Application number | US-201514733550-A |
| Country | US |
| Kind code | A1 |
| Filing date | Jun 8, 2015 |
| Priority date | Jun 8, 2015 |
| Publication date | Dec 8, 2016 |
| Grant date | — |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A flight routing system for determining an alternative route for an aircraft based on an airspace partitioned into a plurality of sectors, and an original flight route having an initial point of takeoff and a destination point is disclosed. The flight routing system includes a processor and a memory storing instructions executable by the processor to perform operations including determining a plurality of points within each of the plurality of sectors. The plurality of points are each located along an edge of one of the plurality of sectors. The processor also performs operations including determining at least one connecting arc for each sector, where the connecting arc connects a first point with another point within each sector. The processor further performs operations for determining a complete time-based airspace network based on at least a forecast capacity.
Opening claim text (preview).
What is claimed is: 1 . A flight routing system for determining an alternative route for an aircraft based on an airspace that is partitioned into a plurality of sectors and an original flight route, wherein the original flight route has an initial point of takeoff and a destination point, the flight routing system comprising: a processor; and a memory storing instructions executable by the processor to perform operations comprising: determining a plurality of points within each of the plurality of sectors, wherein the plurality of points are each located along an edge of one of the plurality of sectors; determining at least one connecting arc for each of the plurality of sectors, wherein the at least one connecting arc connects a first point with another point located along one of the edges of each of the plurality of sectors; determining a complete time-based airspace network based on at least a forecast capacity, wherein the forecast capacity indicates an available capacity for each of the plurality of sectors and which of the plurality of sectors are unavailable; and selecting the alternative route as output based on at least the complete time-based airspace network and the at least one connecting arc for each of the plurality of sectors. 2 . The flight routing system of claim 1 , wherein the processor receives as input a maximum connecting angle parameter measured between a perpendicular line at a specific point on a selected edge of a selected sector and one of the at least one connecting arcs. 3 . The flight routing system of claim 1 , wherein the processor performs an operation to determine a plurality of intersections, wherein each of the plurality of intersections represent where the edge of one of the plurality of sectors and the original flight route intersect. 4 . The flight routing system of claim 3 , wherein the processor performs an operation to partition the original flight route into a series of individual arcs based on the plurality of intersections. 5 . The flight routing system of claim 3 , wherein the processor performs an operation to determine at least one jump on arc based on either the destination point or one of the plurality of intersections, wherein the at least one jumping on arc connects of the plurality of points to either one of the plurality of intersections or the destination point. 6 . The flight routing system of claim 3 , wherein the processor performs an operation to determine at least one jump of arc based on either the one of the plurality of intersections of the initial point of takeoff, wherein the at least one jump off arc connects one of the plurality of points to either one of the plurality of intersections or the initial point of takeoff. 7 . The flight routing system of claim 1 , wherein the available capacity is based on a number of aircraft that are simultaneously located within in a single sector. 8 . The flight routing system of claim 1 , wherein the forecast capacity is based on at least one of convective weather conditions, air traffic congestion, and restricted airspace. 9 . The flight routing system of claim 1 , wherein the processor determines the alternative route without any of the at least one connecting arcs located within an unavailable sector, and wherein the unavailable sector is representative of unavailable airspace. 10 . The flight routing system of claim 1 , wherein the plurality of sectors each include a unique shape that is a reflection of a flow and density of air traffic within the airspace. 11 . A computer-implemented method of determining an alternative route for an aircraft based on an airspace that is partitioned into a plurality of sectors and an original flight route having an initial point of takeoff and a destination point, the method comprising: determining a plurality of points within each of the plurality of sectors by a processor, wherein the plurality of points are each located along an edge of one of the plurality of sectors; determining at least one connecting arc for each of the plurality of sectors by the processor, wherein the at least one connecting arc connects a first point with another point located along one of the edges of each of the plurality of sectors; determining a complete time-based airspace network based on at least a forecast capacity, wherein the forecast capacity indicates an available capacity, for each of the plurality of sectors, and which of the plurality of sectors are unavailable; and selecting the alternative route by the processor based on at least the complete time-based airspace network and the at least one connecting arc for each of the plurality of sectors. 12 . The method of claim 11 , wherein the processor receives as input a maximum connecting angle measured between a perpendicular line at a specific point on a selected sector and one of the at least one connecting arcs. 13 . The method of claim 11 , wherein the processor determines a plurality of intersections, wherein each of the plurality of intersections represent where the edge of one of the plurality of sectors and the original flight route intersect. 14 . The method of claim 13 , wherein the processor partitions the original flight route into a series of individual arcs based on the plurality of intersections. 15 . The method of claim 13 , wherein the processor determines at least one jump on arc based on either the destination point or one of the plurality of intersections, wherein the at least one jumping on arc connects of the plurality of points to either one of the plurality of intersections or the destination point. 16 . The method of claim 13 , wherein the processor determines at least one jump off arc based on either the one of the plurality of intersections of the initial point of takeoff, wherein the at least one jump off arc connects one of the plurality of points to either one of the plurality of intersections or the initial point of takeoff. 17 . The method of claim 13 , wherein the available capacity is based on a number of aircraft that are simultaneously located within a single sector. 18 . The method of claim 17 , wherein the forecast capacity is based on at least one of convective weather conditions, air traffic congestion and restricted airspace. 19 . The method of claim 17 , wherein the processor determines the alternative route without any of the at least one connecting arcs located within an unavailable sector, and wherein the unavailable sector is representative of unavailable airspace. 20 . The method of claim 13 , wherein the plurality of sectors each include a unique shape that is a reflection of a flow and density of air traffic within the airspace.
Related publications grouped by family.
Answers are generated from the same data shown on this page.