IMMUNE: Control Reallocation After Surface Failures Using Model Predictive Control
IMMUNE: Control Reallocation After Surface Failures Using Model Predictive Control
Abstract: This paper describes how to exploit the linear model predictive control with
quadratic programming to the well-known control surface reallocation problem once an actuator
failure has been detected and isolated. Theoretical developments assume here an overactuated
aircraft model, only submitted to input constraints. Implementation improvements are added
to allow real on-board applications. Simulations prove the efficiency of the algorithm for various
failure cases.
Actuator
Sensors
u y
split
A/C
law
Consider a complete linear aircraft model The objective is now to compute the inputs Û in order
to minimize the difference between the obtained outputs
(Asys , Bsys , Csys , 0)
Ŷ and the reference outputs YREF , for instance the turn
which includes the A/C states at a given flight condition behavior of the nominal aircraft without failure :
as well as the actuator and sensor dynamics. For on-board min J = kŶ − YREF k2 = k MÛ + Vx1 − YREF k2
computation, the linearization is realized every 10 s. This U
model is then discretized with a sampling time Tech using
which reduces to a quadratic programming problem for
the well known Tustin equations :
the inputs Û as follows :
A = eAsys Tech
B = A−1 Asys Tech min J = Û T MT MÛ + aT Û + d
sys e − I Bsys
aT = 2xT1 V T M − 2YREF
T
C = Csys M
avec T
d = (Vx1 − YREF ) (Vx1 − YREF )
leading to the following discrete time state space represen-
tation or recursive expression : The limititations of uk in both positions and rates given
xk+1 = Axk + Buk in the inequalities (2) are transformed into the following
sys : (1) expressions :
yk = Cxk
1
U ≤ Umax
The sampling frequency fech = is here 16 Hz.
U ≥ Umin
Tech
Afterwards we will denote uk (resp. yk ) the vector of the ∆Umax + U0 (4)
MVL . U ≤
20 deflections (resp. of the 11 outputs) values reached at
∆Umax − U0
the time step k.Tech .
| {z }
VVL
where Umax , Umin , U0 and ∆Umax are vectors of dimen- There is a compromise between the accuracy in following
sions (nuM P C Np × 1) : the reference signal YREF and the computation time.
umax umin u0
umax umin 0 4. APPLICATION
Umax = ... Umin = ... U0 = ...
The proposed algorithm is applied to several failure cases
umax umin 0 at various flight conditions (speed, mass and altitude) in
u̇max
the presence of uncertainties and external perturbations
u̇max like the wind for the IMMUNE model, see (Döll et al.,
∆Umax = Tech .
...
2010). It is first applied to cases where the nominal flight
control law works well in order to determine the best
u̇max compromise between the prediction horizon Np and the
interpolation horizon Ni as well as the number of control
It can be easily proven that the square matrix MVL of surfaces nuM P C which should be optimized. These cases
dimension (2 nuM P C Np × 2 nuM P C Np ) is equal to : are :
I 0 ... ... 0 • reconfiguration without failure using the spoilers in
.
−I I . . . . . . .. addition to the ailerons
VL
• reconfiguration after an aileron jammed at 0o using
MVL = with VL = 0 −I I . . . ...
−VL the remaining ailerons and spoilers
• reconfiguration after an aileron jammed at 40o using
. . . .
.. . . . . . . 0
the remaining ailerons and spoilers
0 . . . 0 −I I • reconfiguration after loss of efficiency of an aileron
Structural limitations for this aircraft are not known and The best compromise for the A/C real time application
were therefore not included into the cost function, but this is a prediction horizon Np of 50.Tech = 3.125s with an
approach accepts their potential inclusion as additional optimization every Ni = 0.625s. For accuracy reasons, all
output constraints (Gaulocher et al., 2007). 17 lateral control inputs are reallocated :
• the rudder,
Once Û is obtained, just the optimized control surface
• the 4 inner and outer left and right ailerons,
deflections u1 at k = 1 is then applied to the aircraft.
• and the 12 spoilers
For real time on-board application, the time-consuming
The reference signal Yref is here the nominal lateral
optimization is not realized at each time step, but only at
behavior without failure:
m = (Np − 1)/(Ni − 1) time steps (Ni is the interpolation
horizon.). More precisely, instead of computing Û directly, βref
pref
we search for
Yref = rref
u1
ϕ
ref
um+1 Ny,ref
Ûdownsampled = ...
17
aileron outer right
dp 17
LATER
Demux
17 17 aileron inner right
17
0 17 12
Lateral
dq spoiler 2
Terminator1
spoiler 3
spoiler 4
12
U(E)
U
12
dr spoiler 5
Selector
6 12 spoiler 6
1 Demux
12 12 Demux
12
spoiler 7
engine 1
spoiler 8
spoiler 9
22
1
spoiler 10
[0,1]->[0,45]
engine 2
spoiler 11
45 spoiler 12
elevator right
LONGI 3
3 stabilizer
Demux
3
elevator left
Switch1
longitudinal rudder
engine 1 (left)
engine 2 (right)
REFERENCES
Alwi, H. and Edwards, C. (2008). Fault tolerant control
using sliding modes with on-line control allocation.
Automatica, 44, 1859–1866.
Beck, R. (2002). Application of Control Allocation Methods
to Linear Systems with Four or More Objectives. Ph.D.
thesis, Faculty of the Virginia Polytechnic Institute and
State University.
Buffington, J. and Enn, D. (1996). Lyapunov stability
analysis of Daisy Chain control allocation. Journal of
Guidance, Control and Dynamics, 19(6), 1226–1230.
Döll, C., Hardier, G., Varga, A., and Kappenberger, C.
(2010). IMMUNE project : An overview. In 18th IFAC
Symposium on Automatic Control in Aerospace. Nara,
Japan.
Enns, D. (1998). Control allocation approaches. In Proc.
AIAA guidance, navigation, control conference, 98–108.