Aircraft Route Calculation Using Diffusion Grids and Flight Constraints
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current navigation systems for aircraft struggle to generate optimal routes in real-time that account for flight performance, area avoidance, and approach constraints, leading to extended mission preparation times and excessive pilot workload, especially in dynamic environments like unstable weather.
Innovation Solution
A method using a grid-based approach with absorption coefficients and iterative diffusion of interest to determine the shortest route from an aircraft to a target point, respecting flight capabilities and constraints, and automatically updating the route in real-time.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a pilot manually defines and updates the entire route taking into account flight performance, area avoidance, and approach constraints, then the route can be optimized for mission requirements, but the mission preparation time is extended and pilot workload increases excessively
Solution Approach 1:
The route calculation problem is segmented into multiple independent components: flight performance constraints, area avoidance zones, and approach constraints. Each component is processed separately through iterative diffusion steps, allowing parallel computation and reducing overall preparation time while maintaining comprehensive optimization
Solution Approach 2:
The system implements automatic route generation and real-time updating without requiring manual pilot intervention. The algorithm autonomously processes mission parameters, calculates optimal routes, and adapts to dynamic changes in the operational environment, significantly reducing pilot workload and preparation time
2Object-affected harmful factors
If known algorithms like D* are used to determine constrained routes, then area avoidance can be achieved, but flight performance constraints and FMS acceptance cannot be guaranteed
Solution Approach 1:
The patent merges multiple constraint types into a unified route calculation framework. Flight performance constraints (minimum radius of curvature, maximum speed), area avoidance zones, and approach constraints are integrated through a single diffusion-based algorithm that simultaneously satisfies all requirements, ensuring FMS acceptance
Solution Approach 2:
The system dynamically adjusts calculation parameters including grid resolution, diffusion coefficients, and constraint weights based on the specific mission context. This allows the algorithm to adapt to different aircraft types, environmental conditions, and operational requirements, improving both area avoidance reliability and FMS compatibility
3Adaptability or versatility
If the pilot must adapt the route in real-time during the mission, then the route can respond to changing conditions, but the pilot workload becomes excessive and mission conduct is harmed
Solution Approach 1:
The system provides autonomous real-time route adaptation by continuously monitoring mission parameters and automatically recalculating optimal paths. The algorithm detects changes in operational conditions and updates the route without pilot intervention, maintaining adaptability while eliminating the excessive workload associated with manual real-time route management
Solution Approach 2:
The system implements continuous feedback loops that monitor flight progress, environmental conditions, and constraint changes. This feedback drives automatic route recalculation and adjustment, enabling responsive adaptability while keeping the pilot informed rather than requiring constant manual intervention
4Speed
If a route calculation algorithm is used that does not account for aircraft flight performance, then calculation speed may be improved, but the generated route will have a high chance of not being accepted by the FMS
Solution Approach 1:
The patent applies different levels of computational detail to different parts of the route calculation. Flight performance constraints are applied locally at each grid cell through diffusion coefficients, while global constraints like area avoidance are handled through boundary conditions. This localized approach maintains calculation speed while ensuring FMS acceptance through comprehensive constraint satisfaction
Data Source
Figure 1
Figure 2
Figure 3
AI summary
The invention relates to route calculation for an aircraft. The invention is based on the definition of grids representing the environment between at least one aircraft and at least one target point. The grid cells define absorption levels associated with the aircraft's ability to pass through a cell, allowing, in particular, the definition of strictly inaccessible zones and zones that allow a tolerance for penetration. A level of interest is broadcast from at least one target point to the aircraft's position. When the level of interest reaches the aircraft, route segments are iteratively constructed between the aircraft and the target point, passing through the cells with the highest level of interest. The route is then simplified before being sent to a flight management system to be converted into the trajectory followed by the aircraft.