Professional Documents
Culture Documents
6948
19th IFAC World Congress
Cape Town, South Africa. August 24-29, 2014
∞
with ys (t) = C x̃(tk ), us (t) = ũ(tk ),
Z
J (x̃, ũ) = φ(x̃, ũ)dt (6)
0 A0 B 0
A1 = , B= and E = .
with 0 0 0 −1
φ(x̃, ũ) = x̃′ Qx̃ + ũ′ Rũ, Q = Q′ ≥ 0, R > 0 (7)
Define now the vector
Theorem 1. If there exist a matrix P = P ′ > 0 such that
the following matrix inequality is verified ξ(t) = [x̃(t)′ us (t)′ ys (t)′ ]′ (13)
He{P (A + B[kp ki ]C)} + Q C′ [kp ki ]′
and the matrix
<0 (8)
[ kp ki ] C −R−1 P A1 + A′1 P + µ−1 Q P B P E
M= B′ P µ−1 R 0 (14)
then it follows that the closed-loop system is asymptoti- ′
EP 0 0
cally stable and
with µ > 1
J (x̃, ũ) < x̃(0)′ P x̃(0)
The event-triggered sampling strategy can therefore be
described by the following algorithm:
Proof. Consider a candidate Lyapunov function Vo (x̃) =
Algorithm 1.
x̃′ P x̃.
if ξ ′ (t)Mξ(t) > 0 then sample, i.e:
Applying now Schur’s complement to (8) and pre and pos- tk+1 = t
multiplying the result by x̃′ and x̃ respectively, it follows k ←k+1
that: ys (t) = ỹ(t)
V̇0 (x̃) + x̃′ Qx̃ + ũ′ Rũ < 0 (9) us (t) = ũ(t)
otherwise:
Since Q ≥ 0 and R > 0, inequality (9) implies that ys (t) = ỹ(tk )
V̇0 (x̃) < 0 and the asymptotic stability of the closed-loop us (t) = ũ(tk )
system follows.
Theorem 2. Consider system (12) with the event-triggered
On the other hand, integrating (9) from 0 to ∞ it follows
sampling strategy given in Algorithm 1, where M is
that:
Z ∞ defined as in (14) with matrix P verifying (8). Then the
(V̇0 (x̃) + x̃′ Qx̃ + ũ′ Rũ)dt = following holds:
0
(10)
V0 (x̃(∞)) − V0 (x̃(0)) + J (x̃, ũ) < 0 a) lim x̃(t) = 0, i.e. the closed-loop system is asymptot-
t→∞
Hence, since the closed-loop system is asymptotically sta- ically stable.
ble it follows that V0 (∞) = 0 and, therefore b) J(x̃, us ) ≤ µx̃(0)′ P x̃(0)
J (x̃, ũ) < V0 (x̃(0)) = x̃(0)′ P x̃(0) Proof. Let V (x̃) = x̃′ P x̃ be a candidate Lyapunov function
and consider the following notation:
• V̇s (x̃, us , ys ) for denoting the time derivative of V (x̃)
For a given PI controller, i.e. considering kp and ki given,
along the trajectories of system (12)
note that the matrix inequality (8) is linear in the variable
P , i.e. it is a linear matrix inequality (LMI). Thus, the • V̇ (x̃) for denoting the time derivative of V (x̃) along
result of Theorem 1 can be used to certify a certain the trajectories of system (5)
guaranteed cost performance with respect to criterion (6). From the definition of matrix M and the vector ξ, it
This can be done by solving the following optimization follows:
problem: ξ(t)′ Mξ(t) = 2x̃(t)′ P (A1 x̃(t) + Bus (t) + Eys (t))
min trace(P ) + µ−1 (x̃(t)′ Qx̃(t) + us (t)′ Rus (t))
P (11)
s.t. (8) = V̇s (x̃, us , ys ) + µ−1 φ(x̃, us )
with φ(x̃, us ) defined as in (7), with us replacing ũ.
On the other hand, the PI parameters can be tuned to
minimize J(x̃, ũ). This can be accomplished by solving Since Q ≥ 0 and R > 0, if ξ(t)′ Mξ(t) ≤ 0, ∀t ∈ [tk−1 tk )
(11) with ki and kp as decision variables. Note that in we can conclude that
this case constraint (8) is no longer an LMI. However, V̇s (x̃, us , ys ) < 0 ∀t ∈ [tk−1 tk ), (15)
the optimal solution of the problem can be approximated
by considering a grid on the parameters kp and ki and Let us consider now the sampling instant t = tk . At this in-
iteratively solving (11) for each point of this grid. stant, the control and the sensor values are instantaneously
updated and it follows that:
4. EVENT-TRIGGERED STRATEGY
us (tk ) = ũ(tk ) = [kp ki ]Cx̃(tk )
Considering variables x̃p x̃c and ũ, the closed-loop sample- A1 x̃(tk ) + Bus (tk ) + Eys (tk ) = Ax̃(tk ) + Bũ(tk )
data system (3), for t ∈ [tk tk+1 ), can be rewritten as
follows: and we can conclude that
˙
x̃(t) = A1 x̃(t) + Bus (t) + Eys (t) (12) Vs (x̃(tk ), us (tk ), ys (tk )) = V (x̃(tk ))
6949
19th IFAC World Congress
Cape Town, South Africa. August 24-29, 2014
Consider t0 = 0 and, since lim x̃(t) = 0, there exists an ẋp (t) = −xp (t) + u(t) (19)
t→∞
integer k̄ ∈ (0 ∞) such that V (x(tk̄+1 )) = 0. Hence, we y(t) = xp (t) (20)
can conclude that:
k̄ Z tk+1
The design parameters are the weighting matrices Q =
30
X
−1
(V (x̃(tk+1 )) − V (x̃(tk )) + µ φ(x̃(t), us (t))dt) = and R = 0.15. The controller gains have been
tk 03
k=0
Z ∞ determined by minimizing the trace of P subject to (8)
−V (x̃(0)) + µ−1 φ(x̃(t), us (t))dt ≤ 0 leading to kp = 4.4747 and ki = 4.4740. For xp (0) =
0 0, xc (0) = 0 and r = 1 the output of the continuous plant
y(t) and the sampled output y(tk ) considering Algorithm
which leadsZto 1 with µ = 40 is depicted in Figure 2 . Details of the event-
∞
J (x̃, us ) = φ(x̃(t), us (t))dt ≤ µV (x̃(0)) = µx̃(0)′ P x̃(0) triggered sampling of the output can be seen in Figure 3.
0
The discrete-time control signal, u(tk ) is shown in figure
4. Again, note the effect of the event-triggered sampling.
The event-triggering strategy defined in Algorithm 1 is In this experiment, a total of 12 samples were performed
supposed to run in the actuator-plant-sensor node, where to drive the system to its reference. Figure 5 shows the
the sensor device is assumed to have a processor (i.e. temporal distribution of the events. At each moment, a
it is a smart sensor). In this case, note that both the value of 0 means no event and a value of 1 means a event.
plant and control states should be available to perform Although not regularly spaced in time, events tend to
the test ξ ′ Mξ. Of course, in general applications only happen in bursts. Note that the sampling is more frequent
the plant output is measured. Moreover, assuming that when the output is changing fast and is close to the
the controller is running in a different node and that the reference.
communication is done only when an event occurs, the
Those samples are decided based on the value of ξ ′ (t)Mξ(t),
current value of its state is not available in the actuator-
sensor-plant node. which is shown in Figure 6. Note that a sampling event
and a consequent change in the control value is performed
However, if we assume that the controller sends also the as soon as ξ ′ (t)Mξ(t) > 0. Thus the value of ξ ′ (t)Mξ(t)
value of its state at time tk , the controller state can be above 0 tends to be very small. In Figure 7 it can be seen
directly obtained as follows in the actuator-plant-sensor that ξ ′ (t)Mξ(t) actually becomes positive in the instants
node: corresponding to the sampling events.
6950
19th IFAC World Congress
Cape Town, South Africa. August 24-29, 2014
1.4
1
1.2
Sampling events
0.8
1
y(t), y(tk )
0.8 0.6
0.6 0.4
0.4
0.2
0.2
0
0
0 0.5 1 1.5 2 2.5 3 3.5 4 4.5 5 0 0.5 1 1.5 2 2.5 3 3.5 4 4.5
t[s] t[s]
Fig. 2. Output of the continuous plant y(t) (dashed) and Fig. 5. Sampling events. 0 means no event, 1 means event.
the sampled output y(tk ) (solid).
1.05 1
y(t), y(tk )
1 −1
ξ ′ (t)Mξ(t)
−2
0.95
−3
−4
0.9
0 0.2 0.4 0.6 0.8 1 1.2 1.4 1.6 1.8 2
t[s] −5
−6
Fig. 3. Details of the event-triggered sampling. Output of
the continuous plant y(t) (dashed) and the sampled −7
0.8
3 0.6
u(tk )
0.4
2.5 0.2
0
2 −0.2
−0.4
1.5 −0.6
−0.8
1 −1
0 0.5 1 1.5 2 2.5 3 3.5 4 4.5 5
t[s]
0.5
0 0.5 1 1.5 2 2.5 3 3.5 4 4.5 5
t[s] Fig. 7. Detail of the evolution of ξ ′ (t)Mξ(t).
6951
19th IFAC World Congress
Cape Town, South Africa. August 24-29, 2014
6952