Methods, apparatus, and computer programs for optimizing aircraft arrival flows.

By using the minimum time interval between aircraft as a soft constraint, and combining waiting procedures and speed adjustments, the optimization model achieves more flexible aircraft flow optimization, solving the problems of increased fuel consumption and flight time in existing technologies, and improving airspace utilization efficiency.

CN115047901BActive Publication Date: 2026-11-17FREQUENTIS ORTHOGON GMBH
View PDF 6 Cites 0 Cited by

Patent Information

Application Number
CN202210182658.3
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Priority Date
2021-02-25
Filing Date
2022-02-25
Publication Date
2026-11-17
Estimated Expiration
2042-02-25

AI Technical Summary

Technical Problem

Existing optimization models treat the minimum time interval between aircraft as a hard constraint, which may lead to suboptimal optimization results and increase fuel consumption and flight time.

Method used

By using the expected minimum time interval as a soft constraint, and combining waiting procedures and aircraft speed adjustments, the optimization model considers multiple objectives to achieve more flexible optimization.

Benefits of technology

By employing soft constraints and multi-objective optimization, the efficiency of aircraft flow is improved, fuel consumption and flight time are reduced, and more flexible approach path planning is provided.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN115047901B_ABST
    Figure CN115047901B_ABST
Patent Text Reader

Abstract

This disclosure relates to methods, corresponding apparatus, and computer programs for optimizing aircraft arrival flows. The invention relates to a method for optimizing the flow of at least two aircraft forming at least one aircraft pair, the method comprising: receiving the estimated arrival time of each aircraft at at least one approach waypoint; receiving the target arrival time of each aircraft at a merging waypoint; receiving route information for each aircraft; defining a desired minimum time-based interval for each aircraft pair; and determining the optimized target arrival time of the at least two aircraft at one or more dedicated waypoints using an optimization model. According to the invention, the proposed optimization model utilizes the desired minimum time-based interval as a soft constraint.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to a method for optimizing the flow of at least two aircraft forming at least one aircraft pair, wherein each aircraft enters a predefined environment, particularly airspace, via a separate or common approach pathpoint, and wherein the aircraft approach a common predefined merging pathpoint. The method includes: receiving an estimated arrival time at at least one approach pathpoint; receiving a target time for each aircraft to reach the merging pathpoint, wherein the target time includes a delay to be absorbed before reaching the merging pathpoint; receiving route information for each aircraft, the route information including pathpoints for guiding the aircraft from the approach pathpoint to the merging pathpoint, wherein the pathpoints include at least one dedicated pathpoint; defining a desired minimum time-based interval for each pair of aircraft; and determining, using an optimization model, an optimized target arrival time, particularly a target overflight time, for the at least two aircraft at one or more dedicated pathpoints, such that the delay to be absorbed by each aircraft is shared between route segments defined by the dedicated pathpoints, the optimization model taking into account the estimated arrival time, the target time for each aircraft to reach the merging pathpoint, and the desired minimum time-based interval. Background Technology

[0002] In air traffic control (ATC), the primary objective is to safely guide aircraft through airspace, which involves ensuring proper spacing between aircraft. Ensuring proper spacing is crucial to avoiding any situation that could lead to a near-collision or even a collision. Proper spacing typically involves a certain amount of time or distance between one aircraft and another following it on the same or near route.

[0003] Due to the increasing volume of flight activity over the past few decades, ATC and Air Traffic Management (ATM) are designed to ensure and improve the safety of guiding aircraft through airspace, and to provide an efficient air transport system in terms of airport utilization, fuel consumption and flight time.

[0004] When considering aircraft arrival flows to airports or more generally to merge waypoints, target times can be assigned to aircraft to increase the number of aircraft that can use merge waypoints or runways.

[0005] The above is particularly relevant to aircraft departing their cruising altitude, descending, and ultimately approaching the runway. Since runway capacity is often a major bottleneck for large airports, so-called arrival managers are widely used in existing technologies. These arrival managers calculate the target time for each aircraft to reach the merging point or the runway itself.

[0006] Ensuring timely arrival of aircraft at merging waypoints or runways is a significant challenge for air traffic controllers and air traffic management itself, as aircraft arriving at approach waypoints to the airspace typically do not follow their optimal descent trajectories and arrive at the runway at the required time as calculated by the arrival manager. In other words, air traffic controllers must usually ensure that aircraft arrive at the runway with a certain amount of time delay as calculated by the arrival manager.

[0007] Based on existing techniques, such as those according to US 2015 / 0081198 A1 and EP 1 428 195 B1, known optimization models exist. These models typically calculate the target flyby time or arrival time for specific waypoints along a route that defines the aircraft's path from the approach waypoint to the merging waypoint.

[0008] These optimization models may take into account the expected arrival time at the approach waypoint, the expected minimum time-based interval between a pair of aircraft, and the target time for each aircraft to reach the merge waypoint.

[0009] However, known optimization models typically treat the expected minimum time-based interval between each pair of aircraft as a hard constraint, which can lead to optimization results that may not be optimal relative to other operating parameters. For example, optimization results may involve higher fuel consumption due to acceleration and deceleration, as well as requiring aircraft to fly so-called hold procedures, which typically increase flight time and fuel consumption. Summary of the Invention

[0010] Therefore, the object of this invention is to overcome these shortcomings known in the prior art as much as possible. In particular, the object of this invention is to provide an optimization model that allows for more flexible optimization approaches.

[0011] The European Patent Office further searched the prior art in the priority applications related to this application, including US2013 / 110388 A1, CN 106781708 B and WO 2017 / 013387 A1.

[0012] According to the present invention, an optimization model is proposed that utilizes the expected minimum time-based interval as a soft constraint. The invention is based on the finding that using the expected minimum time-based interval as a soft constraint allows for the determination of the target arrival time at one or more dedicated waypoints, taking into account additional optimization criteria, thus allowing for more comprehensive optimization of aircraft flow.

[0013] An approach waypoint can be a generic waypoint that represents a certain airspace or route segment. A merge waypoint can be a waypoint along the route where two routes merge, or it can be an airport runway.

[0014] Furthermore, this invention is described herein with respect to the operation of aircraft flow within airspace. However, this optimization method can also be used to optimize aircraft flow performing ground taxiing operations. In this case, waypoints can be, for example, other fixed coordinates on taxiway intersections or taxiways, aprons, or runways.

[0015] In a preferred embodiment, the merging waypoint is the destination airport. In this case, the target time for each aircraft to arrive at the merging waypoint is the target time for each aircraft to arrive at the runway. This time is typically calculated by the arrival manager and is considered as input to the optimization model.

[0016] According to another preferred embodiment, as a first optimization objective, considering the desired minimum time-based interval, the optimization model considers maximizing the time-based interval between each pair of aircraft at one or more dedicated waypoints. This ensures that appropriate intervals are considered in the optimization model. In other words, generally, a larger interval between each pair of aircraft yields better optimization results than a smaller interval.

[0017] According to another preferred embodiment, the time-based interval is maximized only up to a predefined desired interval. This means that better optimization results are produced when the interval is increased within a range less than or equal to the desired interval. However, maximizing the interval to a value higher than the predefined desired interval does not further improve the optimization results. In the example, the desired minimum time-based interval is two minutes. Optimization produces better results when the interval is increased from 1 minute 30 seconds to 2 minutes, but optimization does not improve further when the interval is increased, for example, from 2 minutes to 4 minutes.

[0018] According to another preferred embodiment, the optimization model also considers one or more waiting procedure durations for one or more aircraft, wherein the waiting procedure duration is used to delay the aircraft, and wherein, as a second optimization objective, the model considers minimizing the waiting procedure duration.

[0019] Holding procedures can be additionally used to delay aircraft. For example, if an approaching aircraft must absorb high latency before reaching a merging waypoint, adjusting the aircraft's speed alone may not be feasible due to flight mechanical constraints. In such cases, a so-called holding procedure can be suggested for the aircraft. During these holding procedures, the aircraft typically hovers near a specific holding location and is thus delayed to eventually arrive at the merging waypoint at the required target time.

[0020] However, due to the additional flight time, fuel combustion, and noise emissions involved, the duration of this waiting procedure should be kept to an absolute minimum. Therefore, the duration of the waiting procedure for one or more aircraft is considered as a secondary optimization objective within the optimization model.

[0021] According to another preferred embodiment, the method further includes receiving preferred fly-over times for at least one dedicated waypoint, and wherein, as a third optimization objective, the optimization model also minimizes the difference between the preferred fly-over time of the at least one dedicated waypoint and the target arrival time. Such preferred fly-over times are typically defined by an air navigation service provider or traffic management system and are another possible input to the optimization model. The aim is to minimize the difference between the preferred fly-over time and the target arrival time for each dedicated waypoint. This forms the third optimization objective.

[0022] According to another preferred embodiment, the optimization model further includes a cost function, wherein the cost function is configured to balance some or all of the optimization objectives relative to each other, particularly by utilizing weighting factors associated with the optimization objectives to balance some or all of the optimization objectives relative to each other.

[0023] With the help of this cost function and weighting factors, the model allows for the consideration of multiple optimization objectives and their priorities. For example, ensuring appropriate intervals can be considered an important optimization objective with a high weighting factor. However, in another case, it may be necessary to minimize the time required for aircraft to operate in holding procedures. In this case, for example, it may be acceptable for flights to not achieve the desired interval for each approach, and, for example, to provide vertical spacing between aircraft instead. In other words, the cost function and associated weighting factors allow for flexible prioritization of optimization objectives according to the needs of a specific application.

[0024] According to another preferred embodiment, the optimization model also considers the maximum and minimum flight durations between dedicated waypoints and / or adjusted maximum and minimum flight durations as further constraints. These maximum and minimum flight durations may be limited by operational and flight mechanical constraints.

[0025] According to another preferred embodiment, the maximum and minimum flight durations are determined using the aircraft's maximum acceleration trajectory and / or minimum smooth trajectory, specifically using the aircraft's maximum acceleration trajectory and / or minimum smooth trajectory received from the Aircraft Database (BADA). In other words, the maximum flight time on the direct route between two waypoints is limited by the aircraft's aerodynamics and flight mechanics. Assuming the aircraft arrives at a specific waypoint at a specific airspeed, the shortest possible arrival time to the next waypoint is given using the maximum acceleration. On the other hand, considering the aircraft's smooth configuration, the aircraft can only decelerate to a minimum speed. A smooth configuration is a configuration in which the aircraft does not use any high-lift devices (e.g., flaps or slats).

[0026] According to another preferred embodiment, the adjusted maximum flight duration is calculated using a determined maximum flight duration and an additional configurable time loss, and / or the adjusted minimum flight duration is calculated using a determined minimum flight duration and an additional configurable time gain. The time loss and time gain can be achieved, for example, by requesting the aircraft to fly a shortcut—also known as a “direct route”—which results in a shorter flight path. This is an example of a time to gain.

[0027] To provide additional lost time, air traffic controllers can utilize so-called guidance procedures. These procedures, which can be used in specific airspaces, can delay an aircraft by increasing the distance between two dedicated waypoints, for example, by requiring the aircraft to fly a non-direct trajectory between waypoints to make a turn. This is an example of a time to lose.

[0028] According to another preferred embodiment, the target arrival time at one or more dedicated waypoints is recalculated. This recalculation occurs whenever the target arrival time of the aircraft at a merging waypoint changes. In the example where the merging waypoint is a destination airport runway, recalculation may be necessary in cases such as runway congestion, longer-than-expected landing times at the runway, or other traffic delays.

[0029] According to another preferred embodiment, the target arrival times of one or more aircraft at one or more dedicated waypoints are excluded from recalculation. Specifically, when a dedicated waypoint has already overflowed, the target arrival times associated with that waypoint are excluded from recalculation. In other words, this means that target fly-through times are recalculated only for those dedicated waypoints that will overflow in the future. For example, if an aircraft has already passed two of five dedicated waypoints, then those target fly-through times will only be recalculated for the remaining three dedicated waypoints that will overflow.

[0030] According to another preferred embodiment, the optimization model considers a reduction in aircraft speed from the approach waypoint to the merging waypoint as a further constraint. This further constraint ensures that the aircraft is not required, for example, to decelerate at the approach waypoint and then accelerate again. Achieving this constraint is not only for the comfort of the pilot and passengers, but also because it reduces fuel consumption and improves predictability for air traffic controllers and pilots.

[0031] The invention has been described above with reference to the method in the first aspect. However, in the second aspect, the invention relates to an apparatus for optimizing the flow of at least two aircraft forming at least one pair of aircraft, wherein each aircraft enters a predefined environment, particularly airspace, via an approach pathpoint, and wherein the aircraft approach a common predefined merging pathpoint, the apparatus comprising a processing unit, particularly a microprocessor.

[0032] In a second aspect, the present invention achieves the initially mentioned objective by proposing to implement the method according to the above embodiments on a processing unit.

[0033] The advantages and preferred embodiments of the method in the first aspect are also the advantages and preferred embodiments of the device in the second aspect. To avoid unnecessary repetition, please refer to the description above.

[0034] In another aspect, the present invention also relates to a computer program prepared to perform the method according to the foregoing embodiments when executed on a computer.

[0035] Similarly, regarding this aspect, the preferred embodiments and advantages of the method in the first aspect are also the preferred embodiments and advantages of the computer program according to the present invention. For the purpose of avoiding unnecessary repetition, reference is made to the description above. Attached Figure Description

[0036] To gain a more complete understanding of the invention, it will now be described in more detail with reference to the accompanying drawings. Detailed descriptions will illustrate and describe, or are considered preferred embodiments of the invention. It should be understood that various modifications and changes to form or detail can be readily made without departing from the scope of the invention. Therefore, the invention is not intended to be limited to the exact forms and details shown and described herein, nor to anything less than the entirety of the invention disclosed herein and in the following disclaimers. Furthermore, features described in the specification, drawings, and claims that disclose the invention may be necessary to consider individually or in combination for the purposes of the invention. In particular, any reference numerals in the claims should not be construed as limiting the scope of the invention. The word "comprising" does not exclude other elements or steps. The words "a" or "an" do not exclude a plurality.

[0037] The invention will now be described with reference to the accompanying drawings, which illustrate, by way of example and not limitation, one of several possible embodiments set forth herein, and in the drawings:

[0038] Figure 1 A block diagram of an optimization method according to the present invention is shown;

[0039] Figure 2 A block diagram of an optimization model based on the concept of the present invention is shown;

[0040] Figure 3 A schematic diagram of a predefined environment or airspace is shown;

[0041] Figure 4 , Figure 5 Examples of approach trajectories for one or two aircraft are shown;

[0042] Figure 6 A device based on the concept of the present invention is shown;

[0043] Figure 7 A computer program according to the concept of the present invention is shown; and

[0044] Figure 8 An alternative implementation of the airspace concept according to the present invention is shown. Detailed Implementation

[0045] Figures 1 to 3 A method 100 for optimizing the flow of at least two aircraft 200a and 200b is shown. In this respect, Figure 1 A block diagram of the method 100 itself is shown. Figure 2 A block diagram of the optimization model 214 according to the present invention is shown, and Figure 3 The corresponding simplified spatial structure 204 is shown.

[0046] according to Figure 3 The flow of at least two aircraft 200a and 200b forms at least one aircraft pair 202. Figure 3 The diagram illustrates the flow of two aircraft 200a and 200b; however, the flow could include a larger number of aircraft 200 forming different pairs 202. Each aircraft 200a and 200b enters a predefined environment or airspace 204 via an approach pathpoint 206. From this approach pathpoint 206, aircraft 200a and 200b approach a common predefined merging pathpoint 208. Between the approach pathpoint 206 and the merging pathpoint 208, intermediate waypoints 210 are arranged. These intermediate waypoints 210 include dedicated waypoints 210. Aircraft 200a and 200b travel from the approach pathpoint 206 to the merging pathpoint 208 via the intermediate waypoints 210. Another arrival flow 232 can lead to the merging pathpoint 208. The merging pathpoint 208 could also be the destination airport 212, specifically the entrance to the runway on which aircraft 200a and 200b are intended to land.

[0047] Now turn to Figure 1The optimization method 100 described herein includes the following steps: receiving 102 the estimated arrival time ETO of each aircraft 200a, 200b at at least one approach waypoint 206; and receiving, according to step 104, the target time for each aircraft 200a, 200b to reach a merging waypoint 208, the target time being the required time (RTO) to pass the merging waypoint, wherein the target time RTO includes a delay D to be absorbed before reaching such a merging waypoint 208.

[0048] Furthermore, according to step 106, route information for each aircraft 200a and 200b is received. This route information includes waypoint 210 for guiding the aircraft 200a and 200b from the approach waypoint 206 to the merging waypoint 208, such as... Figure 3 As shown. Furthermore, according to step 108, a minimum desired time-based interval is defined for each pair of aircraft 202. .

[0049] Based on step 110, the optimal target arrival time T of at least two aircraft 200a and 200b at one or more dedicated waypoints 210 is determined using optimization model 214. k Specifically for the target flight time T k The optimization model 214 considers the estimated arrival time (ETO), the target time (RTO) for each aircraft to reach the merged waypoint, and the desired minimum time-based interval. Determine the arrival time T of the optimization objective. k This ensures that the delay D to be absorbed by each aircraft 200a, 200b is shared between the route segments defined by the dedicated waypoint 210. (See later...) Figure 4 and Figure 5 This illustrates the delay sharing. Optimization model 214 utilizes the expected minimum time-based interval. As a soft constraint, such as Figure 2 As shown.

[0050] exist Figure 2 The optimization model 214 is described in detail. The optimization model includes a cost function 222. The cost function 222 is configured to balance optimization objectives 216, 218, and 220 relative to each other. To balance these optimization objectives 216, 218, and 220, weighting factors c1, c2, and c3 are associated with the optimization objectives 216, 218, and 220. Based on the first optimization objective 216, the desired minimum time-based interval is considered. The optimization model 214 considers the time-based interval s between each pair of aircraft 202 at one or more dedicated waypoints 210. k Maximize. As already explained, the time-based interval sk It is used as a soft constraint.

[0051] Based on time intervals s k Maximize only the predefined expected interval In other words, this means that whenever the desired interval is reached in the optimized solution... This solution will not yield a minimum interval higher than the expected one. Any better interval. As a second optimization objective 218, optimization model 214 also considers one or more waiting procedure durations h for one or more aircraft 200a, 200b. These waiting procedure durations h and the waiting procedures themselves are used to delay said aircraft 200a, 200b, for example, with the aid of a so-called waiting mode. In the waiting mode, aircraft 200a, 200b typically hover around a specific waypoint using standard procedures. Optimization model 214 considers minimizing the waiting procedure duration h as the second optimization objective 218.

[0052] Optionally, method 100 further includes receiving the preferred fly-over time (ETO) of at least one dedicated waypoint 210. k These preferred fly-through times (ETOs) k It can be generated from an external source. As a potential third optimization objective 220, consider optimizing the fly-through time (ETO) at a specific dedicated waypoint 210. k With the target arrival time T k Minimize the differences between them.

[0053] The optimization model 214 may also consider the maximum and minimum flight durations and / or adjusted maximum and minimum flight durations between dedicated waypoints 210 as further constraints 224. These maximum and minimum flight durations are determined using the maximum acceleration trajectories and / or minimum smooth trajectories of aircraft 200a and 200b, specifically the maximum acceleration trajectories and / or minimum smooth trajectories received from the aircraft database (BADA). The adjusted maximum flight duration can be calculated using the determined maximum flight durations and an additional configurable loss time, and / or the adjusted minimum flight duration can be calculated using the determined minimum flight durations and an additional configurable acquisition time.

[0054] In addition, the target arrival time T at one or more dedicated waypoints 210 can be recalculated. k Specifically, the target arrival times of one or more aircraft 200a, 200b at one or more dedicated waypoints 210 are excluded from recalculation. When the target arrival time T associated with a dedicated waypoint 210...k This can be particularly beneficial when overflow has already occurred. Furthermore, optimization model 214 can consider reducing the aircraft speed from the approach path point to the merging path point as a further constraint 224.

[0055] Figure 4 The image shows a vertical approach profile of the aircraft 200a approaching approach path point 206 and then approaching merge path point 208 via dedicated intermediate path point 210. Figure 4 The basic concept of the flow optimization algorithm is also explained. Optimization model 100 calculates or determines the target fly-through time T at the dedicated path point 210. k When aircraft 200a enters approach pathpoint 206 at the expected approach time ETO, optimization method 100 will calculate the optimized target flyby time T at dedicated waypoint 210. k .

[0056] exist Figure 4 In the scenario shown, both the estimated arrival time (ETO) at approach waypoint 206 and the target time to reach the merged waypoint 208 (destination airport 212 in this example) are provided to the optimization method 100. Due to the additional delay D to be absorbed, the aircraft 200a arriving at approach waypoint 206 at the estimated arrival time (ETO) cannot utilize the preferred overflight time (ETO) at the dedicated waypoint 210. k ( Figure 4 ETO in 1-3 The aircraft 200a will approach destination airport 212 with its preferred profile defined by the target approach. If the aircraft 200a does so, it will result in arriving at destination airport 212 well before the target time RTO (Return Time To Objective) at the merge waypoint 208, in which case the target time RTO is equal to the target landing time (TLDT). In contrast, the aircraft will arrive at the expected time ETO (Early To Objective) at the target landing time. N The path to the merge path point 208 is undesirable.

[0057] In other words, aircraft 200a must turn from its preferred profile to absorb the delay D between approach waypoint 206 and the merging waypoint or destination waypoint / airport 208, 212. This delay D to be absorbed is now “shared” between different intermediate segments (d1, d2, d3, d4) between dedicated waypoints 210. The maximum and minimum speeds shown are examples of constraints 224 to be considered. (As from...) Figure 4 It is possible not only to use the speed change of the aircraft 200a to delay the aircraft 200a, but also to use the duration h of the additional waiting procedure to delay the aircraft 200a.

[0058] Figure 5The same scenario for aircraft 200a is shown, but the previously flown aircraft 200b is also considered. As already explained, the optimization is based on the time interval s. k In the example shown, the optimized time-based interval s k Equal to the minimum time-based interval of expectation Furthermore, an additional "natural gap" m exists between the aircraft 200a and the aircraft 200b. k .

[0059] Optimization model 100 calculates or determines the target fly-through time at dedicated waypoint 210. , where the variable f represents the aircraft. For aircraft 200a shown on the right side of the figure, the symbol is used. For the preceding aircraft 200b, use The superscript f is used in this document to generally distinguish aircraft. However, for readability, superscripts are not used consecutively in the description and figures.

[0060] Figure 6 An apparatus 227 is shown for optimizing the flow of at least two aircraft 200a, 200b forming at least one aircraft pair 202. The apparatus 227 includes a processing unit 228, which may be a microprocessor 228. The method 100 as described herein is implemented on the processing unit 228.

[0061] Figure 7 Computer program 230 is shown. Computer program 230 is prepared to perform method 100 according to the embodiments described herein.

[0062] Figure 8 An alternative implementation of airspace 204 is shown. Airspace 204 includes... Figure 3 All elements shown, but including path points 206, 208, and 210 with more complex structures.

[0063] Specifically, aircraft 200 can enter airspace 204 via multiple approach waypoints 206. Waypoint 210 guides the aircraft from approach waypoints 206 to a merging waypoint 208. This merging waypoint 208 is a common waypoint for all different arrival routes. Similarly, merging waypoint 208 can be a destination airport 212, or a route to destination airport 212, such as... Figure 8 As shown. Optionally, additional arrival flows 232 can lead to destination airport 212. In this case, for optimization method 100, the destination airport will be considered as a merged waypoint 208 for optimization. Optionally, airspace 204 may also include additional arrival flows (not shown). Optimization method 100 is also able to provide optimized fly-through times T for such scenarios. k .

[0064] In the following text, mathematical formulas will be used to describe and explain optimization method 100. Some explanations are provided below. Figure 4 The formulas also include descriptions of the conditions and rules to be considered. It should also be noted that, for illustrative purposes, the claims and prior embodiments may use simplified formulas or simplified variable expressions or parameters. In other words, the formulas and expressions described below may differ from some of the formulas or expressions used previously herein, but still illustrate the same point.

[0065] First, the following definitions are given:

[0066] Target profile (including) Figure 4 The line of the aircraft 200a in the middle is the output profile, in which runway delay should be fully absorbed using the individual speed of each runway segment and the target waiting duration at the holding point.

[0067] T4 is the entry path point. FIX A, FIX B, and FIX C ( Figure 4 The dedicated waypoints (210) are waypoints along the target profile. The flow optimization algorithm should issue target times for all these points. The desired intervals between flights at these points are configuration parameters. If the flow optimization algorithm cannot achieve the desired intervals, the controller should manually space the flights using different flight altitudes.

[0068] FIX C is a waiting point that can absorb some runway delay. The variable h defines the waiting duration. The waiting entry time and waiting exit time are target times calculated by the flow optimization algorithm. There are no restrictions on the value of the waiting duration.

[0069] Variable d1 is the flight duration from segment T4 to segment A, d2 is the flight duration from segment A to segment B, d3 is the flight duration from segment B to segment C, and d4 is the flight duration from segment C to segment RWY. The five durations (d1 to d4 and h) are unknown variables, which are found by the flow optimization algorithm via the optimization problem described below.

[0070] To establish a mathematical model, the following notation is used:

[0071] N is the number of segments (route segments between dedicated waypoints, including the runway), and the index k is the index of each dedicated waypoint. For each segment, its length is known and denoted as L. k .

[0072] The speed of each flight should not be increased in subsequent segments; that is, the speed on route segment S3 must be less than or equal to the speed on route segment S2.

[0073] M represents the number of flights. The superscripts f and p are the indices of the two flights.

[0074] ETO f This is the estimated overflight time of flight f at the approach waypoint, and It is the preferred fly-over time of flight f at dedicated waypoint k. The expected fly-over time and preferred fly-over time are all given externally, such as by ETFMS or calculated using the BADA model.

[0075] These are the earliest and latest ETOs. Both can be given externally, for example, calculated using the maximum acceleration trajectory and minimum smooth trajectory from the Aircraft Database (BADA) model. Alternatively, the earliest and latest ETOs can be determined by the configurable time-to-live (TTL) loss for each route segment. k and the acquisition time (TTG) for each route segment k To limit:

[0076]

[0077] This is the target landing time for flight f at RWY. It is the estimated landing time based on the preferred landing profile. and Both are given externally. Runway delays for flights are determined by... The given value should be fully absorbed by the flow optimization algorithm.

[0078] This is the target flight time for flight f at point k. This is an unknown variable, which will be determined by the flow optimization algorithm.

[0079] It refers to the target time released for flight f and point k. Optionally provided by an external system. In a given... In this case, the target times for each dedicated waypoint of this flight are said to be frozen, and the flow optimization algorithm will no longer change the target times. Typically, a waypoint is frozen when the previously calculated target time or the actual time to pass through that waypoint has already elapsed.

[0080] In addition, the following assumptions are made:

[0081] Assume that the flight order at all points is known and given externally.

[0082] Flights on different routes will not overtake each other.

[0083] Introduce the following variables:

[0084] It is the target flight duration of flight f in segment k.

[0085] The interval term represents the interval between the optimized dedicated waypoint k and the previous flight.

[0086] It is a free variable representing an additional optional interval that covers the "natural gap" between two flights.

[0087] This is the waiting time for flight f.

[0088] In addition, there are some variables that depend on the flight state and can be defined before the algorithm runs:

[0089] The initial time of the flight is the estimated flyby time of the approach waypoint. If the entry pathpoint is frozen, the initial time is set to the published target time for passing through the entry pathpoint:

[0090] In the case of the entry point being frozen.

[0091] Furthermore, if there are more freeze points, this is if there are other target release times. In this case, the target time for these freeze points and all other times will be fixed, and the target time will no longer be optimized.

[0092] For all k, where It was given.

[0093] Using the defined variables, we can determine the target time for flight f to pass through the dedicated waypoint k. Coupled with a specific flight duration, as follows:

[0094]

[0095] in, It is the landing time calculated with respect to the waiting duration, and must meet the target landing time (RTO) given externally.

[0096] The following set of constraints is applied to the variables under consideration. These constraints ensure that each flight absorbs all delays along the path, has a "physically" suitable profile, and that the actual distance between flights at each point is covered by optimization and optional interval terms:

[0097] The optimization algorithm does not directly use the aircraft's speed, but instead uses the duration between two dedicated waypoints. Minimum duration and maximum duration Calculate using an externally provided ETO:

[0098]

[0099] The duration of each flight segment is limited by a minimum duration and a maximum duration:

[0100]

[0101] For each flight and each dedicated waypoint, we calculate the minimum and maximum target times starting from the approach waypoint. ]:

[0102]

[0103] If a flight achieves a target landing time (RTO) earlier than the minimum landing time If the target time for the situation is announced, then the RTO will be set to the minimum landing time: .

[0104] The target flight duration is constrained by the difference between RTO and ETO; that is, the entire runway delay should be absorbed within the remaining path after the last freeze point. Alternatively, alternative locations may be selected.

[0105]

[0106] Depending on the configuration, the flight speed of some segments should be less than or equal to the speed of the previous segment:

[0107]

[0108] Only This constraint can only be applied under certain conditions. If a specific dedicated path point k does not meet this condition, the corresponding velocity constraint will be omitted.

[0109] The actual interval between flights (f is the latter, p is the former) is the optimized interval related to flight f. and optional interval The sum of . Only when the distance between flights is greater than the desired interval, i.e., in the presence of a "natural gap", is the item... Only when it is greater than zero. For aircraft on the same route, the target time is required to ensure that the time interval is always maintained:

[0110]

[0111] This constraint applies only if the minimum and maximum target times allow for the required sequence of these flights:

[0112] interval Only the minimum interval that is as expected should be optimized. Therefore, the optimized interval is subject to the following constraints:

[0113] in, It is the expected minimum interval at the dedicated path point k.

[0114] If a flight obtains a target release time that results in a situation where another flight is scheduled to depart, then the interval constraint can no longer be satisfied. In this case, the corresponding constraint will be omitted.

[0115] Use the following cost function:

[0116] The primary optimization objective is to find the target time for dedicated waypoints to sort the arrival times of all waypoints, minimizing the use of vertical intervals, i.e., maximizing the number of flights with time intervals in the airspace. To achieve this, we maximize the interval for each flight f up to the desired minimum interval:

[0117]

[0118] The second optimization objective is to minimize the waiting time and shift the waiting delay to a specific route segment:

[0119]

[0120] The third optimization objective—in order to maintain a natural gap between two flights, the target time for each flight and dedicated waypoint should be pushed along the preferred ETO direction by minimizing the following:

[0121]

[0122] Then we can use weighting factors. Couple all these minimization terms:

[0123]

[0124] in, This is a separate penalty factor configured for each dedicated waypoint. Here, This ensures that the spacing is maximized with a higher priority than preserving the natural gap.

[0125] The project that led to this application was funded by SESAR Joint Enterprise (JU) under grant agreement Np [872085 —PJ01-W2 EAD]. JU is supported by the EU Horizon 2020 Research and Innovation Programme and SESAR JU members outside the EU.

[0126] List of reference numerals

[0127] 100 Optimization Methods

[0128] 102 Receives the estimated arrival time at at least one arrival path point.

[0129] 104 Receive the target time for each aircraft to reach the merged waypoint

[0130] 106 receives route information from each aircraft.

[0131] 108 defines the minimum time-based interval expected for each pair of aircraft.

[0132] 110 Determine the optimal target arrival time at the dedicated waypoint.

[0133] 200a and 200b aircraft

[0134] 202 aircraft pair

[0135] 204 Predefined Environment / Airspace

[0136] 206 Entry Path Point

[0137] 208 merged path points

[0138] 210 Dedicated Waypoint

[0139] 212 Destination Airport

[0140] 214 Optimization Model

[0141] 216 First Optimization Objective

[0142] 218 Second Optimization Objective

[0143] 220 Third Optimization Objective

[0144] 222 Cost Function

[0145] 224 constraints

[0146] Equipment 227

[0147] 228 processing units / microprocessors

[0148] 230 Computer Programs

[0149] 232 Other Arrival Streams

[0150] BADA Aircraft Database

[0151] The delay that D needs to absorb

[0152] Estimated flyby time at ETO approach path point

[0153] ETO k Optimal fly-through time at a specific dedicated waypoint k

[0154] ETO N Estimated time to reach the merge path point

[0155] RTO: Target time to reach the merge path point (required time to pass through the merge path point)

[0156] weighting factors c1, c2, and c3

[0157] h Waiting procedure duration

[0158] The minimum time-based interval expected for each pair of aircraft at a specific dedicated waypoint k.

[0159] T k Optimized target arrival / flight time at a specific dedicated waypoint k

[0160] s k Optimized time-based intervals between aircraft pairs at a specific dedicated waypoint k

[0161] m k Natural gap between aircraft pairs

[0162] d1-d n Flight duration between dedicated waypoints

Claims

1. A method (100) for optimizing the flow of at least two aircraft (200a, 200b) forming at least one pair of aircraft (202), wherein, Each aircraft (200a, 200b) enters a predefined environment (204) as airspace via a separate or common approach waypoint (206), and wherein the aircraft (200a, 200b) approaches a common predefined merging waypoint (208), the method (100) comprising: - Receive the estimated arrival time (ETO) for each aircraft (200a, 200b) at the at least one approach path point (206). - Receive the target time (RTO) for each aircraft (200a, 200b) to reach the merged waypoint (208), wherein the target time (RTO) includes the delay (D) to be absorbed before reaching the merged waypoint (208). - Receive route information for each aircraft (200a, 200b), the route information including path points for guiding the aircraft (200a, 200b) from the approach path point (206) to the merge path point (208), wherein the path points include at least one dedicated path point (210). -Constrain (108) the minimum time-based interval expected for each pair of aircraft (202). ( ),as well as -Use the optimization model (214) to determine the optimal target arrival time (T) of the at least two aircraft (200a, 200b) at one or more dedicated waypoints (210) of (110). k The optimization model (214) considers the estimated arrival time (ETO), the target time (RTO) for each aircraft to reach the merged waypoint, and the desired minimum time-based interval. ), wherein the arrival time of the optimization target (T) is determined. k This allows the delay (D) to be absorbed by each aircraft (200a, 200b) to be shared between the route segments defined by the dedicated waypoint (210). The characteristic is that the optimization model (214) utilizes the desired minimum time-based interval ( ) as a soft constraint (226).

2. The method (100) according to claim 1. in, The merged path point (208) is the destination airport (212).

3. The method (100) according to claim 1 or 2. in, By the desired minimum time-based interval ( As the first optimization objective (216), the optimization model (214) makes the time-based interval (s) between each pair of aircraft (202) at the one or more dedicated waypoints (210) the k )maximize.

4. The method (100) according to claim 3. in, The time-based interval (s) k ) is maximized only up to the predefined expected interval ( ).

5. The method (100) according to claim 1 or 2. in, The optimization model (214) also considers one or more waiting procedure durations (h) of the at least two aircraft (200a, 200b), wherein the waiting procedure duration (h) is used to delay the aircraft (200a, 200b), and wherein the optimization model (214) minimizes the waiting procedure duration (h) as a second optimization objective (218).

6. The method (100) according to claim 1 or 2. in, The method (100) further includes: receiving the preferred time of flight (ETO) of the at least one dedicated waypoint (210). k ), Furthermore, the optimization model (214) will also optimize the preferred fly-through time (ETO) at a specific dedicated waypoint (210). k ) and the target arrival time (T) k Minimize the difference between (220) as the third optimization objective.

7. The method (100) according to claim 1 or 2. in, The optimization model (214) also includes a cost function (222), wherein the cost function (222) is configured to balance some or all of the optimization objectives (216, 218, 220) relative to each other.

8. The method (100) according to claim 7, wherein, The cost function (222) is configured to balance some or all of the optimization objectives (216, 218, 220) relative to each other by utilizing weighting factors (c1, c2, c3) associated with the optimization objectives (216, 218, 220).

9. The method (100) according to claim 1 or 2. in, The optimization model (214) also includes the maximum and minimum flight durations and / or the adjusted maximum and minimum flight durations between dedicated waypoints (210) as further constraints (224).

10. The method (100) according to claim 9. in, The maximum flight duration and the minimum flight duration are determined by utilizing the maximum acceleration trajectory and / or minimum smooth trajectory of the aircraft (200a, 200b).

11. The method (100) of claim 10, wherein the maximum flight duration and the minimum flight duration are determined by utilizing the maximum acceleration trajectory and / or minimum smooth trajectory of the aircraft (200a, 200b) received from the aircraft database (BADA).

12. The method (100) according to claim 9. in, The adjusted maximum flight duration is calculated by utilizing the determined maximum flight duration and an additional configurable loss time. And / or The adjusted minimum flight duration is calculated by using the determined minimum flight duration and an additional configurable acquisition time.

13. The method (100) according to claim 1 or 2. in, The target arrival time (T) at one or more dedicated waypoints (210) k () was recalculated.

14. The method (100) according to claim 13. in, The target arrival times of one or more aircraft (200a, 200b) at one or more dedicated waypoints (210) are excluded from recalculation.

15. The method (100) according to claim 14, wherein, When the dedicated waypoint (210) has overflowed, the target arrival time (T) associated with the dedicated waypoint (210) is... k ) were excluded from recalculation.

16. The method (100) according to claim 1 or 2. in, The optimization model (214) uses the reduction in aircraft speed from the approach path point to the merging path point as a further constraint (224).

17. An apparatus (227) for optimizing the flow of at least two aircraft (200a, 200b) forming at least one pair of aircraft (202), wherein, Each aircraft (200a, 200b) enters a predefined environment (204) as airspace via an approach waypoint (206), and wherein the aircraft (200a, 200b) approaches a common predefined merging waypoint (208), and the device (227) includes a processing unit (228) on which the method (100) according to any one of claims 1 to 16 is executed.

18. The device (227) according to claim 17, wherein, The processing unit (228) is a microprocessor.

19. A computer program product comprising a computer program (230) configured to perform the method (100) according to any one of claims 1 to 16 when executed on a computer.

Citation Information

Patent Citations

  • A route planning method and device for a terminal control area

    CN106781708B

  • Aircraft flow management method and system

    EP1428195B1

  • Terminal Aircraft Sequencing and Conflict Resolution

    US20130110388A1

  • Systems and methods for controlling aircraft arrivals at a waypoint

    US20150081198A1

  • Airline planning method and device for terminal control area

    CN106781708A