Aircraft Mission Path Planning With Constrained Route Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing flight planning systems are inadequate for business aviation, often requiring multiple iterations to adjust mission hypotheses and failing to optimize flight time and fuel consumption due to insufficient consideration of client-specific criteria, weather, and airplane context.
Innovation Solution
A system that calculates an optimal mission path by defining an optimization region around an unconstrained path, using modules to account for weather and network-constrained paths, and employs algorithms like Dijkstra and A* to minimize cumulative cost, considering airplane performance and operational specifications.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Manufacturing precision
If existing flight planning systems use a single constrained path calculation based on predefined waypoints and airways, then the path adheres to established navigation routes, but the system requires multiple iterations to adjust mission hypotheses and cannot optimize flight time and fuel consumption
Solution Approach 1:
The patent segments the path calculation into two distinct modules: a first module that performs an unconstrained optimal path calculation to establish a reference trajectory, and a second module that performs a constrained calculation within an optimization region around this reference. This segmentation allows the system to first determine the theoretical optimum without iterations, then refine it with navigation constraints in a single pass, thereby resolving the contradiction between precision and time consumption.
Solution Approach 2:
The first path calculating module performs a preliminary unconstrained optimization to generate an optimal reference path before the constrained calculation begins. This preliminary action establishes the best possible trajectory as a foundation, allowing the second module to work within a focused optimization region rather than searching the entire mission space, thus achieving high precision without requiring multiple iterative adjustments.
2Use of energy by moving object
If the system calculates an unconstrained optimal path, then fuel consumption and flight time are minimized, but the path may not adhere to required airways and waypoints
Solution Approach 1:
The patent applies local quality by creating an optimization region with specific properties around the unconstrained optimal path. Within this localized region, the second path calculating module applies navigation constraints (airways, waypoints) only where necessary, while maintaining the overall optimal trajectory characteristics. This allows the system to preserve fuel efficiency while adapting to local navigation requirements.
Solution Approach 2:
The optimization region acts as an intermediary between the unconstrained optimal path and the constrained navigation requirements. The second path calculating module uses this intermediate zone to reconcile the conflict between fuel efficiency and navigation constraints, finding a balanced solution that respects both objectives without requiring the path to strictly follow predefined airways.
3Adaptability or versatility
If the system performs multiple iterations to adjust mission hypotheses, then the path adapts to client criteria and constraints, but the planning process becomes time-consuming
Solution Approach 1:
The patent implements dynamics by making the optimization region adaptive rather than fixed. The region's boundaries and characteristics can adjust based on the unconstrained optimal path and mission parameters, allowing the system to efficiently handle different client criteria and constraints without requiring multiple iterative recalculations. This dynamic approach maintains productivity while achieving adaptability.
4Reliability
If the system uses a dense network of waypoints and imposed paths, then the path adheres to navigation requirements, but the optimization freedom is reduced and fuel efficiency decreases
Solution Approach 1:
The patent applies partial action by implementing navigation constraints selectively within the optimization region rather than enforcing them throughout the entire mission space. The second path calculating module applies airways and waypoints only where necessary to ensure navigation compliance, while leaving other portions of the path free to follow the optimal unconstrained trajectory, thus maintaining fuel efficiency while achieving required navigation standards.
Data Source
AI summary
A system for calculating a mission of an aircraft by combination of algorithms includes a first path calculation module, configured for calculating an optimal mission path between a geographical point of origin and a geographical destination point as a function of airplane performance, operational mission specifications and a weather context. The first calculation module is configured to determine the optimal path in a manner non constrained by a network of waypoints and/or imposed paths between the waypoints. The system includes a definition module, around the optimal path, an optimization region of the path and a second path calculating module, configured to calculate an optimized path of the aircraft in the optimization region in a manner constrained by a network of waypoints and/or imposed paths between the waypoints.