Documente Academic
Documente Profesional
Documente Cultură
Gain-Switching
Alessandro Giua, Carla Seatzu, Giampaolo Usai,
Dip. di Ingegneria Elettrica ed Elettronica, Universita di Cagliari,
Piazza d'Armi | 09123 Cagliari, Italy
Phone: +39-70-675.58.53 { Fax: +39-70-675.59.00 { Email: fgiua,seatzu,gusaig@diee.unica.it.
Abstract x4
M2,J2
x8
In this paper we realize the design of an active{passive x3
suspension system for the axletree of a road vehicle u1 f f u2
x7
based on a linear model with four degrees of freedom. K K
The optimal control law we propose aims to optimize the x2 Kb x6
suspension performance while ensuring that the magni-
tude of the forces generated by the two actuators and the M1 M1
total forces applied between wheel and body never exceed ft x5
given bounds. We derive a solution that takes the form x1
λ ft λ
of an adaptive control law that switches between dier-
ent constant state feedback gains. The results of our wL wR
simulations show that the bound on the active forces is
a design parameter useful for establishing a trade-o
between performance and power requirement.
Figure 1: Mixed suspension.
1 Introduction P
min J = 1 k=0 x (k )Qx(k )
T
s.t.
The suspension system of most vehicles is purely pas-
sive, i.e., can be schematized as composed of passive
(a) x(k + 1) = Gx(k) + Hu(k) (1)
elements, e.g., dampers and springs.
(b) ju i (k)j umax; i = 1; 2
(b0 ) jui (k) ; upi (k)j uT;max ; i = 1; 2
In an active suspension the interaction between vehicle
body and wheel is regulated by an actuator of variable where x is the system state, u is a vector whose compo-
length. The actuator is usually hydraulically controlled nents are the control forces provided by the actuators,
and applies between body and wheel a force that rep- up ;kp x is a vector whose components are the forces
resents the control action generally determined with an generated by the passive suspensions, and uT u;kp x
optimization procedure. is the vector of total forces. The optimal solution of this
Active suspensions [2, 8, 9] have better performance problem is denoted u .
than passive suspensions. However, the associated The performance of the suspension system is related to
power, that must be provided by the vehicle engine, the minimization of the term xT Qx. The constraint
may reach the order of several 10 KW [7] depending (b) on the active forces limits the maximal force re-
on the required performance. As a viable alternative quired from each controller, i.e., it leads to the choice
to a purely active suspension system, the use of mixed of suitable actuators. The constraint (b') on the total
active{passive suspensions (an actuator in parallel with forces bounds the acceleration of the sprung masses so
a passive suspension) has been considered [1, 4, 7]. Such as to ensure the comfort of passengers and to reduce
a system requires a lower power controller. Further- the risk of loss of contact between wheel and road.
more, even in case of malfunctioning of the active sub- The main problem with this approach is that in gen-
system the vehicle needs not halt because the passive eral the law u cannot be implemented as a feedback
suspension can still function. law with constant gains and it is dicult to compute
In this paper we rst consider a linear mathematical [10]. Thus its implementation on on-board controllers
model of the axletree suspension system schematized is unfeasible.
in gure 1. Then, we propose an optimal control law A valid solution to an optimization problem of the form
for active-passive suspensions that aims to optimize the (1) with only one constraint of the form (b) and with
system performance while ensuring that the magnitude scalar input u, has been proposed by Yoshida et al. in
of the forces generated by the actuators never exceed [11]. The proposed methodology consists in the approx-
a desired value umax and the magnitude of the total imation of the optimal law u by means of an adaptive
forces applied between wheel and body never exceed a controller that switches between dierent constant state
desired value uT;max . feedback gains. Each k% is the state feedback gain that
This optimization problem takes the form: gives the unconstrained optimal feedback law that min-
imizes a performance index of the form straint (p = 1) on the input magnitude (1 = 1; 1 =
1 0). In such a case the constraint takes the simpler form:
X
J% = %xT (k)Qx(k) + ru2 (k) ju(k)j
k 0: (4)
k=0
Wonham and Johnson [10] demonstrated that in this
where % belongs to a discrete set. Yoshida provides a case the optimal solution u () does not correspond in
simple algorithm for choosing the suitable % (i.e., suit- general to a feedback control law and furthermore, its
able gains) as a function of the present system state computation is quite burdensome. Yoshida et al. [11]
while always ensuring that juj umax holds. When the have proposed a simple procedure that approximates
system state is far from the origin a large % (i.e., small such optimal control law u () by switching among feed-
gains) is selected, while for small disturbances a small % back control laws whose gains can be computed solving
(i.e., large gains) may be used. Yoshida's procedure can a family of LQR problems.
also ensure the stability of the gain{scheduled system: In this paper we use an extension of Yoshida's proce-
this is an important issue because in general stability dure to solve the more general problem (3) rstly pro-
of a system controlled by gain{scheduling is dicult to posed by the authors in [6]. We call this procedure
prove. Optimal Gain Switching (OGS) and the corresponding
In this paper we use an extension of Yoshida's proce- feedback law will be denoted as uOGS ().
dure rstly proposed by the authors in [6] where the
input is not necessarily a scalar entry and more than 2.1 Single constraint
one constraint is present, each constraint being in gen- Let us consider a linear time-invariant system of the
eral a linear combination of the input and of the state, form (2) and the corresponding optimization problem of
as it is the case with constraint (b') of (1). We call the the form (3) with a single constraint (b). Furthermore,
corresponding law Optimal Gain Switching (OGS) and let us consider a family of performance indexes J% of
denote it uOGS . the form
When compared with the LQR controller [1, 2, 9], 1
X
the OGS controller has two fundamental advantages. J% = %xT (k)Qx(k) + uT (k)Ru(k): (5)
Firstly, it ensures a bound on the magnitude of the k=0
forces that each actuator needs to provide. As we im-
pose more strict bounds on the magnitude of the active For a given value of % the unconstrained control law
forces, we have worse performance in terms of sprung u% () that minimizes J% for system (2) can be written
mass displacement. Thus, this bound can be seen as a as
design parameter to establish a trade-o between good u% (k) = ;k% x(k) (6)
performance and power requirement. Secondly, while
LQR controllers realize a particular trade-o between where the gain matrix k% can be computed by solving
performance (term xT Qx) and comfort (that depends an algebraic Riccati equation. Furthermore, for every
on the total forces), the OGS controllers adapt the gain factor % it is possible to compute a linear region
trade-o to dierent road conditions and car velocities, ;% in the state space such that for any point x0 within
applying dierent control laws depending on the mag- this region the following equation holds 8k 0:
nitude of the disturbance.
jT u% (k) + T x(k)j j(;T k% + T )G^ k% x0j
(7)
2 Optimal Gain Switching Procedure where G ^ % = G ; Hk% . Thus, if we consider the system
(2) with control feedback law u% and an initial state
Let x0 2 ;% we can be sure that in its future evolution the
x(k + 1) = Gx(k) + Hu(k) (2) value of the control input and of the state are such that
ben a linear time-invariant dynamic system, where x 2 equation (3.b) is always satised.
R is the system's state, u 2 Rm is the system input, The following proposition and constructive algorithm
G 2 Rnn and H 2 Rnm . provide a simple procedure to determine if x0 2 ;% .
Let us consider the following optimization problem: Proofs are omitted here because they are similar to
those reported in [11] although we consider the case
1
X of a more general constraint of the form (3.b).
min J = xT (k)Qx(k); Proposition 1. Let ;% be a linear region dened as
s.t.
k=0 above and x0 a generic initial state vector. There exists
(a) x(k + 1) = Gx(k) + Hu(k) a nite q% 2 N such that x0 2 ;% i equation (7) is
satised for k = 0; 1; q% .
(b) jTj u(k) + Tj x(k)j
j ; k 0;
j = 1; : : : ; p; The value of q% can be easily computed. In fact, let us
(3) dene for k 2 N the sequence of vectors z Tk = (;T k% +
where Q is positive semidenite, j 2 Rm and j 2 T )G^ k% and let
Rn . In this problem, in addition to constraint (a) that
represents the system's dynamics, we have p constraints C (z 0 ; ; zq ) :=
of the form (b): each one limits the magnitude of a fz = a0 z 0 + + aq z q j ja0j + + jaqj 1g
linear combination of the input and of the state entries.
This optimal control problem has already been studied be the set of convex combinations of the vectors z 0 ,
in the particular case of a scalar input and a single con- , zq .
In [11] it was proved that q% is the smallest non negative where each matrix Z %;j is relative to the j {th constraint
integer such that zq% +1 2 C (z0 ; ; zq% ). Furthermore, of type (3.b). Note, however, that in general the matrix
to check if a vector z belongs to C (z 0 ; ; zq ) we may Z % may have redundant rows (i.e., rows that belong to
compute the n(2q +2) matrix D := [^z0 ; z^ 1 ; : : : ; z^2q+1 ] the convex combination of the other ones) and that can
where be determined solving an LPP as outlined above. We
discard the redundant rows thus obtaining a matrix of
z^i := zi ; z; i = 0; : : : ; q q~ rows that we call Z~ % . As in the single constraint
z^i+q+1 := ;zi ; z; problem we have that
and solve the following linear programming problem p
\
(LPP) where we have denoted 1 a vector of 1's ;1 Z~ % x0 1 , x0 2 ;%;j :
j =1
max 1T y
s.t.
We propose to choose, at each sampling instant, the
Dy = 0 highest gain % from a given nite T set, such that the
current state x belongs to ;% = pj=1 ;%;j . Therefore,
y 0:
the control procedure consists in two phases and can be
The vector z belongs to C (z0 ; ; zq ) i the optimal brie
y summarized with the following algorithm.
solution of this LPP is unbounded. Algorithm 2. Optimal Gain Switching (OGS). The
Thus, having computed the value of q% , if we choose algorithm is divided into o-line and on-line portions.
2
zT0T 3 O-line phase
6 z1 7 1. Choose a nite set of r values for %, namely
Z % =
1 664 ..
.
7
7:
5 f%1 ; %2 ; : : : ; %r g, with %1 < %2 < %r .
zTq% 2. Determine for each %i the corresponding gain ma-
trix k%i by solving an LQR problem with perfor-
we have that x0 2 ;% if and only if mance index of the form (5).
;1 Z % x0 1: 3. Construct for each i the corresponding matrix
Z~ % , following the procedure described above.
The control procedure can be brie
y summarized as
follows. A set of LQR optimal feedback gains corre- On-line phase
sponding to dierent weighting factors in the quadratic 1. Let k := 0.
function J% is chosen, and then, at each sampling in- T
stant, the highest gain % such that the current state 2. Let % := maxi f%i j x(k) 2 pj=1 ;%i ;j g.
x(k) belongs to ;% is applied. Note that in Yoshida's
approach the switching of gains leads to a monotoni- 3. Set up the control according to u(k) = ; k% x(k).
cally nondecreasing sequence of % if we assume no ex-
ternal disturbance is acting on the system. This is the 4. Put k := k + 1 and return to Step 2.
essential feature of the method and allows us to ex- If the initial state x(0) 2 ;% for % 2 f%1 ; ; %r g, then
tend to the OGS law the stability property enjoyed by we can be sure that, in the absence of external distur-
LQR 1control laws, while reducing the performance in- bances, at Step 3 of the on-line phase a value % always
X
dex x(k)T Qx(k) with respect to a xed gain. exists. In fact, the value of % determined at the previ-
k=0 ous iteration can still be used if a higher value cannot
A nal comment regarding the OGS procedure. Each be found. Thus we can be sure that in the absence of
gain matrix is computed for an innite time horizon external disturbances the switching of feedback gains
solving an algebraic Riccati equation, but is used only leads to a monotonically nondecreasing value of %, so
for a nite time horizon (with the exception of the gain stability is ensured.
matrix corresponding to the highest %). The idea of It is important to highlight the advantages and lim-
computing the OGS gains for a nite horizon (solving its of the OGS control scheme. It has been shown by
a dynamic Riccati equation) is not practical, because Yoshida, in the case of a single constraint of the form
the switching times are not easy to compute and this (4), that the control law uOGS () leads to values of the
law would lead to time-varying gains. performance index in (3) that are close to the absolute
minimum given by the optimal control law u (). In
2.2 Multiple constraints the following we will show, by numerical simulations,
Now, let us consider the multiple constraint optimiza- that the same conclusions are still valid in presence of
tion problem of the form (3). In such a case the same multiple constraints.
discussion as above can be repeated for every con- The computational complexity of the OGS control law
straint. So we can dene: warrants comment. The most burdensome part of this
2 procedure is the o-line phase, where the matrices Z %;j
2
Z %;1 3 ;Tj k% + Tj 3 are computed. During the on-line phase, it is necessary
Z 6 (;Tj k% + Tj )G
^ % 77 to compute at most r p matrix products Z %i ;j x(k)
Z % = 664 ...%;2 775 ; Z %;j =
1j 664 .. 7; at each sampling instant k. The number of rows of the
dierent Z %i ;j is not constant and is equal to q%i ;j +1. In
. 5
Z %;p (;j k% + j )G%
T T ^ q%;j Section 5, we will discuss the computational complexity
relative to the determination of the OGS control law.
x4 coecient of the damper; Kb is the elastic constant
M2,J2 of the stabilizing bar; u = [u1 ; u2]T is the vector of
x8 control forces that must be realized by the actuators.
x3 x7 The passive components are assumed to exhibit linear
uT1 uT2 behaviour.
It is easily shown that the passive suspension provides
a contribution up (t) to the total control forces uT (t)
x2 x6
x1[m]
actuator in terms of the required power. Constraints
0
−−
(15) and (16) are of the form (3.b) with 1 = e1 ,
−−
−0.01 (a)
−−
1 = 0,
1 = umax, 2 = e2, 2 = 0,
2 = umax,
−−
←
−0.02
x3[m]
0.05
←−−−−
0
5 Application example
(b)
−−
−0.05
0 0.5 1 1.5
←
simulations.
−−
0.01
−−
x5[m]
The proposed procedure has been applied to the half{
−−
0
−−
car vehicle model shown in gure 1, with values of the −0.01
(c)
−−
f = 1081Ns/m, K = 15438N/m, Kb = 5496N/m.
−−
x7[m]
−−
0
−
←−
−0.05 (d)
discussed in [5].
t[s]
−0.02
(a) cedure is based on the minimization of a quadratic per-
−0.04
formance index that penalizes the tires and the suspen-
sion deformations, while requiring that the total forces
0 0.5 1 1.5
0.04
applied between wheel and body and that the fraction
0.02
of the forces generated by the actuators never exceed
0 given bounds.
−0.02 The constraint on the actuator forces can be used to
(b)
dimension the actuators, so that it is required to pro-
vide only a fraction of the total forces generated by the
−0.04
0 0.5 1 1.5
References
−1000
(d)
−2000
0 0.5 1 1.5
t[s]
[1] K.C. Cheok, N.K. Loh, H.D. McGree, T.F. Petit,
\Optimal model following suspension with microcomputer-
ized damping," IEEE Trans. on Industrial Electronics , Vol.
Figure 4: The results of simulation 2. 32, No. 4, November 1985.
[2] G. Corriga, S. Sanna, G. Usai, \An optimal tandem
active-passive suspension for road vehicles with minimum
ness variance and V the vehicle speed, whereas the co- power consumption," IEEE Trans. on Industrial Electron-
ecients c and depend on the type of road surface. ics , Vol. 38, No. 3, pp. 210{216, 1991.
The product is the power spectrum of the white noise. [3] G. Corriga, V. Presicci, S. Sanna, G. Usai, \Minimum
The signal x0;L (t), whose PSD is given by (17), may be energy optimal suspension for road vehicles," Proc. Cana-
obtained as the output of a linear lter expressed by dian Conference and Exhibition on Industrial Automation ,
the dierential equation pp. 26.5{26.12, June 1992.
[4] M.J. Crosby, D.C. Karnopp, \The active damper: a
x_ 0;L (t) = ;V x0;L (t) + wL (t) (18) new concept in shock and vibration control," 43rd Shock
and Vibration Bulletin , June 1973.
where the subscript L stands for left. The same holds [5] A. Giua, C. Seatzu, G. Usai, \Semiactive suspension
for the right disturbance. design with an Optimal Gain Switching target," Vehicle
By taking into account the above disturbances, state System Dinamics , Vo. 31, N. 4, pp. 213{232, April 1999.
equation (8) can be rewritten as [6] A. Giua, C. Seatzu, G. Usai, \A mixed suspension
system for a half{car vehicle model," Dynamics and Con-
trol , (conditionally accepted).
x_ (t) = Ax(t) + BuT (t) + Lw(t) (19) [7] E. Goring, E.C. von Glasner, R. Povel, P. Schutzner,
\Intelligent suspension systems for commercial vehicles,"
where w = [wL (t) wR (t)]T is the disturbance vector Proc. Int. Cong. MV2, Active Control in Mechanical En-
and L 2 R82 [6]. gineering (Lyon, France), pp. 1{12, June 1993.
In this simulation test we assume that the disturbance [8] A. Hac, \Suspension optimisation of a 2-DOF vehicle
acting on the system is caused by a very rough road model using a stochastic optimal control technique," Jour-
prole. Crosby and Karnopp [4] gave the power spectral nal of Sound and Vibration , Vol. 100, No. 3, pp. 343{357,
density for such an input disturbance. We were able [5] 1985.
to obtain a similar power spectral density by choosing [9] A.G. Thompson, \An active suspension with optimal
in equation (17) the following parameter values: = linear state feedback," Vehicle System Dynamics , Vol. 5,
0:2 m;1 , 2 = 0:1 m2 and V = 20 m/s. Furthermore, pp. 187{203, 1976.
we assume umax = 500 N and a null initial state. [10] W.M. Wonham, C.D. Johnson, \Optimal bang-bang
The results of simulation 2 are shown in gure 4. Fig- control with quadratic performance index," Trans. ASME
ure 4.a (4.b) shows the left (right) road prole along Journal of Basic Engineering , Vol. 86, pp. 107{115, March
with the left (right) wheel and left (right) sprung mass 1964.
displacement. It is possible to observe that the suspen- [11] K. Yoshida, Y. Nishimura, Y. Yonezawa, \Variable
sion lters the high frequencies smoothing the move- gain feedback for linear sampled-data systems with bounded
ment of the sprung mass. Figure 4.c shows the active control," Control Theory and Advanced Technology , Vol. 2,
forces u1 and u2 , while the total forces uT 1 and uT 2 are No. 2, pp. 313{323, June 1986.
reported in gure 4.d.