Conference PaperPDF Available

Dynamic programming for trajectory optimization of engine-out transportation aircraft

Authors:

Abstract and Figures

The purpose of this communication is to contribute to the development of a new trajectory management capability for an engine-out transportation aircraft. Engine-out is a dramatic situation for flight safety and this study focuses on the design of a management system for emergency trajectories at this special situation. First the gliding characteristics and flying qualities of a transport aircraft with total engine failure are analyzed while gliding range estimation is considered. Then a new representation of the flight dynamics of an engine-out aircraft is proposed where the space variable is chosen as independent parameter instead of the time variable. This allows to propose a new formulation of the corresponding trajectory optimization problem and to develop a reverse dynamic programming solution technique. Simulation results are displayed and new development perspectives are discussed.
Content may be subject to copyright.
Dynamic programming for trajectory optimization of
engine-out transportation aircraft
Hongying Wu, Nayibe Chio Cho, Hakim Bouadi, Lunlong Zhong, F´elix
Mora-Camino
To cite this version:
Hongying Wu, Nayibe Chio Cho, Hakim Bouadi, Lunlong Zhong, F´elix Mora-Camino. Dynamic
programming for trajectory optimization of engine-out transportation aircraft. CCDC 2012,
24th Chinese Control and Decision Conference, May 2012, Taiyuan, China. pp 98 -103, 2012,
<10.1109/CCDC.2012.6244015>.<hal-00938792>
HAL Id: hal-00938792
https://hal-enac.archives-ouvertes.fr/hal-00938792
Submitted on 19 Jun 2014
HAL is a multi-disciplinary open access
archive for the deposit and dissemination of sci-
entific research documents, whether they are pub-
lished or not. The documents may come from
teaching and research institutions in France or
abroad, or from public or private research centers.
L’archive ouverte pluridisciplinaire HAL, est
destin´ee au d´epˆot et `a la diffusion de documents
scientifiques de niveau recherche, publi´es ou non,
´emanant des ´etablissements d’enseignement et de
recherche fran¸cais ou ´etrangers, des laboratoires
publics ou priv´es.
1INTRODUCTION
The failure of engines is a dramatic event for air flight
safety and many incidents and accidents are resulting from
engine failure. Here an undesirable and very special case,
all engines out at a given point of the flight, is considered.
This situation may lead to a crash unless a flyable descent
trajectory towards a safe landing place is performed. There
are many different reasons for engine-out while it appears
that in this situation any wrong decision made by the pilots
may lead to catastrophic consequences.
So it looks quite desirable to develop an emergency
guidance mode for this situation. This new functionality
could be integrated in a Flight Management System which
should be able to select a proper landing site and propose a
feasible trajectory towards this site.
To achieve this purpose there are major steps which should
be performed: establish and analyze the flight dynamics of
an air transportation aircraft with total engine failure
(power off), study the gliding characteristics and flying
qualities of a transportation aircraft, develop a method to
establish safe reachable areas from a given situation and
finally develop a method to optimize a gliding trajectory
towards a possible safe landing place.
In this study, it is supposed that engine out occurs once the
aircraft has already gained some speed and altitude after
take-off.. Only glide of engine-out airplane in the vertical
plane is considered as a start.
2ENGINE OUT FLIGHT DYNAMICS
To establish and analyze the flight dynamics of an air
transportation aircraft with total engine failure (power off),
the classical equations of flight should be slightly adapted
to this particular case.
The aerodynamic forces (drag D, lift L, and side force Y)
are defined in terms of dynamic pressure, reference area
and dimensionless aerodynamic coefficients [1]:

aeD MCSVD ,,2/1 2
GDU
(1-1)

aeL MCSVL ,,2/1 2
GDU
(1-2)

arY MrpCSVY ,,,,2/1 2
GEU
(1-3)
Here V is the airspeed, ȡ is the air density (kg/m3), Į is the
angle of attack, e
G
is the elevator deflection, p is the aircraft
roll rate, r is the yaw rate and M is the current Mach
number, LD CC ,and Y
Care dimensionless aerodynamic
coefficients. CD and CL are supposed related by the polar
model 2
0'L
D
DCKCC where K is a constant.
It is considered that some hydraulic power remains
available to activate the elevators, ailerons and rudders
aerodynamic surfaces, so that dynamic stability as well as
attitude control can still be performed by the flight control
system. Indeed, many transport aircraft are equipped with
an deployable auxiliary turbine (RAM) which allows
insuring in the control channels of the aircraft the
availability of a residual hydraulic power. While the
additional drag generated by the RAM remains minor [2],
the extinction of the aircraft engines results in a noticeable
increase of the drag, while lift and side forces remain quite
the same. The drag coefficient is now given by:
Dynamic Programming for Trajectory Optimization of Engine-out
Transportation Aircraft
Hongying Wu, Nayibe Chio Cho, Hakim Bouadi*, Lunlong Zhong*, Felix Mora-Camino*
*LARA, ENAC, Toulouse 31055,France
E-mail: whyhgh@hotmail.com, hakimbouadi@yahoo.fr, lunlong.zhong@enac.fr, moracamino@hotmail.fr
#Programa de Ingeniería Mecatrónica, UnaB, Bucaramanga, Colombia
nchio@unab.edu.co
Abstract: The purpose of this communication is to contribute to the development of a new trajectory management
capability for an engine-out transportation aircraft. Engine-out is a dramatic situation for flight safety and this study
focuses on the design of a management system for emergency trajectories at this special situation. First the gliding
characteristics and flying qualities of a transport aircraft with total engine failure are analyzed while gliding range
estimation is considered. Then a new representation of the flight dynamics of an engine-out aircraft is proposed where
the space variable is chosen as independent parameter instead of the time variable. This allows to propose a new
formulation of the corresponding trajectory optimization problem and to develop a reverse dynamic programming
solution technique. Simulation results are displayed and new development perspectives are discussed.
Key Words: Flight Safety, Trajectory Optimization, Quasi Steady Glide, Reverse Dynamic Programming
98
978-1-4577-2074-1/12/$26.00 c
2012 IEEE

aDEaeDD MnCMCC ,,,
'
DGD
(2)
where CDE is the additional drag of a shut down engine, and
n is the number of engines of the aircraft.
The flight equations can be written as:
)sin),,((
1
JJTU
gmVD
m
V
(3-1)
)cos),,((
1
JJTUJ
gmVL
Vm
(3-2)
J
cosVx
(3-3)
J
sinVz
(3-4)
where
J
is the path angle,
T
is the pitch angle. Once fuel
dumping has been performed, the mass m of the aircraft is
considered to remain constant. Here x and z are
respectively the current longitudinal and vertical positions
of the aircraft center of gravity. Then, its height above Earth
is given by:
)( xHzh (4)
where )( xH is ground level at position x.
3ESTIMATION OF GLIDING RANGE
A first estimation of gliding range can be obtained by
considering that the aircraft remains in a quasi steady
gliding condition where air speed and path angle change
steadily according to current air density during the whole
descent.
Fig 1. Aircraft forces for quasi steady descent
In this situation the path angle is such as [3]:

)/()/1(arcsin gVf
J
(5)
or according to [4]:

¸
¹
·
¨
©
§
dz
dE
mgf T
//1
J
where 2
2
1VmzmgET (6)
is the aircraft total energy. Here f =L/D is the lift to drag ratio.
According to equation (5), a “minimum” glide angle, max
J
,
is achieved with a maximum lift to drag ratio. Since mgL |,
this corresponds to a minimum drag. Then it can be shown
that:
)'2/1 0
max KC D
J
(7-1)
)'2()2()(
2
1
0
'
0
2
min DD CQCVzD
U
(7-2)
A first approximation to the maximum range to sea level is
then given by:
0
00 '2 D
aCKzR (8)
where z0 is the initial altitude. Now, considering the above
expression of min
D, we get:

0
'/)(/2)( D
CKSzmgzV
U
(9)
Then the air speed decreases during the quasi static glide
descent. For a wide body aircraft, from cruise level, about 8
m/s are lost for a quasi steady initial descent of 1000 m. A
stall constraint can be considered to check the feasibility of
the glide maneuver:

max
)(/2)()( Lstall CSzmgzVzV
U
! (10-1)
or
max0 /1'/ LD CCK ! (10-2)
This condition is a general aerodynamic condition for
gliding feasibility of a given aircraft under a specific
aerodynamic situation. Also, the expression of Dmin shows
that dynamic pressure remains constant during the quasi
static glide . Figure 2. displays the airspeed and stall speed
during steady descent.
Fig 2. Airspeed during steady gliding
Then a relation between the quasi static glide path angle
and the altitude can be introduced and the “minimum” glide
path angle is given by:

)/(
0000
0
max
0
/
1
'2
tan
Rag
D
TzaTP
Q
KC
|
JJ
(11)
where air density in standard atmosphere can be expressed
as z
RT
g
ez
0
)(
UU
with zaTzT 00
)( ,KT q 15.288
0,
mKa /105.6 3
0qu ,KsmR q 22 /287 ,3
0/2250.1 mkg
U
.
Then this angle increases while the altitude is decreasing
during the quasi steady glide, shown in Figure 3. The
maximum flight range Ra is then more accurately
determined by:
¸
¸
¸
¹
·
¨
¨
¨
©
§
¸
¸
¹
·
¨
¨
©
§
³
11
1
'2
'2
tan
1
1
0
0
0
0
0
00
00
0
0
0
Ra
g
D
D
z
a
z
T
a
Rag
RT
PSC
mg
CKzdzR
J
(12)
This is illustrated in Figure 4. If the aircraft loses engine
power at a higher altitude, it can glide over an increased
2012 24th Chinese Control and Decision Conference (CCDC) 99
range. In the case of the accident occurred on 24/08/2001,
the A330 aircraft glided for 120 km.
With this information, the reachable landing site can be
determined according to some flight planner [5], [6].
Fig 3. ‘– tan Ȗ ’ during quasi steady gliding
Fig. 4 Reachable range for quasi steady glide.
4GLIDE TRAJECTORY OPTIMIZATION
FOR SAFETY
In this section the problem of managing the trajectory of a
transportation aircraft gliding from a given initial flight
situation is considered. Contrarily to the classical max
range gliding problem, by the end of the gliding maneuver,
the aircraft must be in conditions (speed and attitude) to
perform a safe touch down at landing. In this case, the flight
guidance equations written in the aircraft wind axis are
given by equation (3).
Observe the equations that the only independent input
parameter which is available here is the pitch angle,
T
,
which can, even in an engine-out situation, be controlled by
the pilot either through the hydraulic power provided by the
RAT or the auxiliary power unit-APU, or through the trim
control channel.
Here the initial flight conditions are written as:
0000 )0(,)0(,)0(,)0(
JJ
VVhhxx (13)
while the final landing conditions are such as:
11 )(,)()),(()(
fffGf tVtVtxhth (14)
where V1 and 1
J
should allow a safe landing at altitude
))(( fG txh where function hG is representative of the ground
topography under the considered flight area.
Since final time is unknown and is only characterized by
the satisfaction of the final conditions, the replacement of
independent parameter t by the space variable x allows to
diminish the complexity of the problem since now final xf
is known once the landing site has been chosen. Moreover,
this approach should facilitate the consideration of ground
separation constraints and could make easier the
consideration of the effect of wind over the glide trajectory.
From equations (3) with :
)cos/(1/
J
Vdxdt (15)
we get:
)316()cos),,((
cos
1
)216()sin),,((
cos
1
)116(
2
c
c
c
JJTU
J
J
JJTU
J
J
gmVL
Vm
gmVD
Vm
V
tgz
where “ ’ ” represent the derivative with respect to the
longitudinal position x of the aircraft. The additional instant
constraints are:
],[],,[)()( 00min ff zzzxxxzVxV t (17-1)
^`^ `
)(,min)()(,max maxmax
min
min xxx
JDTTJDT
dd (17-2)
],[)()( 0fG xxxxhxz t (17-3)
Constraints (17-1) and (17-2) prevent from stalling and
constraint (17-3) from some flight into terrain-FIT situation
at an intermediary point of the glide.
Then, different formulations of an optimization problem [7]
can be considered to design a safe glide trajectory. For
example the following criterion could be minimized with
respect to the successive values of
T
along the glide:
2
))()((min fGf xhxh (18)
under final constraints
)1()()1( max1min1 vVxVvV fdd (19-1)
)1()()1( max1min1 gxg fdd
J
J
J
(19-2)
where minmaxmin ,, gvv and max
gare positive margins and
with state equations (16), flight constraints (17) and initial
conditions (13).
The solution of this non linear, strongly constrained
trajectory optimization problem is difficult from the
numerical point of view and a direct on line computation of
its solution does not appear to be feasible. For instance, an
approach based on the minimum principle [8] should result
in a very difficult two point boundary problem since the
resulting Hamiltonian has not an affine structure with
100 2012 24th Chinese Control and Decision Conference (CCDC)
respect to the input parameter. Many other complex
techniques have been developed for trajectory generation
[9], [10], [11] while Dynamic Programming [12] appears to
provide some good perspectives [13],[14]. To apply
effectively a Dynamic Programming solution strategy, a
discretization of this problem appears necessary and the
choice of the space variable x as independent variables for
the flight equations appears most convenient.
5THE PROPOSED SOLUTION STRATEGY
Here dynamic programming is used to generate a feasible
glide trajectory towards a safe landing place. To insure the
satisfaction of the final landing configuration given by the
quality constraints (14), which is a more critical condition,
a reverse approach is adopted. Then the gliding trajectory is
computed backward from these final conditions through the
feasible glide set defined by constraints (17) and the space
discretized state equations (16). With the objective of
getting a smooth flyable trajectory which avoids wasting
unnecessarily the remaining hydraulic energy used to
control the aerodynamic actuators (elevator, THS, flaps and
aero brakes) along the engine-out glide trajectory, a new
optimization criterion is adopted here. This surrogate
criteria allows penalizing large variations on pitch attitude
angle, descent path angle, speed and flight level, so that its
evaluation along a feasible path i
k
Pleading to state iat stage
k is given by a formula such as:
)( Ts
s
Es
s
s
s
Ps
i
kEC T
i
k
''' ¦
OJOTO JT
(20)
Here ss
JT
OO
,and s
ET
O
are positive weights whose values
change with the distance to the landing site.
Dynamic programming, either direct or reverse, considers
at each stage different feasible states and selects for each of
them the best path leading to them from the initial state at
the first stage of the search process. Under a given value of
input parameter i
s
T
at stage s, backwards integration is
used to assess the additional cost involved in going from
state (s,i) to a new feasible state at the next stage of the
search process.
However, whatever the size of the discrete steps adopted to
perform this reverse search process, from one stage to
another, a large number of new states should be generated
to guarantee the accuracy of the resulting solution. This
leads to an explosive number of solutions to be considered
when the stage order increases. So the explosion of the
points must be avoided to insure the computer processes the
problem. After each backward integrating, many points
should be cut by using the dynamic programming principle.
Here, to alleviate this foreseeable computational burden, a
heuristic melting procedure is developed where closer
states to a central state of the current stage in the search
process are deleted while this central state is maintained.
The distance ij
s
' between two states i and j of stage s which
has been adopted to generate these clusters within one stage
is given by:
2
max
2
2
max
2
2
max
2)()()(
J
JJ
OOO J
j
s
i
s
j
s
i
s
z
j
s
i
s
V
ij
sz
zz
V
VV
' (21)
Here a two level weighting has been adopted:
maxmax,zV and max
J
are scaling parameters and zV
OO
,and
J
O
with 1
J
O
O
O
zV are positive relative weightings.
The above approach which has been developed is basically
an open loop approach and requires a very large
computational effort which is unlikely to be performed on
board an aircraft which is already in a critical engine-out
situation. Our proposal here, which should be developed in
the near future is to take profit of the amount of data
generated by the reverse dynamic programming search
process, considering different situations and parameters
such as aircraft initial flight level, altitude and mass, to train
a neural network devise designed to generate pitch angle
directives at each point along the descent so that the glide
trajectory leads safely to the landing situation. Here the
computational burden associated with reverse dynamic
programming is taken into profit to generate the training
data base for the neural network [15].
The generated pitch angle directives can be either sent to
the autopilot when it is still operating or to a flight director.
In that last case this will allow this maneuver to be
performed efficiently in manual mode by the pilot. Observe
that along the glide trajectory, each new solicitation of the
neural network will generate new piloting directives in
accordance with the current situation of the aircraft which
is also the result of external perturbations such as wind.
6SIMULATION RESULTS
A simulation study has been performed using the RCAM
wide body transportation aircraft model [16]. Then
considering the case in which an engine failure occurs
150km away from a possible landing site, different glide
trajectories obtained by reverse dynamic programming are
displayed on Figures 5. and on Figure 6 according to
different initial situations.
It appears that if the aircraft has a large initial total energy,
which means high speed and/or high altitude, the resulting
glide trajectory is not be very smooth: the speed and
altitude are subject to large and rapid changes so that the
aircraft loses energy in excess sufficiently quickly to arrive
to the landing site with acceptable flying parameters. When
initial total energy is not too much excessive, the resulting
glide trajectories result to be smoother.
For example, for initial conditions with an Figure 7. and
Figure 8. display an optimized glide trajectory in the case
in which initial altitude is 10km (FL330) and initial
airspeed is 200m/s (about 400 knot) .
Figure 9. and Figure 10. display the landing range which
can be reached safely by an aircraft whose initial glide
conditions are an altitude of 10km and an airspeed of
2012 24th Chinese Control and Decision Conference (CCDC) 101
180m/s (about 360 knot). The largest obtained glide range
is about 137 km while the shortest obtained glide range is
116 km. Then in that case, the gliding aircraft can reach
safely landing sites located between 116km and 137km
away. Observe on these figures that, the shorter the range,
the rougher is the trajectory. Comparing figures 7. and
Figure 9. , it appears also that with a higher initial airspeed
the gliding aircraft range is also higher.
These numerical results indicate that reverse dynamic
programming can be used to solve the glide trajectory
generation problem and contribute to the design of a glide
trajectory generator either off line or on line.
Fig 5. Optimal glide trajectories with different initial speeds
3-dimensional representation
Fig. 6 Optimal glide trajectories in vertical plane with different
initial altitudes
Fig 7. A smooth optimal glide trajectory in 3-D
Fig 8. A smooth optimal glide trajectory in vertical plane
Fig 9. Trajectories of aircraft in vertical plane with different
landing ranges, 3D view
Fig 10. Trajectories of aircraft in vertical plane with different
landing ranges
102 2012 24th Chinese Control and Decision Conference (CCDC)
7CONCLUSION
The purpose of this communication has been to present the
first results of a study turned towards the design of an
emergency management system able to cope with an
engine-out situation for a transportation aircraft. The main
contributions of this communication are:
- a review of the quasi steady glide range for a
transport aircraft;
-the proposal of a new representation of the flight
dynamics of a gliding aircraft with the
introduction of a spatial dimension as
independent variable;
-the development of a solution strategy based on
backwards integration and reverse dynamic
programming whose feasibility is supported by the
displayed simulation results.
This work should be completed by the integration of lateral
maneuvers and the consideration of the effect of wind over
the glide trajectory. This last point could be tackled by the
development of an adaptive approach based on the online
estimation of wind and the use of a neural machine to
generate control directives on a reactive basis. This remains
for further studies.
REFERENCES
[1] Robert C. Nelson, Flight Stability and Automatic Control,
McGraw-Hill Book Company, US 1989.
[2] Zhiyou Liu, Minjie Hou, Gang Wen, Experimental
Determination of Aero-Engine Windmilling Drag, Journal of
Aerospace Power, Vol.21, No. 2, 2006.
[3] Nguyen X. Vinh, Flight Mechanics of High-Performance
Aircraft, Cambridge University Press, UK, 1993.
[4] Hongying Wu, Management of Emergency Trajectory for
Transport Aircraft, MSc Repport, ENAC, Toulouse,
September 2010.
[5] Ella M. Atkins, Igor Alonso Portillo, Matthew J. Strube,
Emergency Flight Planning Applied to Total Loss of Thrust.
Journal of Aircraft, Vol.43, No. 4, 1205-1216, 2006.
[6] Ryan Rapetti, Sarigul-Klijn, A 3-phase safe trajectory
shaping for a distressed aircraft, IEEE Aerospace
Conference, USA, 2010.
[7] John T. Betts, Survey of Numerical Methods for Trajectory
Optimization, Journal of Guidance, Control, and
Dynamics,Vol.21, No.2, 193-207, 1998.
[8] S. Khan, Flight Trajectory Optimization, Toronto, ICAS
2002.
[9] Nesrin Sarigul-Klijn,, R. Rapetti, A. Jordan, I. Lopez, M.
Sarigul-Klijn, P. Nespeca, Intelligent Flight-Trajectory
Generation to Maximize Safe-Outcome Probability After a
Distress Event. Journal of Aircraft, Vol.47, No. 1, 255-267,
2010.
[10] B. Ouattara, F. Mora-Camino , Trajectory Generation for
Relative Guidance of Merging Aircraft , in Optimization and
Cooperative Control Strategies , M. Hirsch editor, Lecture
Notes in Control and Information Sciences Series, Springer
Berlin, 2008.
[11] F.J. Vormer, M. Mulder, M.M. van Paassen, J.A. Mulder,
Optimization of Flexible Approach Trajectories Using a
Genetic Algorithm, Journal of Aircraft, Vol.43, No.4,
941-952, 2006.
[12] D. Bertsekas, Dynamic Programming and Optimal Control,
Athena Scientific, 2007.
[13] P. Hagelauer and F. Mora-Camino, Evaluation of Practical
Solutions for Onboard Aircraft Four Dimensional Guidance,
AIAA Journal of Guidance, Control and Dynamics
20(5),1052-1054, 1997.
[14] P. Hagelauer and F. Mora-Camino, A Soft Programming
Approach for On-line Aircraft 4-D Trajectory Optimization,
European Journal of Operations Research, 87-95, 1998.
[15] Francelin, R.A., F.A.C. Gomide, “A Neural Network for
n-stage Optimal Control Problems,” Proc. IEEE Int. Conf.
Neural Networks - ICNN’94, Vol. 7, pp. 4508-4513,
Orlando-FL, USA (1994).
[16] P. Lambrechts, S. Bennani, G. Looye and D. Moormann, The RCAM
Design Challenge Problem Description in Robust Flight Control, J.F.
Magni, S. Bennani and J. Terlouw editors, Lecture Notes in Control
and Information Sciences 224, Springer, 1997.
2012 24th Chinese Control and Decision Conference (CCDC) 103
... Due to various controversies, the idea of aerial gliding vehicles (GVs) has evolved and matured over the time. Developments in the aviation industry led to the creation of both powered and unpowered GVs, where an unpowered GV relies on the dynamic interaction of the air with its wings and tail for gliding, and the velocity regime determines whether an unpowered GV is subsonic, transonic, supersonic, or hypersonic [1][2][3][4]. Nowadays, to convert a general purpose bomb (MK series) to a subsonic unpowered GV (SUGV), a wing adaptation kit or range extension kit is installed [5,6]. Figure 1 displays a further illustration of an SUGV known as the joint stand-off weapon (JSOW) [7]. ...
Article
Full-text available
In many aero gliding vehicles, achieving the maximum gliding range is a challenging task. A frequent example is the breakdown of an engine during flight or the use of unpowered stand-off weapons. When an unpowered stand-off weapon begins gliding at a given height, it eventually strikes the ground after some distance, and height is considered a stopping constraint in this general condition. To avoid the time-scaling approach for the free time optimal problem, the maximum stoppable time with a stopping constraint is addressed to attain the maximum glide range. This problem can be chosen as an optimal gliding range problem which can be solved by direct or indirect methods. In this paper, the inverted Y-tail joint stand-off weapon is selected as the subsonic unpowered gliding vehicle (SUGV). After being released from dispersion points, the SUGV has to face fluctuating gliding flight because of flight phase transition that causes gliding range reduction. To achieve a damped and steady gliding flight while maximizing the gliding range, we propose a non-uniform control vector parameterization (CVP) approach that uses the notion of exponential spacing for the time vector. When compared with the maximum step input and conventional uniform CVP approach, simulations of the proposed non-uniform CVP approach demonstrate that the SUGV exhibits superior damping and steady gliding flight, with a maximum gliding range of 121.278 km and a maximum horizontal range of 120.856 km.
... Helton J, Nie J applied the SDP to solve the trajectory optimization and optimal control problems. Hongying W, Nayibe Chio C, Bouadi H, Lunlong Z, Mora-Camino F [2] proposed a reverse DP based on the Bellman's principle solution technique to develop a new trajectory management capability for an engineout transportation aircraft. Colombo C, Vasile M, Radice G; Aziz J D, Parker J S, Scheeres D J and Englander J A applied the DDP method to calculate the rendezvous trajectory to near-Earth objects and solve the optimal problem relatively. ...
Article
Full-text available
This work aims to review the proposed trajectory optimization algorithms and their applications in solving flight trajectory planning and optimal control problems. Beside the classification of trajectory optimization algorithms listed in Chai R, Savvaris A, Tsourdos A and Chai S such as the deterministic; the stochastic; and the multi-objective algorithms, this work adds in reviewing the effective and frequently-used approach for solving optimal problems— the hybrid/combined methods. The results of related works show that this hybrid approach is effective and can provide feasible solutions for solving the flight vehicle trajectory optimal design and control problems.
... Wu et al. (2012) studies an application on emergency flight, in which the gliding trajectory of a commercial aircraft under engine failure must be optimised. The objective was finding a flyable descent trajectory for the aircraft in order to achieve a safe landing with certain speed and flight attitude.Crispin (2016) proposes the use of balloon launched autonomous gliders for atmospheric research. ...
Thesis
In recent years, employing Unmanned Aerial Vehicles (UAV) to collect data and making measurements has gained popularity. Often, the use of UAVs allows for a reduction in costs and improvements of other performance criteria. The academic routing community has acknowledged the interest of companies and organisations in adopting UAVs in their operations. However, constraints due to the flight dynamics of UAVs have often been neglected. Finding feasible trajectories for UAVs in a routing problem is a complex task, but it is necessary to ensure the feasibility of the routes. In this thesis we introduce the Unmanned Aerial Vehicle Routing and Trajectory Optimisation Problem (UAVRTOP), the problem of optimising the routes and trajectories of a fleet of UAVs subject to flight dynamics constraints. Motivated by a disaster assessment application, we propose a variant of the UAVRTOP, in which a fleet of autonomous aerial gliders is required to photograph a set of points of interest in the aftermath of a disaster. This problem is referred to as the Glider Routing and Trajectory Optimisation Problem (GRTOP). In this work, we propose a single-phase Mixed-Integer Non-linear Programming (MINLP) formulation for the GRTOP. Our formulation simultaneously optimises routes and the flight trajectories along these routes while the flight dynamics of the gliders are modelled as ordinary differential equations. We avoid dealing with non-convex dynamical constraints by linearising the gliders’ Equations of Motion (EOMs), reducing the proposed MINLP into a Mixed-Integer Second-Order Cone Programming (MISOCP) problem. Another contribution of this work consists of proposing a multi-phase MINLP formulation for a modified version of the GRTOP. We do not attempt to solve this formulation directly, instead we propose a hybrid heuristic method that is composed of two main building blocks: (i) a Sequential Trajectory Optimisation (STO) heuristic, designed to cope with the challenging task of finding feasible (flyable) trajectories for a given route; and (ii) a routing matheuristic, capable of generating routes that can be evaluated by STO. We perform computational experiments with real-life instances based on flood risk maps of cities in the UK as well as in a large number of randomly generated instances.
Chapter
When encountering atmospheric or exo-atmospheric spacecraft flight, a well-designed trajectory is essential for making the flight stable and enhancing the guidance and control of the vehicle. Much research has focused on how to design suitable spacecraft trajectories available for various mission profiles. To optimize the flight trajectory, researchers have designed numerous useful tools successfully. Nevertheless, it is only in the last five years that the interest in how to plan flight trajectories and consider numerous mission goals and different model errors/uncertainties simultaneously has grown greatly. Note that for various practical guidance, navigation and control systems for spacecraft, during the trajectory planning process, the frequent consideration of multiple performance indices and various forms of uncertainty is necessary. Consequently, the multi-objective spacecraft trajectory optimization methods and stochastic spacecraft trajectory optimization algorithms are successfully proposed with the help of the requirements mentioned above. The core aim of this chapter is to provide a wide overview of current developments in numerical multi-objective trajectory optimization algorithms and stochastic trajectory planning approaches for spacecraft flight operations. First, we will briefly describe the process of how the problem is formulated mathematically. Then several optimization strategies for addressing spacecraft trajectory planning problems, such as gradient-based methods, convexification-based methods, and evolutionary/metaheuristic methods, are discussed. Besides, we will overview the formulation process of the multi-objective spacecraft trajectory optimization problem, as well as multiple types of multi-objective optimization algorithms. The significant features, for example, the merits and demerits of the newly-proposed multi-objective approaches, are summarized. Furthermore, we will pay some attention to the extension of the original deterministic problem to a stochastic form. To handle the stochastic trajectory planning formulation, several robust optimization algorithms are also outlined. Additionally, applications of the optimized trajectory proposed recently will be especially focused on. Finally, we will draw some conclusions and discuss further research about strategies for multi-objective and stochastic trajectory optimization.
Chapter
This chapter aims to broadly review the state-of-the-art development in spacecraft trajectory optimization problems and optimal control methods. Specifically, the main focus will be on the recently proposed optimization methods that have been utilized in constrained trajectory optimization problems and multi-objective trajectory optimization problems. An overview regarding the development of optimal control methods is first introduced. Following that, various optimization methods that can be effective for solving spacecraft trajectory planning problems are reviewed, including the gradient-based methods, the convexification-based methods, the evolutionary/metaheuristic methods, and the dynamic programming-based methods. In addition, a special focus will be given on the recent applications of the optimized trajectory. Finally, the multi-objective spacecraft trajectory optimization problem, together with different classes of multi-objective optimization algorithms, is briefly outlined at the end of the chapter.
Article
For most atmospheric or exo-atmospheric spacecraft flight scenarios, a well-designed trajectory is usually a key for stable flight and for improved guidance and control of the vehicle. Although extensive research work has been carried out on the design of spacecraft trajectories for different mission profiles and many effective tools were successfully developed for optimizing the flight path, it is only in the recent five years that there has been a growing interest in planning the flight trajectories with the consideration of multiple mission objectives and various model errors/uncertainties. It is worth noting that in many practical spacecraft guidance, navigation and control systems, multiple performance indices and different types of uncertainties must frequently be considered during the path planning phase. As a result, these requirements bring the development of multi-objective spacecraft trajectory optimization methods as well as stochastic spacecraft trajectory optimization algorithms. This paper aims to broadly review the state-of-the-art development in numerical multi-objective trajectory optimization algorithms and stochastic trajectory planning techniques for spacecraft flight operations. A brief description of the mathematical formulation of the problem is firstly introduced. Following that, various optimization methods that can be effective for solving spacecraft trajectory planning problems are reviewed, including the gradient-based methods, the convexification-based methods, and the evolutionary/metaheuristic methods. The multi-objective spacecraft trajectory optimization formulation, together with different class of multi-objective optimization algorithms, is then overviewed. The key features such as the advantages and disadvantages of these recently-developed multi-objective techniques are summarised. Moreover, attentions are given to extend the original deterministic problem to a stochastic version. Some robust optimization strategies are also outlined to deal with the stochastic trajectory planning formulation. In addition, a special focus will be given on the recent applications of the optimized trajectory. Finally, some conclusions are drawn and future research on the development of multi-objective and stochastic trajectory optimization techniques is discussed.
Article
This paper proposes an optimal control framework for the climb and descent economy modes of a flight management system (FMS) yielding a solution that can be implemented in real-time flights below the drag divergence Mach number. The problem is formulated as the optimization of a functional that trades off the fuel- and time-related costs of a flight as a function of a (crew-supplied) parameter called the cost index. The work builds on previous research of the authors for the cruise phase and extends it to the climb and descent phases of flight. More specifically, for both climb and descent, it is found that suboptimal solutions can be obtained as the positive real roots of a fifth-degree polynomial lying inside the flight envelope, which can be found using fast-converging algorithms such as Newton's method. The main contributions of this work are threefold. First, the proposed method gives physical insight because there is an analytical expression for each coefficient of the polynomial. Second, this approach eliminates the need to have a performance database in the system, thus making its implementation faster in real-time. Third, the solution exhibits the same behavior of airborne FMS units as a function of the cost index, which is justified in this paper based on Bellman's principle of optimality. This justification is an important theoretical contribution of the paper. A validation of the approximate solution is obtained using the shooting method to compute the optimal trajectories and compare them against the proposed suboptimal solution. Simulation results show that, for an Airbus A320 model and for a Gulfstream-IV aircraft model, the relative error of the suboptimal trajectories when compared to the optimal trajectories is small for climb and descent trajectories, respectively.
Article
Engine-out is an undoubted critical situation for flight safety. The objective of this thesis is to improve the management of emergency manoeuvres for transportation aircraft once all engines go out at a given point during the flight. Here we consider the evolution of the gliding aircraft along a vertical plane possibly leading directly to a safe landing place. The gliding qualities of standard transportation aircraft are first analyzed and reachable areas from given initial situations are established. Once a safe reachable area exists the problem which is tackled here is to develop design principles for a guidance system which makes the aircraft perform a feasible glide trajectory towards such landing area. Reverse dynamic programming is used to build backwards sets of feasible trajectories leading to final conditions compatible with engine-out landing. To get an on-line device to produce efficient directives for the autopilot or the human pilot (through a flight director), a neural network is built from the generated database. Then simulation results are analyzed for validation and further improvements of the proposed approach are considered
Conference Paper
The purpose of this communication is to contribute to the development of an emergency trajectory management capability for an engine-out transportation aircraft. First a representation of the flight dynamics of an engine-out aircraft is proposed where the space variable is chosen as independent parameter instead of the time variable. This allows to propose a spatial formulation of the corresponding trajectory optimization problem and to develop a reverse dynamic programming solution technique which generates data for the training of a neural network whose function is to generate feasible and safe reference values for the vertical guidance of the gliding aircraft. Simulation results are displayed and new development perspectives are discussed. © 2012 by the American Institute of Aeronautics and Astronautics, Inc. All rights reserved.
Conference Paper
Aircraft total failure of engines or engine-out, is a dramatic situation which may end by a crash unless a flyable descent trajectory towards a safe landing place is adopted. Although it is now a rare event, there are many different reasons for engine-out. Since with engine-out any wrong decision taken by the pilot may lead to catastrophic consequences, it appears useful to develop an automatic emergency guidance mode for this situation. This new functionality could be integrated in a Flight Guidance System which should be able to select a proper landing site while proposing tactical decisions to fly a feasible trajectory towards this site. In this study, a proposal for the design of such guidance system is developed. First, considering space-indexed glide dynamics for a transportation aircraft, reverse dynamic programming is used to generate, starting from safe landing conditions, a full safe glide domain up to cruise conditions and composed of quasi steady trajectories. Then a neural network structure is designed to produce for any glide situation within the safe glide domain, a reference pitch angle proposed to the pilot in manual mode. Total energy is then considered to distinguish between over range, on range and out of range glide situations and provide directives for the use of airbrakes when necessary. Finally, a tentative integration of the produced information within the primary flight display is proposed. Numerical simulations are performed using data from a wide body transportation aircraft.
Article
Full-text available
Current air traffic management in the terminal area is based on published sets of standard routes. However, a new procedure called the continuous descent approach has been recently proposed to decrease noise disturbances. To allow increased use of continuous descents and simultaneously increase performance in terms of other important aspects such as throughput, it may be beneficial to replace the predetermined fixed approach trajectories with more flexible trajectories instead. This is studied through optimizing approach trajectories, for which a genetic algorithm is used. Analyses show that allowing more flexibility in the approach routes can increase throughput, enable scheduling trajectories closer to continuous descent approaches, and result in routing flights less often over residential areas. However, it is also shown that flexible approach trajectories may increase airspace complexity, which in effect may make the task of air traffic control more complicated.
Article
Full-text available
Autopilot systems are capable of reliably following flight plans under normal circumstances, but even the most advanced flight-management systems cannot provide robust response to most anomalous events including in-flight failures. This paper describes an emergency flight-management architecture that can be applied to piloted or autonomous aircraft, with focus on the design and implementation of an adaptive flight planner (AFP) that dynamically adjusts its model to compute feasible flight plans in response to events that degrade aircraft performance. A two-step landing-site selection/trajectory generation process defines safe emergency plans in real time for situations that require landing at an alternate airport. A constraint-based search algorithm selects and prioritizes feasible emergency landing sites, then the AFP synthesizes a segmented trajectory to the best site based on postfailure flight dynamics. The AFP architecture is general for any failure situation; however, operational success is guaranteed only with accurate postfailure performance characterization and a trajectory generation strategy that respects degraded flight envelope boundaries. A real-time segmented trajectory planning algorithm and case study results are presented for total loss of thrust failure scenarios. This emergency is surprisingly common and necessitates an immediate approach and landing without a go-around option.
Article
System optimization is a process of translating the dynamics of a system and its desired objectives into the mathematical language, which give rise to what is called a control problem and then to find the solution of this problem. Such a solution is called optimal control and the path it follows to achieve the desired objectives is called optimal trajectory. Trajectory optimization is an optimal transfer problem. For any specified end condition and performance index, the problem of determining the optimal trajectory in powered flight of an aircraft in atmospheric conditions, subject to certain physical constraints, is very complex problem. In general it cannot be solved without using numerical computation based on a specified model of the atmosphere and aircraft aerodynamic and engine characteristics. In the past an intensive research has been carried out in the area of system optimization and optimal trajectories. In the work presented in this paper, emphasis is made on generalization of the optimal trajectories of aircraft, the basic ingredients of the optimization problem and formulating the precise statement of the optimization problem. The definition of optimal control problem, formulation of a control problem and solution of such a control problem are presented. Different optimization techniques are discussed and compared to show their merits and limitations. The optimal trajectories in different phases of flight, i.e. trajectories in horizontal plane, vertical climb trajectories, are analyzed using the Pontryagin's Maximum Principle.
Article
The theoretical analysis of the time constrained cruise optimization problem showed that existing solutions are based on two main assumptions. The first one to be considered is that the optimal speed profile can be approximated by a constant-CI-speed profile. The second is to consider that the altitude profile is frozen when a time constraint is introduced. A DP-based approach showed that the optimization of the altitude-shift points can lead to additional fuel savings of several percent for particular time constraints. The constant-CI assumption, on the other hand, seems to be valid because the speed profiles generated by both approaches on identical altitude profiles lead to similar total fuel burn.
Article
A flight trajectory generation method called the distressed-aircraft-recovery technique for maximum safe-outcome probability (DART_MSOP), based oil integration of three new algorithms, is developed that maximizes safe-outcome probability after a distress event by incorporating all abort airport together with a model of current aircraft dynamics. Several abort-probability models are studied under various constraints. The first new algorithm, a statistical-based initial-turn-determination algorithm, is developed to advise pilots to a reachable best landing site immediately after the distress event and before using the second new algorithm, a high-fidelity flight trajectory generation algorithm. A third new algorithm determines the flight maneuver for guidance of a perpetual-turning-attitude aircraft to fly the trajectory generated by the second algorithm. The third algorithm is only used if the aircraft has stuck controls or a similar malfunction that generates a nonzero amount of bank angle and causes the aircraft to turn only in one direction. As a three-dimensional high-fidelity algorithm, the second algorithm considers the probability of an abort to increase overall survivability by minimizing expected flight-path length as it shapes the trajectory. The performance of this new intelligent flight trajectory determination method DART_MSOP is evaluated using a case study based on a hypothetical in-flight distressed transport aircraft in northern California. Numerical simulations include variable failure rates to simulate different in-flight distress conditions, and multiple fixes along the path to accommodate realistic trajectories. DART-MSOP intelligent flight trajectory determination method should increase aviation safety if these algorithms are implemented in aircraft avionics systems.
Article
A statistical flight plan optimization framework is developed, and a simplified version solved for a hypothetical distress situation. The framework proposed herein attempts to increase overall survivability by evaluating and optimizing the probable outcome of various flight plans, given a statistical representation of the probable outcomes of each flight plan and their respective probabilities of success. This work attempts to solve the problem using a simplified probability model and safety metric. An airport grouping strategy that groups the airports prior to path derivation is also developed to identify the convex sub problems of the non convex, continuous-discrete overall problem. The performance of this newly developed probabilistic trajectory algorithm is evaluated using numerical simulations which include variable failure rates to simulate different in-flight distress conditions, and multiple turns to accommodate realistic trajectories. The results show that it is possible to increase aircraft survivability by using this algorithm.