Computation-time-optimized route planning for aircraft
First Claim
1. A process for determining a cost-minimized flight route for an aircraft between a starting point and an end point, taking into account costs associated with the flight route and limitations of the flight route caused by the aircraft, the process comprising:
- determining, by a processor, a raster set which comprises topographical raster points between the starting point and the end point;
determining, by the processor, costs associated with respective raster points of the raster set;
determining, by the processor, N nodes for each raster point of at least one subset of the raster set;
whereini) the N nodes are associated with approach directions of the aircraft to the raster point;
ii) possible take-off directions of the raster point are determined as a function of the approach directions; and
iii) said possible take-off directions are defined taking into account a turning radius of the aircraft; and
determining, by the processor, the cost-minimized flight route between the starting point and the end point by means of a shortest path algorithm;
whereinx) for a particular raster point, only k most cost-effective nodes are taken into account; and
y) k≧
3 and k is less than N.
2 Assignments
0 Petitions
Accused Products
Abstract
A process and system for the planning a cost-minimized aircraft flight route between a starting point and end point takes into account costs associated with the flight route, no-fly zones and flight corridors, and aircraft limitations. A raster set is determined which comprises topographical points between the starting and end points, and costs associated with the respective raster points are determined. N nodes are determined for each raster point of at least one subset of the raster set, such nodes being associated with approach directions of the raster point by the aircraft. Possible take-off directions of the raster point are defined, taking into account the minimum turning radius of the aircraft, as a function of the approach direction. A cost-minimized flight route is determined by means of a shortest path algorithm, taking into account only the k most cost-effective nodes (k<N) for a raster point.
-
Citations
19 Claims
-
1. A process for determining a cost-minimized flight route for an aircraft between a starting point and an end point, taking into account costs associated with the flight route and limitations of the flight route caused by the aircraft, the process comprising:
-
determining, by a processor, a raster set which comprises topographical raster points between the starting point and the end point; determining, by the processor, costs associated with respective raster points of the raster set; determining, by the processor, N nodes for each raster point of at least one subset of the raster set;
whereini) the N nodes are associated with approach directions of the aircraft to the raster point; ii) possible take-off directions of the raster point are determined as a function of the approach directions; and iii) said possible take-off directions are defined taking into account a turning radius of the aircraft; and determining, by the processor, the cost-minimized flight route between the starting point and the end point by means of a shortest path algorithm;
whereinx) for a particular raster point, only k most cost-effective nodes are taken into account; and y) k≧
3 and k is less than N. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17)
-
-
18. A system for determining a cost-minimized flight route for an aircraft between a starting point and an end point, taking into account costs associated with the flight route and limitations of the flight route caused by the aircraft, the system comprising:
-
computation means for determining a raster set which comprises topographical raster points between the starting point and the end point; computation means for determining costs associated with respective raster points of the raster set; computation means for determining N nodes to each raster point of at least one subset of the raster set;
whereini) the N nodes are associated with approach directions of the aircraft to the raster point; ii) possible take-off directions of the raster point are determined as a function of the approach directions; and iii) said possible take-off directions are defined, taking into account a turning radius of the aircraft; and computation means for determining the cost-minimized flight route between the starting point and the end point by means of a shortest path algorithm;
whereinx) for a particular raster point, only k most cost-effective nodes are taken into account; and y) k≧
3 and k is less than N. - View Dependent Claims (19)
-
Specification