Sector-Based Airspace Network for Efficient Aircraft Rerouting
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current flight routing systems, such as waypoint-based and uniform grid-based networks, often result in longer detours and inefficiencies when determining alternative routes for aircraft due to limited re-routing options and inoperable paths that may cause increased workload for air traffic controllers, especially when aircraft fly too closely to sector edges or cut corners.
Innovation Solution
A flight routing system that uses a route planning control module to determine alternative routes based on the geometry of sectors, including edge points and connecting arcs, to create a higher resolution network that avoids sector edges and corners, utilizing a sector-based network formed from National Airspace System (NAS) or similar partitioned airspace, allowing for more efficient rerouting.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If waypoint-based network is used for rerouting, then the routing process is simple, but the number of re-routing options is limited resulting in longer detours
Solution Approach 1:
The airspace is segmented into multiple sectors with defined geometries, and the network is segmented into boundary points and connecting arcs. This segmentation creates a more granular structure that provides more rerouting options compared to traditional waypoint networks, thereby reducing detour length while maintaining manageable complexity through systematic organization.
Solution Approach 2:
The invention transitions from traditional two-dimensional waypoint coordinates to a three-dimensional sector-based network that includes altitude information and sector geometry constraints. This dimensional enhancement allows for more routing options in vertical and lateral dimensions, reducing detour length while keeping the routing process structured and manageable.
2Adaptability or versatility
If uniform grid network is used for rerouting, then more routing options are available, but the approach is inefficient and may create inoperable paths
Solution Approach 1:
The network structure is adapted to local sector geometries rather than applying a uniform grid across all airspace. Each sector's boundary points and connecting arcs are defined according to its specific geometry, providing routing options that are locally optimized and operationally efficient while avoiding inoperable paths near sector edges.
Solution Approach 2:
The network dynamically adapts to sector geometry changes and air traffic conditions. The connecting arcs are defined based on sector boundaries and can be adjusted according to operational requirements, allowing the system to maintain efficiency while providing versatile routing options across different airspace configurations.
3Device complexity
If route aligns with uniform grid, then grid-based routing is simple, but aircraft may fly too closely to sector edges or cut corners increasing controller workload
Solution Approach 1:
The sector boundary points and connecting arcs serve as intermediaries between the aircraft and the sector geometry. Rather than allowing direct grid-based routing that may cut corners, the network uses these intermediary elements to guide aircraft along paths that maintain safe distances from sector edges, reducing controller workload while keeping the routing structure systematic and manageable.
Data Source
Figure 1~2
Figure 3
Figure 4
AI summary
A flight routing system (10) for determining an alternative route for an aircraft (20) based on an airspace (42) partitioned into a plurality of sectors (40), and an original flight route (30) having an initial point of takeoff (32) and a destination point is disclosed (54). The flight routing system (10) includes a processor (320) and a memory (330) 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 (62) of one of the plurality of sectors (40). The processor (320) 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 (320) further performs operations for determining a complete time-based airspace (150) network based on at least a forecast capacity.