CHAPTER 4. DETERMINISTIC OPTIMAL CONTROL APPROACH

In this chapter, the optimal control method employed to solve the deterministic formation mission design problem is introduced. First, the formulation of the formation mission design problem is presented. It is formulated as an optimal control problem for a switched dynamical system with logical constraints in disjunctive form. Switched dynamical systems, which are described by both a continuous and a discrete dynamics, are employed to represent the formation flight and logical constraints in disjunctive form are used to model the discrete dynamics of the switched system. In these constraints, binary or integer variables are used to model switching decisions. Finally, the embedding approach is described, which is used to convert the original switched optimal control problem into a smooth optimal control problem, in which the logical constraints in disjunctive form are converted into equality and inequality constraints without binary or integer variables.

4.1. The smooth optimal control problem

Consider a dynamical system described by a differential equation

x˙(t)=f(t,x(t),u(t)),            (4.1)

in which variable t represents the time variable and the functions x(t) and u(t) represent the state and the control input of the system, respectively. Let

J(t,x(t),u(t))            (4.2)

be a cost functional, which maps the time variable and the state and control functions into a single number.

An instance of a smooth OCP can be informally stated as follows: determine the control input that steers the system from an initial state to a final state minimizing the cost functional J. In general, the time variable and the control and state functions are subject to constraints.

This simple instance of an OCP corresponds to a single-phase OCP. In general, optimal control models include more than one phase. Each phase in an OCP represents a portion of the trajectory of a dynamical system, and may be subject to different equations of motion, different time discretization, different control parameterizations, or different path constraints.

A different set of ODEs can be employed in each phase to reflect the switching behaviour of a dynamical system. A specific time discretization fitted to the dynamics of that portion of the trajectory can be used in every phase. For instance, if one part of a trajectory has slower dynamics and another part has faster dynamics, the time interval can be split into two phases with coarser time discretization for the first phase and a finer time discretization for the second phase. In the control parameterization method, the control space is discretized by approximating the control function using a linear combination of basis functions. In this way, the OCP is reduced to a NLP with a finite number of decision variables. Different control parameterizations such as piecewise constant and piecewise linear, can be employed in the same problem by defining different phases. Different path constraints, which are bound constraints on some performance parameter, can also be imposed within each phase. Phases are also necessary to impose intermediate constraints upon some variables. This can be done by imposing them as boundary constraints at the junction between two phases. Finally, linkage constraints should be enforced in order to assemble all the phases of the problem to get a unique trajectory for the system [Falck et al., 2021].

OCP can be formulated for continuous-time dynamical systems, as is the case in this thesis, and for discrete-time dynamical systems. OCP formulations may also include binary or integer variables to model decision-making processes.

As mentioned before, in general, optimal control problems include not only differential constraints but also algebraic constraints and path constraints. A more general formulation of a continuous smooth OCP is the following:

minuΩJ(t,x(t),u(t))=M(tF,xF)+tItFL(t,x(t),u(t))dt,          (4.3a)

s.t.x˙(t)=f(t,x(t),u(t)),          (4.3b)

0=g(t,x(t),u(t)),          (4.3c)

ηl(t)η(t,x(t),u(t))ηu(t),          (4.3d)

x(tI)=xIn,          (4.3e)

x(tF)=xFn,          (4.3f)

where u(t) ϵ ℝm, x(t) ϵ ℝn, and Eq. (4.3a) represents the performance index of the OCP, in which J is a Bolza cost functional, consisting of two terms, the endpoint cost functional M, also known as Mayer term, which is defined on a neighborhood of B, and the running cost functional, L, also known as Lagrange term, which is a continuously differentiable functional. The control input u(t) is constrained to belong, at each time instant, to the bounded and convex set Ω. Eqs. (4.3b) and (4.3c) represent the set of algebraic-differential equations, where function f determines the dynamics of the system and function g describes the right-hand side of the algebraic constraints. The problem can be also constrained by path constraints represented by Eq. (4.3d), where ηl and ηu represent the lower and upper bound for each function η. Finally, Eqs. (4.3e) and (4.3f) represents the initial and final boundary conditions, respectively. The initial time tI, the initial state x(tI), the final time tF, and final state x(tF) are assumed to be restricted to a boundary set B as follows: (tI,x (tI) ,tF, x (tF)) ϵ B = TI × BI × TF × BF ⊂ ℝ2n + 2.

In typical aerospace optimization problems the performance index of Eq. (4.3a) only contains the Mayer term. This is the case of this thesis, in which the objective functional in Eq. (3.18) is in Mayer form and represents a combination of fuel consumption and flight time of the aircraft.

Eqs. (4.3b) and (4.3c) correspond to the DAE systems given in Table 3.2, which describe the motion of each aircraft involved in a formation. In particular, the DAE system in the left column of the table describes the solo flight and the flight of the leader of a formation, and the DAE system in the right column of the table describes the flight of the intermediate and trailing aircraft of a formation.

The path constraints represented by Eq. (4.3d) correspond to the flight envelope given in Eq. (3.4). These constraints are usually given in terms of lower and upper bounds for several state and control variables such as flight altitude, load factor and airspeed. Notice that, Eqs.(4.3c) and (4.3d) also include logical constraints based on the stream-wise distance between aircraft, which are used in this thesis to model the switching between solo flight mode and formation flight mode for each aircraft. These constraints will be discussed later, in Section 4.2.4 of this chapter.

Eqs. (4.3e) and (4.3f) represent the initial and final conditions which are specified for each experiment in chapters 7 and 8.

For the sake of ease of exposition, in the formulation of the OCP for switched dynamical systems presented in the following section, neither algebraic equations nor path constraints have been included.

4.2. The switched optimal control problem

In this thesis, the formation mission design problem is formulated as an OCP for a switched dynamical system. Switched systems are described by both a continuous and a discrete dynamics in which the transitions among discrete states are not established in advance. In particular, each aircraft has different flight modes, namely solo flight and flight in different positions inside a formation, and their combination is represented by the discrete state of the switched dynamical system, which models their joint dynamic behavior. Each flight mode will be represented by different dynamical equations which may include or not formation flight benefits in terms of fuel savings.

In this section, following [Bengea et al., 2011], the formulation of a simple OCP given in Section 4.1, is generalized for switched systems, introducing the switched optimal control problem (SOCP) for two-switched dynamical systems. Hereinafter, subindex "S" has been employed in the formulation of the OCP for switched dynamical systems for the sake of clarity. In particular, the dynamical model of a two-switched dynamical system can be represented by

x˙S(t)=fvS(t)(t,xS(t),u(t)),xS(tI)=x1n,xS(tF)=x1n,vS(t){0,1},tIttF.            (4.4)

In this model, the continuously differentiable vector fields, f0, f1 : ℝ × ℝn × ℝm → Rn, specify the dynamics of the two possible modes of the system. The control input us(t) ϵ Ω ⊂ ℝm is constrained to belong, at each time instant t, to the bounded and convex set Q. The binary variable υs (t) is the mode selection variable that identifies which of the two possible system modes, f0 or f1, is active. Thus, both of them, us (t) and υs (t), can be regarded as control variables. The initial time tI, the initial state xs (tI), the final time tF, and final state xs(tF) are assumed to be restricted to a boundary set B as follows: (tI,xS(tI),tF,xS(tF)) ϵ B = TI × BI × Tf × BF ⊂ R2n+2. The performance index of the SOCP has the following form

JS(t,xS(t),uS(t),vS(t))=MS(tF,xF)+tItFLvS(t)(t,xS(t),u(t))dt,            (4.5)

where the endpoint cost function Ms is defined on a neighborhood of B and formally coincide with function M, and L0 and L1 are real-valued continuously differentiable functions that represent the running cost of operation of the system in each mode.

The SOCP is thus stated as follows

minuSΩ,vS{0,1}=JS(t,xS(t),uS(t),vS(t)),            (4.6)

subject to dynamical equations and endpoint constraints from the set of Eqs. (4.4).

Note that, although the statements of the OCP and the SOCP are quite similar, they are very different in their essence. The fact that the binary variable, υs (t) ϵ {0, 1}, appears within the SOCP formulation, requires an additional transformation of this kind of problems to enable the use of classical optimal control techniques to solve it. To do so, the embedding approach is introduced in the following section.

4.2.1. Specification of the switched optimal control problem

In the formation mission design problem posed in this thesis, each aircraft has different flight modes, namely solo flight and flight in different positions inside a formation, solo flight (SF) or formation flight (FF), respectively, and their combination is represented by the discrete state of the switched dynamical system, which models their joint dynamic behavior. Therefore, the problem will be formulated as an OCP for a switched dynamical system, following the SOCP formulation. Each flight mode will be represented by different dynamical equations which may include or not formation flight benefits in terms of fuel savings.

4.2.2. The embedding approach

In this section the embedding approach employed to transform a SOCP into an embedded optimal control problem (EOCP) is presented. In this way, a smooth OCP without binary variables is obtained, reducing the computational complexity of finding the solution.

Similarly to previous sections, subindex "E" has been employed in the formulation of the EOCP for sake of clarity. Following again [Bengea et al., 2011], the differential equation of the set of Eqs. (4.4) can be rewritten as follows

x˙E(t)=[1vE(t)]f0(t,xE(t),uE0(t))+vE(t)f1(t,xE(t),uE1(t)).            (4.7)

The dynamical constraint from the set of Eqs. (4.4) and Eq. (4.7) formally coincide under the conditions υE(t) = υS(t) and uE0(t) = uE1(t) = us(t). However, in Eq. (4.7), υE(t) ϵ [0,1], while in Eq. (4.4), υS(t) ϵ {0,1}, which is the key feature of the embedding approach [Bengea and DeCarlo, 2005, Bengea et al., 2011]. This method is based on solving the SOCP defined above, using only continuous control variables υE(t) ϵ [0,1], uE0(t), uE1(t) ϵ Ω. In this way, the original switched system is embedded into a larger family of systems parameterized by υE(t) ϵ [0, 1]. The performance index of the SOCP from Eq.(4.5) is rewritten as

JE(t,xE(t),uE0(t),uE1(t),vE(t))=M(tF,xE(tF))+tItF([1vE(t)]L0(t,xE(t),uE0(t))+vE(t)L1(t,xE(t),uE0(t))dt.            (4.8)

The EOCP is thus formulated as

minuE0,uE1Ω,vE[0,1]JE(t,xE(t),uE0(t),uE1(t),vE(t)),            (4.9)

subject to dynamical equations and endpoint constraints from the set of Eqs. (4.7), which is an OCP without binary variables. Therefore, classical techniques from optimal control theory can be applied to solve it.

It has been shown in [Bengea and DeCarlo, 2005] and [Bengea et al., 2011] that, once a solution of the EOCP has been obtained, either the solution is of the switched type, that is, υE takes only the values 0 and 1, or suboptimal trajectories of the SOCP can be constructed that can approach the value of the cost for the EOCP arbitrarily closely, and satisfy the boundary conditions within ϵ, with arbitrary ϵ > 0. A thorough discussion about the relationship between the solutions of the SOCP and the EOCP can be found in [Bengea and DeCarlo, 2005] and [Bengea et al., 2011].

In Section 4.2.4, this approach is particularized to the formation mission design problem in which each aircraft can have different dynamic behavior depending on flying in solitaire, or in a different position within the formation.

4.2.3. Logical constraints modeling

The approach proposed in [Wei et al., 2008] has been employed to transform logical constraints in disjunctive form into inequality and equality constraints that involve only continuous auxiliary variables.

It has been shown in [Cavalier et al., 1990] that every Boolean expression can be transformed into conjunctive normal form (CNF). Hence, there is no loss of generality in considering that any logical constraint can be formulated as a CNF expression

Q1Q2Qn,            (4.10)

in conjunctive form, where the symbol ˄ denotes the “and” operator and

Qi=Pi1Pi2Pimi,i{1,2,,n},            (4.11)

where Qi is expressed in disjunctive form, in which the symbol ˅ denotes the “or” operator and the proposition Pji is either Xji or ¬Xji. The term Xji is a literal that can be either True or False and the symbol ¬ represents the “negation” operator.

Term Xji represents statements such as “D12(t) > 20b ”. Therefore, Pji takes the form

Pij{gij(x(t))0},            (4.12)

i ϵ {1, 2, …, n}, ∀j ϵ {1, 2, …, mi}, where gji : ℝnx ⟶ ℝ is assumed to be a C1 function.

To incorporate logical constraints in a OCP, they must be converted into a set of equality or inequality constraints. Additionally, if binary variables are not used, the combinatorial complexity of integer programming is avoided. Notice that, conjunctions from Eq. (4.10) can be easily included in a OCP are equivalent to Qi, ∀i ϵ {1, 2, …, n}. To be able to transform the disjunctions into a set of inequality constraints, a continuous variable αji(t) ϵ [0, 1] is defined and associated with each Pji in Eq. (4.12). Thus, Eq. (4.11) can be rewritten as

i{1,2,,n},j{1,2,,mi}:andandαij(t)gij(x(t))00αij(t)1,j=1miαij(t)=1,            (4.13)

The first constraint in (4.13) shows that when αji(t) = 0 the constraint gji (x(t)) < 0 is not forced to be fulfilled. In contrast, if 0 < αji(t) <1, then αji(t) < 0, gji (x(t)) < 0 and, consequently, the constraint gji (x(t)) ≤ 0 is forced to be fulfilled. The last equation in the system (4.13) guarantees that, at least, one of the propositions Pji holds.

In the next section, this approach will be applied to the formation mission design problem in which logical constraints involve the longitudinal distance between aircraft.

4.2.4. Specification of the embedded optimal control problem with equality and inequality constraints

In this section, the embedding approach is applied to the SOCP described in Section 4.2 and the logical constraints in disjunctive form based on the stream-wise distance between aircraft are converted into a set of inequality and equality constraints which will be added to the EOCP.

In the formation mission design problem posed in this thesis, not all the dynamic Eqs. (3.12) are subject to switches. More specifically, the equations of motion associated to the state variables ϕ, λ, χ, and V, do not switch whereas the aircraft's mass flow rate does when the aircraft p joins or leaves a formation as a trailing or an intermediate aircraft. To model this switching, mass flow rate equations considering fuel savings and not considering them, are combined using the selection variable υEp(t), p ϵ {1, …, Na} as follows

p{1,,Na}:ϕ˙p=Vpcosχp+VWNRE+hp,λ˙p=Vpsinχp+VWEcosϕp(RE+hp),χ˙p=LpsinμpVpmp,V˙p=TpDpmp,m˙p=(1vEp)[Tpηp]+vEp[(1Rfuelp)Tpηp],            (4.14)

where υEp(t) = 1 corresponds to FF and υEp(t) = 0 to SF.

Thus, each aircraft has a different individual dynamic behavior which corresponds to SF or FF in a different position within the in-line formation. The combination of these behaviors represents the discrete states of the switched system that models the joint dynamic behavior of all the aircraft.

However, in mission design problems, the switching control variables vEp(t), p ϵ {1 ,…,Na} depend on the state variables, in particular on the geographical coordinates of the aircraft. Indeed, not all transitions between discrete states are possible at any time, since while the distance between aircraft is larger than 20 wingspans, FF can not take place. Furthermore, the switching control variables depend on one another. For instance, in a two-aircraft formation, if one aircraft is selected as the trailing aircraft the other one is forced to be the leader and vice versa. Similarly, in a three-aircraft formation, if one position in the formation is assigned to one aircraft, the other ones must fly in another position.

Thus, the switched system that represents the joint dynamic behavior of all the aircraft involved in the mission design problem should follow some rules that are specified using logical constraints. In particular, the switching logic among the discrete states of the system presented in the SOCP presented in this thesis, are modeled by logical constraints in disjunctive form, based on the stream-wise distance between aircraft. As stated in Eq. (3.7), it has been considered that the great-circle distance between aircraft in FF is between 10 and 20 wingspans, and is greater than 20 wingspans in case of SF. Hence, the distance between aircraft satisfies

p,q{1,,Na},p<q:or10bDpq(t)20b,Dpq(t)20b.            (4.15)

Using simple Boolean algebra, Eq.(4.15) can be rewritten as

p,q{1,,Na},p<q:and10bDpq(t),Dpq(t)20borDpq(t)20b.            (4.16)

To transform the disjunctions into a set of equality and inequality constraints, a new variable is defined. Thus, in two-aircraft mission design problems, only a continuous variable related to the longitudinal distance D12 should be defined, whereas, in three-aircraft mission design problems three continuous variables must be introduced, which are related to the longitudinal distances D12, D13, D23. Thus, calling the new continuous variable αpq(t) ϵ [0, 1], ∀ p, q ϵ {1,…, Na}, p < q, the logical constraints in Eq.(4.16) can be rewritten as

p,q{1,,Na},p<q:andαpq(t)(Dpq(t)20b)0,(1αpq(t))(20bDpq(t))0,andand0αpq(t)1,Dpq(t)10b.            (4.17)

For aircraft p and q, if Dpq(t) > 20b, αpq(t) must be zero in order to satisfy the second constraint in (4.17). Otherwise, when Dpq(t) < 20b, the variable αpq(t) = 1, to fulfill the second constraint in the above set of equations. Formation flight benefits will be achieved only when αpq(t) = 1. In any case, the last constraint in (4.17) ensures that the longitudinal distance between aircraft will always satisfy the safety minimum distance of 10b.

It can be observed that nature of the variables υEp(t), Vp ϵ {1, …, Na}, and αpq(t), V p, q ϵ {1, …, Na}, p < q, is similar. The variable υEp(t) selects equations of the dynamic model for aircraft p, whereas the variable αpq(t) selects constraints. Therefore, although, for the sake of clarity, a different notation has been employed in the previous sections to describe them, the variables αpq(t) and υEp(t) are directly related by the following equivalence

p,q{1,,Na},p<q:αpq(t)=vEp(t),            (4.18)

where aircraft p is supposed to be the trailing aircraft. Therefore, the variable υEp(t), which selects equations of the dynamic model for aircraft q, must be zero regardless of the value of variable αpq(t), as aircraft q will be the leader one and, hence, it will achieve no benefits from the formation.

It is important to notice that the equivalence in Eq. (4.18) between the continuous variables obtained from the embedding approach, used to model the switched dynamical system and transform the logical constraints in disjunctive form into inequality and equality constraints, need not necessarily be fulfilled in others EOCPs.

4.3. Conclusions

In this chapter, the optimal control method employed to solve the deterministic formation mission design problem has been presented. The problem is formulated as an optimal control of a switched dynamical system which has been converted into a smooth optimal control problem using the embedding approach. The embedding approach is a unifying technique able to efficiently tackle both the switching dynamics and the logical constrains of the optimal control problem, transforming it into a smooth optimal control problem, which can be solved using classical optimal control techniques. The main advantages of this approach are that the multiphase formulation is avoided, as well as the use of integer variables, decreasing the computational time and effort in finding the solution. This approach has substantial advantages compared to multiphase approaches, which are based on exhaustively analyzing every possible formation mission individually and then, comparing the results. Additionally, it is easily scalable to design formation mission problems with an arbitrary number of flights.

Bibliography

[Abeyratne, 2020] Abeyratne, R. (2020). The outcome of the 40th ICAO assembly: A new look at ICAO? Air and Space Law, 45(1).

[Abrantes et al., 2021] Abrantes, I., Ferreira, A. F., Silva, A., and Costa, M. (2021). Sustainable aviation fuels and imminent technologies-CO2 emissions evolution towards 2050. Journal of Cleaner Production, 313:127937.

[Airbus, a] Airbus. https://www.airbus.com/en/newsroom/press-releases/2021-11-airbus-and-its-partners-demonstrate-how-sharing-the-skies-can-save. Accessed: 2021-11-18.

[Airbus, b] Airbus. https://www.airbus.com/en/innovation/disruptive-concepts/biomimicry/fellofly. Accessed: 2022-01-10.

[Alwan and Liu, 2018] Alwan, M. S. and Liu, X. (2018). Theory of Hybrid Systems: Deterministic and Stochastic. Springer.

[Ansari et al., 2020] Ansari, M. Y., Ahmad, A., Khan, S. S., Bhushan, G., et al. (2020). Spatiotemporal clustering: A review. Artificial Intelligence Review, 53(4):2381–2423.

[Assembly 40th, 2019] Assembly 40th, I. https://www.icao.int/Meetings/a40/Documents/WP/wp_317_en.pdf. Accessed: 2021-11-21.

[Aung and Tan, 2010] Aung, H. H. and Tan, K.-L. (2010). Discovery of evolving convoys. In Gertz, M. and Ludäscher, B., editors, International Conference on Scientific and Statistical Database Management, pages 196–213. Springer.

[Bengea et al., 2011] Bengea, S., Uthaichana, K., Zěfran, M., and DeCarlo, R. A. (2011). Optimal control of switching systems via embedding into continuous optimal control problem. In Levine, W. S., editor, The Control Handbook: Advanced Methods, chapter 31, pages 31–1 – 31–23. CRC Press.

[Bengea and DeCarlo, 2005] Bengea, S. C. and DeCarlo, R. A. (2005). Optimal control of switching systems. Automatica, 41:11–27.

[Betts, 2010] Betts, J. T. (2010). Practical Methods for Optimal Control and Estimation using Nonlinear Programming. SIAM.

[Bieniawski et al., 2014] Bieniawski, S. R., Clark, R. W., Rosenzweig, S. E., and Blake, W. E. (2014). Summary of flight testing and results for the formation flight for aerodynamic benefit program. In Proceedings of the 52nd Aerospace Sciences Meeting, National Harbor, MD, USA.

[Blake and Flanzer, 2016] Blake, W. B. and Flanzer, T. C. (2016). Optimal routing for dragreducing formation flight: A restricted case. Journal of Guidance, Control, and Dynamics, 39(1):173–176.

[Blatman and Sudret, 2010] Blatman, G. and Sudret, B. (2010). An adaptive algorithm to build up sparse polynomial chaos expansions for stochastic finite element analysis. Probabilistic Engineering Mechanics, 25(2):183–197.

[Bower et al., 2009] Bower, G. C., Flanzer, T. C., and Kroo, I. M. (2009). Formation geometries and route optimization for commercial formation flight. In Proceedings of the 27th AIAA Applied Aerodynamics Conference, San Antonio, TX, USA.

[Buhmann, 2003] Buhmann, M. D. (2003). Radial Basis Functions: Theory and Implementations. Cambridge University Press.

[Camilleri, 2018] Camilleri, M. A. (2018). Aircraft operating costs and profitability. In Travel Marketing, Tourism Economics and the Airline Product, chapter 12, pages 191–204. Springer.

[Caprace et al., 2019] Caprace, D.-G., Winckelmans, G., Chatelain, P., and Eldredge, J. D. (2019). Wake vortex detection and tracking for aircraft formation flight. In Proceedings of the AIAA Aviation 2019 Forum, Dallas, TX, USA.

[Cavalier et al., 1990] Cavalier, T. M., Pardalos, P. M., and Soyster, A. L. (1990). Modeling and integer programming techniques applied to propositional calculus. Computers and Operations Research, 17(6):561–570.

[Cook et al., 2015] Cook, A., Blom, H. A., Lillo, F., Mantegna, R. N., Micciche, S., Rivas, D., Vázquez, R., and Zanin, M. (2015). Applying complexity science to air traffic management. Journal of Air Transport Management, 42:149–158.

[Dee et al., 2011] Dee, D. P., Uppala, S. M., et al. (2011). The ERA-Interim reanalysis: Configuration and performance of the data assimilation system. Quarterly Journal of the Royal Meteorological Society, 137(656):553–597.

[Durango et al., 2016] Durango, G. J., Lawson, C., and Shahneh, A. Z. (2016). Formation flight investigation for highly efficient future civil transport aircraft. The Aeronautical Journal, 120(1229):1081–1100.

[Eurocontrol, 2013] Eurocontrol (2013). User manual for the Base of Aircraft Data (BADA). Technical Report 130416, Eurocontrol.

[Fahroo and Ross, 2000] Fahroo, F. and Ross, I. M. (2000). A spectral patching method for direct trajectory optimization. Journal of the Astronautical Sciences, 48(2):269–286.

[Fahroo and Ross, 2008] Fahroo, F. and Ross, I. M. (2008). Advances in pseudospectral methods for optimal control. In Proceedings of the AIAA Guidance, Navigation and Control Conference and Exhibit, Honolulu, HI, USA.

[Falck et al., 2021] Falck, R., Gray, J. S., Ponnapalli, K., and Wright, T. (2021). Dymos: A Python package for optimal control of multidisciplinary systems. Journal of Open Source Software, 6(59):2809.

[Flanzer et al., 2014] Flanzer, T. C., Bieniawski, S. R., and Blake, W. B. (2014). Operational analysis for the formation flight for aerodynamic benefit program. In Proceedings of the 52nd Aerospace Sciences Meeting, National Harbor, MD, USA.

[Flanzer et al., 2020] Flanzer, T. C., Bieniawski, S. R., and Brown, J. A. (2020). Advances in cooperative trajectories for commercial applications. In Proceedings of the AIAA SciTech 2020 Forum, Orlando, FL, USA.

[Garg, 2011] Garg, D. (2011). Advances in Global Pseudospectral Methods for Optimal Control. PhD thesis, University of Florida, Gainesville, FL, USA.

[Garg et al., 2011] Garg, D., Patterson, M. A., Francolin, C., Darby, C. L., Huntington, G. T., Hager, W. W., and Rao, A. V. (2011). Direct trajectory optimization and costate estimation of finite-horizon and infinite-horizon optimal control problems using a Radau pseudospectral method. Computational Optimization and Applications, 49(2):335–358.

[Garg et al., 2009] Garg, D., Patterson, M. A., Hager, W., Rao, A. V., Benson, D. A., and Huntington, G. T. (2009). An overview of three pseudospectral methods for the numerical solution of optimal control problems. Advances in the Astronautical Sciences, 135:1–17.

[Haalas et al., 2014] Haalas, D. J., Bieniawski, S. R., Whitehead, B., Flanzer, T., and Blake, W. B. (2014). Formation flight for aerodynamic benefit simulation development and validation. In Proceedings of the 52nd Aerospace Sciences Meeting, National Harbor, MD, USA.

[Hallock and Holzapfel, 2018] Hallock, J. N. and Holzäpfel, F. (2018). A review of recent wake vortex research for increasing airport capacity. Progress in Aerospace Sciences, 98:27–36.

[Hart et al., 2012] Hart, W. E., Laird, C. D., Watson, J.-P., Woodruff, D. L., Hackebeil, G. A., Nicholson, B. L., and Siirola, J. D. (2012). Pyomo-Optimization Modeling in Python. Springer.

[Hartjes et al., 2018] Hartjes, S., van Hellenberg Hubar, M. E., and Visser, H. G. (2018). Multiple-phase trajectory optimization for formation flight in civil aviation. In Dolega, B., Glebocki, R., Kordos, D., and Zugaj, M., editors, Advances in Aerospace Guidance, Navigation and Control, pages 389–405. Springer.

[Hartjes et al., 2019] Hartjes, S., Visser, H. G., and van Hellenberg Hubar, M. E. (2019). Trajectory optimization of extended formation flights for commercial aviation. Aerospace, 6(9):100.

[Héder, 2017] Héder, M. (2017). From NASA to EU: the evolution of the TRL scale in Public Sector Innovation. The Innovation Journal, 22(2):1–23.

[Hu et al., 2005] Hu, J., Prandini, M., and Sastry, S. (2005). Aircraft conflict prediction in the presence of a spatially correlated wind field. IEEE Transactions on Intelligent Transportation Systems, 6(3):326–340.

[Hull, 2007] Hull, D. G. (2007). Fundamentals of Airplane Flight Mechanics. Springer.

[Huntington, 2007] Huntington, G. T. (2007). Advancement and analysis of a Gauss pseudospectral transcription for optimal control problems. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA, USA.

[Huntington and Rao, 2008] Huntington, G. T. and Rao, A. V. (2008). Comparison of global and local collocation methods for optimal control. Journal of Guidance, Control, and Dynamics, 31(2):432–436.

[IATA, 2013] IATA (2013). Technology roadmap, 4th Edition. Technical report, International Air Transport Association.

[IATA, 2016] IATA (2016). Press Release No. 59. IATA forecasts passenger demand to double over 20 years. https://www.iata.org/en/pressroom/pr/2016-10-18-02/. Accessed: 2021-12-19.

[ICAO, 1944] ICAO (1944). Convention on international civil aviation. Annex 2. Technical report, International Civil Aviation Organization.

[ICAO, 2016] ICAO (2016). Environmental report 2016. Aviation and climate change. Technical report, International Civil Aviation Organization.

[ICAO, 2017] ICAO (2017). Airline operating costs and productivity. Technical report, International Civil Aviation Organization.

[IPCC, 2018] IPCC (2018). Global warming of 1.5C. Technical report, The Intergovernmental Panel on Climate Change.

[Jeung et al., 2010] Jeung, H., Yiu, M. L., Zhou, X., Jensen, C. S., and Shen, H. T. (2010). Discovery of convoys in trajectory databases. Proceedings of the VLDB Endowment, 1(1):1068–1080.

[Kent and Richards, 2014] Kent, T. and Richards, A. (2014). Accounting for the effect of ground delay on commercial formation flight. In Proceedings of the 2014 UKACC International Conference on Control, Loughborough, United Kingdom.

[Kent and Richards, 2015] Kent, T. E. and Richards, A. G. (2015). Analytic approach to optimal routing for commercial formation flight. Journal of Guidance, Control, and Dynamics, 38(10):1872–1884.

[Kent and Richards, 2021] Kent, T. E. and Richards, A. G. (2021). Potential of formation flight for commercial aviation: Three case studies. Journal of Aircraft, 58(2):1–14.

[Kim and Braatz, 2012] Kim, K. K. K. and Braatz, R. D. (2012). Probabilistic analysis and control of uncertain dynamic systems: Generalized polynomial chaos expansion approaches. In Proceedings of the 2012 American Control Conference, Montreal, QC, Canada.

[Klavins, 2004] Klavins, E. (2004). Communication complexity of multi-robot systems. In Boissonnat, J., Burdick, J., Goldberg, K., and Hutchinson, S., editors, Algorithmic Foundations of Robotics V, pages 275–291. Springer.

[Kless et al., 2013] Kless, J. E., Aftosmis, M. J., Ning, S. A., and Nemec, M. (2013). Inviscid analysis of extended-formation flight. AIAA Journal, 51(7):1703–1715.

[Klower et al., 2021] Klower, M., Allen, M., Lee, D., Proud, S., Gallagher, L., and Skowron, A. (2021). Quantifying aviation’s contribution to global warming. Environmental Research Letters, 16(10):104027.

[Lai et al., 2022] Lai, Y. Y., Christley, E., Kulanovic, A., Teng, C.-C., Bjorklund, A., Nordensvard, J., Karakaya, E., and Urban, F. (2022). Analysing the opportunities and challenges for mitigating the climate impact of aviation: A narrative review. Renewable and Sustainable Energy Reviews, 156:111972.

[Lee et al., 2009] Lee, D. S., Fahey, D. W., Forster, P. M., Newton, P. J., Wit, R. C., Lim, L. L., Owen, B., and Sausen, R. (2009). Aviation and global climate change in the 21st century. Atmospheric Environment, 43(22–23):3520–3537.

[Li et al., 2014] Li, X., Nair, P. B., Zhang, Z., Gao, L., and Gao, C. (2014). Aircraft robust trajectory optimization using nonintrusive polynomial chaos. Journal of Aircraft, 51(5):1592–1603.

[Lissaman and Shollenberger, 1970] Lissaman, P. B. S. and Shollenberger, C. A. (1970). Formation flight of birds. Science, 168(3934):1003–1005.

[Liu et al., 2019] Liu, C., Jiang, B., Patton, R. J., and Zhang, K. (2019). Integrated fault-tolerant control for close formation flight. IEEE Transactions on Aerospace and Electronic Systems, 56(2):839–852.

[Marks and Gollnick, 2016] Marks, T. and Gollnick, V. (2016). Influence of aircraft type and order on fuel savings gained by two aircraft formations. In Proceedings of the 30th Congress of the International Council of the Aeronautical Science, Deajeon, South Korea.

[Matsuno et al., 2015] Matsuno, Y., Tsuchiya, T., Wei, J., Hwang, I., and Matayoshi, N. (2015). Stochastic optimal control for aircraft conflict resolution under wind uncertainty. Aerospace Science and Technology, 43:77–88.

[Michel et al., 2020] Michel, D.-T., Dolfi-Bouteyre, A., Goular, D., Augere, B., Planchat, C., Fleury, D., Lombard, L., Valla, M., and Besson, C. (2020). Onboard wake vortex localization with a coherent 1.5 μm Doppler LiDAR for aircraft in formation flight configuration. Optics Express, 28(10):14374–14385.

[Murphy, 2012] Murphy, K. P. (2012). Machine learning: A probabilistic perspective. The MIT Press.

[Ning et al., 2011] Ning, A., Flanzer, T. C., and Kroo, I. M. (2011). Aerodynamic performance of extended formation flight. Journal of Aircraft, 48(3):855–865.

[Ning, 2011] Ning, S. A. (2011). Aircraft Drag Reduction Through Extended Formation Flight. PhD thesis, Stanford University, Standord, CA, USA.

[Patterson and Rao, 2014] Patterson, M. A. and Rao, A. V. (2014). GPOPS-II: A MATLAB software for solving multiple-phase optimal control problems using hp-adaptive Gaussian quadrature collocation methods and sparse nonlinear programming. ACM Transactions on Mathematical Software, 41(1):1–37.

[Prandini and Hu, 2009] Prandini, M. and Hu, J. (2009). Application of reachability analysis for stochastic hybrid systems to aircraft conflict prediction. IEEE Transactions on Automatic Control, 54(4):913–917.

[Rao et al., 2009] Rao, A. V., Benson, D., Huntington, G. T., Francolin, C., Darby, C. L., and Patterson, M. (2009). User’s Manual for GPOPS Version 2.1: A MATLAB Package for Dynamic Optimization Using the Gauss Pseudospectral Method.

[Rivas and Vazquez, 2016] Rivas, D. and Vazquez, R. (2016). Uncertainty. In Cook, A. and Rivas, D., editors, Complexity Science in Air Traffic Management. Routledge.

[Ross, 2020] Ross, I. (2020). Enhancements to the DIDO optimal control toolbox. arXiv preprint arXiv:2004.13112.

[Ross and Fahroo, 2004] Ross, I. M. and Fahroo, F. (2004). Pseudospectral knotting methods for solving optimal control problems. Journal of Guidance, Control, and Dynamics, 27(3):397–405.

[Saltelli et al., 2008] Saltelli, A., Ratto, M., Andres, T., Campolongo, F., Cariboni, J., Gatelli, D., Saisana, M., and Tarantola, S. (2008). Global Sensitivity Analysis. The Primer. John Wiley & Sons.

[Seo et al., 2017] Seo, J., Kim, Y., Kim, S., and Tsourdos, A. (2017). Collision avoidance strategies for unmanned aerial vehicles in formation flight. IEEE Transactions on Aerospace and Electronic Systems, 53(6):2718–2734.

[Shapiro, 2003] Shapiro, A. (2003). Monte Carlo Sampling Methods. In Ruszczynski, A. and Shapiro, A., editors, Stochastic Programming, volume 10 of Handbooks in Operations Research and Management Science, pages 353–425. Elsevier.

[Shone et al., 2021] Shone, R., Glazebrook, K., and Zografos, K. G. (2021). Applications of stochastic modeling in air traffic management: Methods, challenges and opportunities for solving air traffic problems under uncertainty. European Journal of Operational Research, 292:1–26.

[Slotnick, 2014] Slotnick, J. P. (2014). Computational aerodynamic analysis for the formation flight for aerodynamic benefit program. In Proceedings of the 52nd Aerospace Sciences Meeting, National Harbor, MD, USA.

[Sudret, 2008] Sudret, B. (2008). Global sensitivity analysis using polynomial chaos expansions. Reliability Engineering and System Safety, 93:964–979.

[Tierno et al., 2012] Tierno, M. Á. G., Cortés, M. P., and Márquez, C. P. (2012). Mecánica del vuelo. Ibergaceta.

[Torre et al., 2019] Torre, E., Marelli, S., Embrechts, P., and Sudret, B. (2019). A general framework for data-driven uncertainty quantification under complex input dependencies using vine copulas. Probabilistic Engineering Mechanics, 55:1–16.

[Trucchia et al., 2019] Trucchia, A., Egorova, V., Pagnini, G., and Rochoux, M. (2019). On the merits of sparse surrogates for global sensitivity analysis of multi-scale nonlinear problems: Application to turbulence and fire-spotting model in wildland fire simulators. Communications in Nonlinear Science and Numerical Simulation, 73:120–145.

[Tu et al., 2008] Tu, Y., Ball, M. O., and Jank, W. S. (2008). Estimating flight departure delay distributions—a statistical approach with long-term trend and short-term pattern. Journal of the American Statistical Association, 103(481):112–125.

[Vachon et al., 2002] Vachon, M. J., Ray, R., Walsh, K., and Ennix, K. (2002). F/A-18 aircraft performance benefits measured during the autonomous formation flight project. In Proceedings of the AIAA Atmospheric Flight Mechanics Conference and Exhibit, Monterey, CA, USA.

[Vechtel et al., 2018] Vechtel, D., Fischenberg, D., and Schwithal, J. (2018). Flight dynamics simulation of formation flight for energy saving using LES-generated wake flow fields. CEAS Aeronautical Journal, 9(4):735–746.

[Vieira et al., 2009] Vieira, M. R., Bakalov, P., and Tsotras, V. J. (2009). On-line discovery of flock patterns in spatio-temporal data. In Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, Seattle, WA, USA.

[Voskuijl, 2017] Voskuijl, M. (2017). Cruise range in formation flight. Journal of Aircraft, 54(6):2184–2191.

[Wachter and Biegler, 2006] Wachter, A. and Biegler, L. T. (2006). On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Mathematical programming, 106(1):25–57.

[Wei et al., 2008] Wei, S., Zěfran, M., and DeCarlo, R. A. (2008). Optimal control of robotic systems with logical constraints: Application to UAV path planning. In Proceedings of the 2008 IEEE International Conference on Robotics and Automation, Pasadena, CA, USA.

[Wieselsberger, 1914] Wieselsberger, C. (1914). Beitrag zur Erklärung des Winkelfluges einiger Zugvögel. Zeitschrift für Flugtechnik und Motorluftschiffahrt., 5:225–229.

[Xiu, 2010] Xiu, D. (2010). Numerical Methods for Stochastic Computations. A Spectral Method Approach. Princeton University Press.

[Xu et al., 2014] Xu, J., Ning, S. A., Bower, G., and Kroo, I. (2014). Aircraft route optimization for formation flight. Journal of Aircraft, 51(2):490–501.

[Zhu, 2019] Zhu, Y. (2019). Uncertain Optimal Control. Springer.