EP3104119B1

EP3104119B1 - System and method for determining an alternative flight route based on sector geometry

Info

Publication number: EP3104119B1
Application number: EP16168080.6A
Authority: EP
Inventors: Laura S. Kang; Darryn R. Frafford; Michael L. Carter; Matthew E. Berge
Original assignee: Boeing Co
Current assignee: Boeing Co
Priority date: 2015-06-08
Filing date: 2016-05-03
Publication date: 2022-09-14
Anticipated expiration: 2036-05-03
Also published as: CN106251706B; JP2017001661A; JP6758902B2; CN106251706A; EP3104119A1; BR102016012822A2; US20160358480A1; US9870711B2

Description

FIELD

The disclosed system relates to a flight routing system for an aircraft and, more particularly, to a flight routing system for determining an alternative route for an aircraft based on an airspace partitioned into a plurality of sectors.

BACKGROUND

Sometimes portions of an aircraft's flight route may become unavailable due to disruptions such as, for example, convective weather conditions or air traffic congestion. In the event a portion of the flight route becomes unavailable, an alternative route that avoids the blocked airspace needs to be determined. Specifically, the aircraft should be re-routed along the alternative route, and directed to the final destination as quickly and as effectively as possible.
Two known and commonly used approaches for determining the alternative route are re-routing on a waypoint based network and re-routing on a uniform grid based network. The waypoint based network approach may be a relatively simple way to determine the alternative route. However, the waypoint network, as historically defined, includes a limited set of waypoints, which in turn translates into a limited set of re-routing options for the aircraft. This in turn often results in a longer detour than necessary around the blocked airspace. Re-routing on a uniform grid network typically includes a network of connected points uniformly spaced throughout the airspace and is often based on the center or edge points of a grid of polygons, such as, for example, hexagons, rectangles, or triangles. Determining the alternative route based on the uniform grid network is often inefficient as well, depending on the granularity of the grid as well as the approach used to form connections between the points.
In addition to the above mentioned difficulties, a route determined based on the uniform grid network may also be inoperable, depending on how the path of the route aligns with the airspace sectors' geometries. Specifically, the aircraft may fly too closely to an edge of a sector, or may even cut a corner of a sector. This should be avoided because of the extra workload created for air traffic controllers when the aircraft flies too closely to an edge of a sector, or cuts a corner of a sector. Accordingly, there exists a need in the art for an improved approach for determining an alternative route for an aircraft.
JP 2014 016264 A discloses an avoidance route derivation device, a avoidance route derivation program, and an avoidance route derivation method for deriving an avoidance route when an avoidance areas occurs in a flight path of an aircraft.
EP 2031 350 A1 discloses methods, systems, and apparatus for routing a vehicle to avoid an adverse condition.
WO 2003/025507 A discloses a four-dimensional route planner.

SUMMARY

The invention is defined in the independent claims 1 and 9.
Other objects and advantages of the disclosed method and system will be apparent from the following description, the accompanying drawings and the appended claims.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of an exemplary flight routing system for establishing routing for one or more aircraft, where the flight routing system includes a route planning control module;
FIG. 2 is an exemplary illustration of an airspace including a plurality of uniformly shaped sectors;
FIG. 3 is an exemplary illustration of a sector having an irregular shape;
FIG. 4 is a block diagram of the route planning control module shown in FIG. 1;
FIG. 5 is an exemplary illustration of the airspace in FIG. 2 where each edge of each sector includes a single point;
FIG. 6 is an illustration of a single sector seen in FIG. 5, where an arc is drawn between one of the points on an edge to another point on another edge of the sector;
FIG. 7 is an illustration of the sector in FIG. 6, where all of the possible arcs are determined;
FIG. 8 is an illustration of the airspace in FIG. 5 where each arc crossing the sectors are determined;
FIG. 9 is an illustration of the airspace shown in FIG. 5 where an original flight route intersects with edges of the sectors;
FIG. 10 is an illustration of the airspace shown in FIG. 9 including a set of jump off arcs as well as a set of jump on arcs;
FIG. 11 is illustration of a fully integrated airspace, including the original flight route, the set of jump off arcs, and the set of jump on arcs;
FIG. 12 is an illustration of a complete airspace, where a sector that is unavailable has been omitted; and
FIG. 13 is an illustration of a block diagram of an exemplary computing environment including a general purpose computing device for supporting embodiments of the present disclosure.

DETAILED DESCRIPTION

FIG. 1 is a block diagram illustrating an exemplary flight routing system 10 for establishing routing for one or more aircraft 20. The flight planning system 10 may include a route planning control module 22, a command and control system 24, and a transceiver 26. As explained in greater detail below, the flight planning system 10 may reroute one or more aircraft 20 in the event a portion of a specific aircraft's original flight route 30 (shown in FIG. 2) becomes unavailable due to disruptions. Some example of disruptions that may cause a portion of the original flight route 30 to become unavailable include, but are not limited to, convective weather conditions or air traffic congestion.
The command and control system 24 may send and receive information to and from each of the aircraft 20 through the transceiver 26. For example, the command and control system 24 may transmit updated routing information determined by the route planning control module 22 to one or more of the aircraft 20. The command and control system 24 may include one or more computers (not illustrated) that may be staffed by airline personnel. The command and control system 24 may be used to collect information relating to the various aircraft 20 such as, but not limited to, an initial point of takeoff or the current aircraft position, a destination point, aircraft type, the current position of the aircraft 20, weather conditions, air traffic control data, headings, altitudes, speed, originally planned flight route and fuel information. The information collected by the command and control system 24 may be shared with the route planning control module 22.
The route planning control module 22 may refer to, or be part of, an application specific integrated circuit (ASIC), an electronic circuit, a combinational logic circuit, a field programmable gate array (FPGA), a processor (shared, dedicated, or group) comprising hardware or software that executes code, or a combination of some or all of the above, such as in a system-on-chip. As explained in greater detail below, the route planning control module 22 includes control logic for determining an alternative route 32 (shown in FIG. 2) for a specific aircraft 20 in the event a portion of the specific aircraft's flight route becomes unavailable based on a plurality of inputs from the command and control system 24.
The route planning control module 22 includes control logic for determining the alternative route 32 based on a network formed from a plurality of sector geometries. More specifically, the route planning control module 22 may determine the alternative route 32 based on an airspace 42 that is partitioned into a plurality of sectors 40 (illustrated in FIG. 2). One example of airspace 42 that may be partitioned into the sectors 40 is the National Airspace System (NAS), however it should be understood that the present disclosure should not be limited to a specific airspace and may work regardless of how the airspace 42 is partitioned into individual sectors or geometries.
Turning now to FIG. 2, an exemplary illustration of the airspace 42 is shown, where the sectors 40 each include a hexagonal shape. Specifically, in the embodiment as illustrated the sectors 40 may be part of a uniform grid network 46, where each sector 40 includes substantially identical hexagonal profiles. It is to be understood that while FIG. 2 illustrates hexagonally-shaped sectors, this illustration is merely exemplary in nature, and disclosure should not be limited to the illustrated example. Indeed, the sectors 40 may be any type of polygon having a closed shape including, but not limited to, a triangle or a rectangle. Moreover, as seen in the embodiment as shown in FIG. 3, the sectors 40 may even be irregularly shaped polygons. It should also be appreciated that in practice, the sectors 40 are usually based upon standard real world sector geometries, which reflect the primary flows of aircraft and traffic levels throughout the airspace 42.
Referring back to FIG. 2, it should also be understood that the sectors 40 do not need to be shaped identically, and the sectors 40 are merely illustrated in this manner for purposes of simplicity and clarity. Indeed, those of ordinary skill in the art will appreciate that each sector 40 may include its own unique shape and may be, for example, standard real sector geometries defined in the NAS or in other airspace regions. Moreover, it is also understood the sectors 40 may include geometry that is a reflection of the flow and density of the air traffic within the airspace 42, as in the NAS. For example, the sectors 40 may be shaped to align with the prevalent flow of air traffic, where smaller sectors 40 may be provided in areas with higher air traffic.
As seen in FIG. 2, the original flight route 30 of the aircraft 20 is depicted between an initial point of takeoff 52 and a destination point 54. The aircraft 20 may be diverted from the original flight route 30 and is rerouted to follow the alternative route 32. The alternative route 32 may eventually guide the aircraft 20 to its destination point 54. The route planning control module 22 (shown in FIG. 1) includes control logic for determining the alternative route 32 based on the geometry of the sectors 40. Specifically, the route planning control module 22 calculates or determines the alternative route 32 based on nodes or points 60 that are located along edges 62 of each individual sector 40 (FIG. 3).
FIG. 4 is a block diagram of the route planning control module 22. The route planning control module 22 may include plurality of sub-modules and control logic for determining the alternative route 32 (shown in FIG. 2). In the embodiment as shown in FIG. 4, the route planning control module 22 includes an edge point sub-module 72, an arc determination sub-module 74, a sector crossing sub-module 76, a connector sub-module 78, an integration sub-module 80, a capacity sub-module 82, and a route calculation sub-module 84.
Referring to FIGS. 4 and 5, the edge point sub-module 72 of the route planning control module 22 receives as input airspace sector geometries 92 and control parameters 94, and determines a specific location of each point 60 located along the edges 62 of each individual sector 40. The airspace sector geometries 92 contain a description specifying the specific shape of all of the sectors 40 within the airspace 42. For example, in the embodiment as shown in FIG. 5, the airspace sector geometries 92 would describe the geometry of the sectors 40 as uniformly hexagonal. In one embodiment, the control parameters 94 include, but are not limited to, a maximum connecting angle θ_max, a minimum number of points 60 located on each edge 62 of the sectors 40, and maximum distance measured between points 60 on the same edge 62 of the sectors 40 (if the edges 62 include more than one point 60).
The edge point sub-module 72 of the route planning control module 22 determines how many points 60 should be placed along each edge 62 of each sector 40 based on the control parameters 94, as well as the specific location of each point 60 for each sector 40. For example, in the embodiment as shown in FIG. 5, a single point 60 is located along each edge 62 of each sector 40, along a midpoint M of each edge 62. Although FIG. 5 illustrates a single point 60 located at each edge 62, it is to be understood that multiple points 60 may be located along a single edge 60 as well. For example, in the embodiment as shown in FIG. 3, a longer edge 104 of the sector 40 includes two points 60.
The maximum connecting angle θ_max for each sector 40 used by the arc determination submodule 74 shall now be explained. The maximum connecting angle θ_max is indicative of a maximum angle that may be measured between two of the points 60 of a single sector 40, and is explained in greater detail below and illustrated in FIG. 6. Turning now to FIG. 6, an illustration of an exemplary sector 40 is shown, The sector 40 includes a single point 60 located along each edge 62. As seen in FIG. 6, a connecting arc 100 may be used to connect one of the points 60 with another point 60 located along another edge 62 of the sector 40. A connecting angle θ may be measured between a perpendicular line 102, which is perpendicular to the edge 62 of an initiating point 60A, and a potential connecting arc 100A. The connecting angle θ is the angle measured between the perpendicular line 102 and the potential arc 100A. For example, in the embodiment as shown in FIG. 6, the connecting angle θ for the potential arc 100A is about thirty degrees. If the connecting angle θ is less than the maximum connecting angle θ_max, then the potential arc 100A may be included. However, it should be appreciated that any connecting arcs 100 that form a connecting angle θ greater than θ_max are not included as connecting arcs in forming the network. Thus, if the maximum connecting angle θ_max is set to forty degrees, then the points 60 that are located on edges 62 directly adjacent to another may not be connected to one another by one of the connecting arcs 100, since this would require the connecting arcs 100 to be positioned at an angle that is greater than forty degrees.
It is to be understood that an absolute value of a negative connecting angle may be used when comparing to the maximum connecting angle θ_max. The maximum connecting angle θ_max may be based on factors such as, but not limited to, limitations of the specific aircraft performance, air traffic control, and the desired connectedness of the network in traversing one of the sectors 40. It should also be appreciated that if the maximum connecting angle θ_max is too large, then this may result in a route that cuts through the corner or a sector 40.
Referring to FIGS. 4 and 7, the arc determination sub-module 74 of the route planning control module 22 receives as input the specific location of each of the points 60 located along the edges 62 of each individual sector 40 of the airspace 42 as determined by the edge point sub-module 72, and determines a set of connecting arcs 100 for each individual sector 40 based on the input. FIG. 7 illustrates a single sector 40, where each connecting arc 100has been determined by the arc determination sub-module 74. As explained above, the points 60 located on edges 62 directly adjacent to another may not be connected to one another by one of the connecting arcs 100, since this would require the connecting arcs 100 to be positioned at an angle that is greater than the maximum connecting angle θ_max (which is forty degrees in the present example). As seen in FIG. 8, one of the points 60 of each sector 40 may be connected to at least one other point 60 along another edge 62 of the sector 40, and connecting arcs 100 formed from individual sectors 40 may connect to connecting arcs 100 located within adjacent sectors 40 to form a network of arcs through the entire airspace 42.
It is to be appreciated that if a specific connecting arc 100 is formed that falls outside the edges 62 of one of the sectors 40, then the specific connecting arc 100 may be eliminated. It should also be understood that since all of the sectors 40 shown in FIG. 8 are generally hexagonal, none of the connecting arcs 100 may fall outside of the edges 62. However, as seen in FIG. 3, the connecting arc 100' falls outside of the edges 62, and therefore would be eliminated.
Referring to FIGS. 2 and 4, the sector crossing sub-module 76 of the route planning control module 22 receives as input a set of waypoints 110 used to determine the original flight route 30, a designator 112 which indicates that rerouting of the original flight route 30 is required, and the airspace sector geometries 92. As seen in FIG. 2, the original flight route 30 is a planned flight route, and includes two waypoints 110 (e.g., the initial point of takeoff 52 and the destination point 54). The initial point of takeoff 52 may similarly be the current location of the aircraft 20 at the time the alternative route 32 is determined. In the embodiment as shown in FIG. 2, the original flight route 30 is assumed to be direct, and is shown as a straight line for purposes of simplicity and clarity, and therefore only requires two waypoints 110. However, those of ordinary skill in the art will readily appreciate that an aircraft's original flight route may not be straight, and may include more than two waypoints that are connected to one another. The designator 112 provides an indication that rerouting of the original flight route 30 is required because the original flight route 30 (shown in FIG. 2) is unavailable due to disruptions such as convective weather conditions or air traffic congestion.
Referring to FIGS. 4 and 9, the sector crossing sub-module 76 of the route planning control module 22 determines all of the locations within the airspace 42 where the original flight route 30 intersects with the edges 62 of the sectors 40. As seen in FIG. 9, the exemplary original flight route 30 intersects with the edges 62 of the sectors 40 at three unique intersections 120, however it is to be appreciated that this illustration is merely exemplary in nature, and that any number of intersections may be determined based on the specific geometry of the original flight route 30. It is to be understood that while the original flight route 30 still appears the same, the original flight route 30 has actually been divided or partitioned into a series of four individual arcs 122. The arcs 122 are defined as segments between two of the intersections 120, or between one of the intersections and either the initial point of takeoff 52 of the destination point 54.
Referring to FIGS. 4 and 10, the connector sub-module 78 of the route planning control module 22 receives as input the intersections 120 determined by the sector crossing sub-module 76, and the connecting arcs 100 for each sector 40 within the airspace 42 (FIG. 8) determined by the arc determination sub-module 74. The connector sub-module 78 then determines a set of jump on arcs 130 as well as a set of jump off arcs 132 based on the input, As seen in FIG. 10, the jumping on arcs 130 connect one of the points 60 of one of the sectors 40 of the uniform grid network 46 to one of the intersections 120, or the destination point 54 (i.e., the arc jumps onto the original flight route 30). The jumping off arcs 132 represent where one of the intersections 120 or the initial point of takeoff 52 connects to one of the points 60 of one of the sectors 40 of the uniform grid network 46 (i.e., the arc jumps off the original flight route 30).
Referring to FIGS. 4 and 11, the integration sub-module 80 of the route planning control module 22 receives as input the specific location of each of the points 60 located along the edges 62 of each individual sector 40 of the airspace 42, the set of connecting arcs 100 for each individual sector 40, the intersections 120, four individual arcs 122, the set of jump on arcs 130, and set of jump off arcs 132. The integration sub-module 80 may then combine all of the inputs together to create a fully integrated airspace network 140, which is seen in FIG. 11, and provides multiple pathways over which the aircraft 20 may traverse the airspace 42.
The capacity sub-module 82 of the route planning control module 22 receives as input a sector forecast capacity 142, as well as the fully integrated airspace network 140 as seen in FIG. 11. The sector forecast capacity 142 indicates a forecast of the available capacity for each sector 40 (i.e., a measure of how many aircraft may simultaneously be within in a sector 40), and also indicates which sector 40 or sectors 40 may be unavailable or have limited availability due to conditions such as, for example, convective weather conditions or air traffic congestion. The air traffic congestion may be referred to as restricted airspace, It is to be appreciated that the sector forecast capacity 142 is time-based, which means that the available capacity as well as the availability of a specific sector 40 may change as time progresses. Specifically, if there is a convective weather condition contained in one of the sectors 40 that make the sector unavailable, eventually the weather conditions will improve. Thus, the sector 40 will eventually become available again.
For example, in the embodiment as shown in FIG. 2 a specific sector 40' is shaded as an unavailable sector. The unavailable sector 40' is representative of unavailable airspace. Thus, the aircraft 20 is unable to fly through the specific sector 40', at least during the time the aircraft 20 would traverse the specific sector 40' to reach the destination point 54. Accordingly, the capacity sub-module 82 of the route planning control module 22 may then turn off or make all of the connecting arcs 100 located within the specific sector 40' from the integrated airspace 140 unavailable, thereby creating a complete time-based airspace network 150, which is shown in FIG. 12. As seen in FIG. 12, the complete time-based airspace network 150, which includes any arcs located within the specific sector 40' turned off. Thus, as can be seen in FIG. 12, the complete time-based airspace network 150 includes all of the arcs (e.g., the connecting arcs 100, the arcs 122, the jump on arcs 130, and the jump off arcs 132). The route planning control module 22 may now determine a valid, complete rerouting option for the aircraft 20 based on the complete time-based airspace network 150.
It is to be understood that because the complete time-based airspace network 150 is time-based, the illustration of the complete time-based airspace network 150 may change as time progresses. Specifically, the arcs included within the complete time-based airspace network 150 may change over time, where specific sectors 40 and their associated arcs may become available or unavailable for periods of time. Thus, it is important to determine the availability of each sector 40 within the complete time-based airspace network 150 based on a specific path through the complete time-based airspace network 150 and the estimated time when the aircraft would traverse a given sector 40.
Turning back to FIG. 4, the route calculation sub-module 84 of the route planning control module 22 receives as input the complete time-based airspace network 150 as determined by the forecast capacity sub-module 82. The route calculation sub-module may then determine the shortest potential route between the initial point of takeoff 52 and the destination point 54. Referring to both FIGS. 4 and 12, the shortest potential route may be calculated based on all of the arcs within the complete time-based airspace network 150, which include the connecting arcs 100, the arcs 122, the jump on arcs 130, and the jump off arcs 132. The route calculation sub-module 84 may then output the shortest route in terms of distance, which is the alternative route 32 as illustrated in FIG. 2.
Referring generally to the figures, the disclosed flight routing system 10 provides numerous benefits and advantages when compared to the existing flight routing systems that are currently available. Specifically, the disclosed flight routing system 10 includes a higher resolution network compared to a waypoint based network, therefore reducing the length of detours around blocked sectors, which in turn reduces the fuel consumption of an aircraft. Moreover, the disclosed flight routing system 10 is also flexible, since the number of points located along each edge of each sector and the maximum connecting angle θ_max (seen in FIG. 6) are both variable. Thus, the resolution of the sector network, even by individual sectors, may be controlled. Moreover, it is to be understood that even though the figures illustrated hexagonal sectors for simplicity and clarity, real airspace sector geometries may be used in practice, which reflect the primary traffic flow and density of the air traffic. Thus, the sectors may be shaped to align with the prevalent flow of air traffic and reflect the air traffic density. Therefore, smaller sectors may be provided in areas with higher air traffic, which results in sectors that are aligned with the flow of air traffic. Using sector geometries based on air traffic and density may result in reroute options that are more likely to be operationally favorable.
FIG. 13 is an illustration of a block diagram of a computing environment 300 including a general purpose computing device 310 for supporting embodiments of computer-implemented methods and computer-executable program instructions (or code) according to the present disclosure. For example, the computing device 310, or portions thereof, may execute instructions to adaptively encode/decode data in a particular number of bits. The computing device 310, or portions thereof, may further execute instructions according to any of the methods described herein.
The computing device 310 may include a processor 320. The processor 320 may communicate with a system memory 330, one or more storage devices 340, one or more input/output interfaces 350, one or more communications interfaces 360, or a combination thereof. The system memory 330 may include volatile memory devices (e.g., random access memory (RAM) devices), nonvolatile memory devices (e.g., read-only memory (ROM) devices, programmable read-only memory, and flash memory), or both. The system memory 330 may include an operating system 332, which may include a basic/input output system for booting the computing device 310 as well as a full operating system to enable the computing device 310 to interact with users, other programs, and other devices.
The system memory 330 may include one or more computer programs or applications 334 which may be executable by the processor 320. For example, the applications 334 may include instructions executable by the processor 320 to determine the alternative route 32 (FIG. 2). The system memory 330 may include program data 336 usable for controlling the analysis of data. The applications 334 may also be embodied in a computer readable medium having the applications 334 stored therein.
The processor 320 may also communicate with one or more storage devices 340. For example, the one or more storage devices 340 may include nonvolatile storage devices, such as magnetic disks, optical disks, or flash memory devices. The storage devices 340 may include both removable and non-removable memory devices. The storage devices 340 may be configured to store an operating system, images of operating systems, applications, and program data. In a particular embodiment, the memory 330, the storage devices 340, or both, include tangible computer-readable media.
The processor 320 may also communicate with one or more input/output interfaces 350 that enable the computing device 310 to communicate with one or more input/output devices 370 to facilitate user interaction. The input/output interfaces 350 may include serial interfaces (e.g., universal serial bus (USB) interfaces or Institute of Electrical and Electronics Engineers (IEEE) 1394 interfaces), parallel interfaces, display adapters, audio adapters, and other interfaces. The input/output devices 370 may include keyboards, pointing devices, displays, speakers, microphones, touch screens, and other devices. The processor 320 may detect interaction events based on user input received via the input/output interfaces 350. Additionally, the processor 320 may send a display to a display device via the input/output interfaces 350.
The processor 320 may communicate with devices or controllers 380 via the one or more communications interfaces 360. The one or more communications interfaces 360 may include wired Ethernet interfaces, IEEE 802 wireless interfaces, other wireless communication interfaces, or other network interfaces. The devices or controllers 380 may include host computers, servers, workstations, and other computing devices.
While the forms of apparatus and methods herein described constitute preferred aspects of this disclosure, it is to be understood that the disclosure is not limited to these precise forms of apparatus and methods, and the changes may be made therein without departing from the scope of the disclosure, as defined by the appended claims.

Claims

A flight routing system (10) for determining an alternative route (32) for an aircraft (20) based on an airspace (42) that is partitioned into a plurality of sectors (40) and a original flight route (30), wherein the original flight route (30) has an initial point of takeoff (52) and a destination point (54) and wherein the sectors (40) have a closed shape and are based upon standard real world geometries which reflect flow and density of aircraft traffic throughout the airspace (42), the flight routing system (10) comprising:
a processor (320) which receives as input airspace sector geometries (92) and control parameters (94), the airspace sector geometries (92) containing a description specifying the specific shape of all of the sectors (40) within the airspace (42) and the control parameters (94) including a maximum connecting angle, a minimum number of points located on each edge of the sectors (40), and a maximum distance measured between points (60) on each edge (62) of the sectors (40); and

a memory (330) storing instructions executable by the processor (320) to perform operations comprising:
determining, based on the received airspace sector geometries (92) and the control parameters (94), a plurality of points (60) for each of the plurality of sectors (40), wherein the plurality of points (60) are each located along the edges of each of the sectors (40), wherein a single one of the points is located along each edge (62) of each sector (40) for which edge the minimum number of points is one, which single one of the points is a midpoint (M) of the respective edge;

determining a set of connecting arcs (100) for each of the plurality of sectors (40), wherein each connecting arc (100) connects one of the points (60A) with another one of the points (60) located along another edge (62) of the respective sector (40), wherein a connecting angle of each of the connecting arcs is smaller than or equal to the maximum connecting angle, which respective connecting angle is measured between a line perpendicular to the edge of the one of the points (60A) and the respective connecting arc, and wherein none of the connecting arcs (100) must fall outside of the edges (62) of the respective sector (40);

creating a fully integrated airspace network (140) by combining specific location of each of the points (60) of each of the sectors (40), the sets of connecting arcs (100) for each of the sectors (40), intersections (120) representing where edges of the plurality of sectors and the original flight route intersect, individual arcs (122) partitioning the original flight route based on the intersections (120), a set of jump on arcs (130), and a set of jump off arcs (132);

determining a complete time-based airspace network (150) based on at least a forecast capacity (142) and the fully integrated airspace network (140) by making all arcs (100, 122, 130, 132) located within an unavailable sector (40') from the fully integrated airspace network (140) unavailable, wherein the forecast capacity (142) indicates an available capacity for each of the plurality of sectors (40) and which of the plurality of sectors are unavailable; and

selecting the alternative route (132) as output based on at least the complete time-based airspace network (150) by determining a shortest potential route between the initial point of takeoff (52) and the destination (54) based on all of the arcs (100, 122, 130, 132) within the complete time-based airspace network (150);

wherein the processor determines the alternative route without any of the connecting arcs located within an unavailable sector, and wherein the unavailable sector is representative of unavailable airspace.
The flight routing system of claim 1, wherein the processor performs an operation to determine a plurality of the intersections.
The flight routing system of claim 1 or 2, wherein the processor performs an operation to partition the original flight route into a series of the individual arcs based on the plurality of the intersections.
The flight routing system of any of claims 1 to 3, wherein the processor performs an operation to determine the jump on arcs based on either the destination point or one of the plurality of the intersections, wherein the each of the jumping on arcs connects one of the plurality of points to either one of the plurality of the intersections or the destination point.
The flight routing system of any of claims 1 to 4, wherein the processor performs an operation to determine the jump off arcs based on either the one of the plurality of intersections or the initial point of takeoff, wherein each of the one jump off arcs connects one of the plurality of points to either one of the plurality of the intersections or the initial point of takeoff.
The flight routing system of any of claims 1 to 5, wherein the available capacity is based on a number of aircraft that are simultaneously located within in a single sector.
The flight routing system of any of claims 1 to 6, wherein the forecast capacity (142) is based on at least one of convective weather conditions, air traffic congestion, and restricted airspace.
The flight routing system of any of claims 1 to 7, wherein the plurality of sectors each include a unique shape that is a reflection of the flow and density of air traffic within the airspace.
A computer-implemented method of determining an alternative route (32) for an aircraft (20) based on an airspace (42) that is partitioned into a plurality of sectors (40) and a waypoint-based original flight route (30) having an initial point of takeoff (52) and a destination point (54), wherein the sectors (40) have a closed shape and are based upon standard real world geometries which reflect flow and density of aircraft traffic throughout the airspace (42), the method comprising:
determining, based on airspace sector geometries (92) and control parameters (94), a plurality of points (60) for each of the plurality of sectors (40) by a processor (320) which receives as input the airspace sector geometries (92) and the control parameters (94), the airspace sector geometries (92) containing a description specifying the specific shape of all of the sectors (40) within the airspace (42) and the control parameters (94) including a maximum connecting angle, a minimum number of points located on each edge of the sectors (40), and a maximum distance measured between points (60) on each edge (62) of the sectors (40), wherein the plurality of points (60) are each located along the edges (62) of each of the sectors (40), wherein a single one of the points is located along each edge (62) of each sector (40) for which edge the minimum number of points is one, which single one of the points is a midpoint (M) of the respective edge;

determining a set of connecting arcs for each of the plurality of sectors by the processor, wherein each connecting arc connects one of the points (60) with another one of the points located along another edge of the respective sector, wherein a connecting angle of each of the connecting arcs is smaller than or equal to the maximum connecting angle, which respective connecting angle is measured between a line perpendicular to the edge of the one of the points (60A) and the respective connecting arc, and wherein none of the connecting arcs (100) must fall outside of the edges (62) of the respective sector (40);

creating a fully integrated airspace network (140) by combining specific location of each of the points (60) of each of the sectors (40), the sets of connecting arcs (100) for each of the sectors (40), intersections (120) representing where edges of the plurality of sectors and the original flight route intersect, individual arcs (122) partitioning the original flight route based on the intersections (120), a set of jump on arcs (130), and a set of jump off arcs (132);

determining a complete time-based airspace network (150) based on at least a forecast capacity (142) and the fully integrated airspace network (140) by making all arcs (100, 122, 130, 132) located within an unavailable sector (40') from the fully integrated airspace network (140) unavailable, wherein the forecast capacity (142) 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 by determining a shortest potential route between the initial point of takeoff (52) and the destination (54) based on all of the arcs (100, 122, 130, 132) within the complete time-based airspace network (150);

wherein the processor determines the alternative route without any of the connecting arcs located within an unavailable sector, and wherein the unavailable sector is representative of unavailable airspace.
The method of claim 9, wherein the processor determines the intersections.
The method of claim 9 or 10, wherein the processor partitions the original flight route into a series of 15 the individual arcs based on the intersections.
The method of any of claims 9 to 11 , wherein the processor determines at the 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 one of the plurality of points to either one of the plurality of intersections or the destination point.