• Aucun résultat trouvé

Domination and Compensation in Finite Dimension Dynamical Systems

N/A
N/A
Protected

Academic year: 2021

Partager "Domination and Compensation in Finite Dimension Dynamical Systems"

Copied!
16
0
0

Texte intégral

(1)

HAL Id: hal-01296545

https://hal-univ-perp.archives-ouvertes.fr/hal-01296545

Submitted on 4 Oct 2019

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ée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

Distributed under a Creative Commons Attribution| 4.0 International License

Dynamical Systems

Larbi Afifi, El Mostafa Magri, Abdelhaq El Jai

To cite this version:

Larbi Afifi, El Mostafa Magri, Abdelhaq El Jai. Domination and Compensation in Finite Dimension Dynamical Systems. Australian Journal of Mathematical Analysis and Applications, Austral Internet Publishing, 2010, 4 (49), p. 2443 - 2457. �10.4236/ica.2013.42026�. �hal-01296545�

(2)

Domination and Compensation

in Finite Dimension Dynamical Systems

Larbi AFIFI

Faculty of Sciences, University Hassan II Ain Chock B.P.5366-Maˆarif, Casablanca, Morocco

[email protected], larbi[email protected]

El Mostafa MAGRI

Faculty of Sciences, University Hassan II Ain Chock B.P.5366-Maˆarif, Casablanca, Morocco

[email protected] Abdelhaq EL JAI

MEPS - Th´eorie des Syst`emes, Universit´e de Perpignan 52 Avenue Paul Alduy, Perpignan Cedex

[email protected]

R´esum´e

This work concerns the analysis of a class of linear dynamical sys-tems. We study the possibility of comparing input operators, with res-pect to the output one, and we give characterization results. Various situations are examined, applications and illustrative examples are pre-sented.

Under convenient hypothesis, we also show how to find the optimal control ensuring the compensation of a disturbance in the finite time or asymptotic cases. The relationship with the notions of controllabi-lity, stability and stabilizability is examined. Here also, applications and examples illustrating different results and situations are given.

Keywords : Dynamical systems, observation, control, domination, reme-diability, disturbance

(3)

1

Introduction and problem statement

In this work, we consider a class of finite dimension dynamical systems descri-bed by a linear state equation as follows :

(S) ½ ˙z(t) = Az(t) + B1u1(t) + B2u2(t) ; 0 < t < T z(0) = z0 ∈ Rn (1) where A ∈ Mn(R), B1 ∈ Mn,p(R), B2 ∈ Mn,m(R), u1 ∈ L2(0, T ; Rp) and u2 ∈ L2(0, T ; Rm).

The system (S) is augmented by the output equation :

y(t) = Cz(t) ; 0 < t < T (2) where C ∈ Mq,n(R). The state of system (S) at time t, is given by :

z(t) = eAtz

0+ H1(t)u1 + H2(t)u2 (3)

where for t ∈]0, T ], H1(t) and H2(t) are the operators defined by

H1(t) : L2(0, t; Rp) −→ Rn u1 −→ Z t 0 eA(t−s)B 1u1(s)ds (4) and H2(t) : L2(0, t; Rm) −→ Rn u2 −→ Z t 0 eA(t−s)B 2u2(s)ds (5)

For i = 1, 2, we note Hi = Hi(T ). Then

y(T ) = CeATz

0+ CH1u1+ CH2u2 (6)

The system (S) is excited by two input terms B1u1and B2u2 where one, the

second for example, is considered as an intentional or accidental disturbance. The other term B1u1 is introduced in order to compensate [1,2] at the final

time T , the effect of the disturbance by bringing back the observation to the normal situation which is CeATz

0. That is to say : for any u2 ∈ L2(0, T ; Rm),

there exists a control u1 ∈ L2(0, T ; Rp) such that :

CeA(T )z 0+ Z T 0 CeA(T −s)B 1u1(s)ds + Z T 0 CeA(T −s)B 2u2(s)ds = CeA(T )z0

(4)

or equivalently

CH1u1+ CH2u2 = 0

This leads to the notion of domination which consists to study the possi-bility of comparing the input operators B1 and B2, with respect to the output

one C.

The domination notion is introduced and studied separately for controlled and observed distributed systems [3]. In this paper, we examine the problem of domination in connection with the compensation one.

First, we consider the finite time case. We define and we characterize the no-tion of dominano-tion. Sufficient condino-tions, applicano-tions and illustrative examples are also given. The minimum energy problem [7,8] is examined using Hilbert Uniqueness Method, such a problem can be studied as a general optimal control one. The obtained results are extended to the asymptotic case and various situations are examined. The relationship with the notions of stability and stabilizability [4,5,6] are equally studied.

2

Finite time C-domination

2.1

Definitions and characterizations

We define hereafter the notion of C-domination. Definition 2.1

We say that B1 dominates B2 on [0, T ] with respect to C (or B1 C-dominates

B2on [0, T ]), if for any u2 ∈ L2(0, T ; Rm), there exists a control u1 ∈ L2(0, T ; Rp)

such that :

CH1u1+ CH2u2 = 0

In this case, and for C and T fixed, one can note B2 ≤ B1

We have the following characterization result.

Proposition 2.2 The following properties are equivalent :

i) B1 dominates B2 on [0, T ] with respect to C.

ii) Im(CH2) ⊂ Im(CH1).

iii) Ker(H∗

(5)

iv) ∃γ > 0 such that for any θ ∈ Rq, we have k B∗ 2eA (T −.) C∗θk L2(0,T ;Rm) ≤ γ kB1∗eA (T −.) C∗θk L2(0,T ;Rp) (7)

Proof : Derive from the definition, the fact that

Ker(Hi∗C∗) = Ker(Bi∗eA∗(T −.)C∗), f or i = 1, 2 and also the following well known result.

Lemma 2.3

Let X , Y and Z be Banach reflexive spaces, P ∈ L(X, Z) and Q ∈ L(Y, Z). We have

Im(P ) ⊂ Im(Q) if and only if

∃γ > 0 such that for any z∗ ∈ Z0, we have kPzk

X0 ≤ γ kQ∗z∗kY0

Concerning the relationship with the controllability notion, we have the following result. Proposition 2.4 i) If the system (S1) ½ ˙z(t) = Az(t) + B1u1(t) ; 0 < t < T z(0) = z0 ∈ Rn (8)

is controllable on [0, T ], then B1 dominates any operator B2 on [0, T ], with

respect1 to C.

ii) The converse is not true.

Proof :

i) Obviously, (S1) is controllable on [0, T ] ⇐⇒ ImH1 = Rn,

then

Im (CH1) = Im(C)

and hence

(6)

Im (CH2) ⊂ Im (CH1)

Consequently B1 dominates B2 on [0, T ], with respect to C.

ii) Counter example : We consider the case where n = 2, p = q = 1 and

A = µ 1 0 0 1 ¶ ; B2 = µ 1 0 0 2 ¶ ; B1 = µ 1 0 ¶ ; C = ¡ 1 0 ¢ we have B∗ 2eA (T −s) C∗θ = e(T −s) µ 1 0 ¶ θ = µ e(T −s)θ 0 ¶ and B∗ 1eA (T −s) C∗θ =¡ 1 0 ¢ µ e(T −s)θ 0 ¶ = e(T −s)θ then k B∗ 2eA (T −.) C∗θk L2(0,T ;R2) = kB1∗eA (T −.) C∗θk L2(0,T ;R)

The inequality (7) is then true for γ = 1. Hence B1 C-dominates B2, but

rank¡ B1 AB1 ¢ = rank µ 1 1 0 0 ¶ = 1 < 2

Consequently (S1) is not controllable on [0, T ]. ¤

We give hereafter a sufficient condition ensuring such a domination. Proposition 2.5 If

rank¡ CB1 CAB1 ... CAn−1B1

¢

= q (9)

then B1 C-dominates any operator B2 on [0, T ].

Proof : Using Caylay-Hamilton theorem, we have

rank¡ CB1 CAB1 ... CAn−1B1 ¢ = q ⇐⇒      B∗ 1C∗ B∗ 1A∗C∗ ... B∗ 1(A∗)n−1C∗      (np,q) y = 0 ; ∀y ∈ Rq =⇒ y = 0 ⇐⇒ Ker(H1)∗C∗ = {0}

(7)

Hence, if Ker [(H1)∗C∗] = {0}, then Ker [(H1)∗C∗] ⊂ Ker [(H2)∗C∗]

and then, B1 dominates B2 on [0, T ] with respect to C . ¤

Remark 2.6

i) One can have

rank¡ CB1 CAB1 ... CAn−1B1

¢ = q

even if the system (S1) is not controllable on [0, T ].

ii) B1 may dominates another operator B2, with respect to C on [0, T ],

without having

rank¡ CB1 CAB1 ... CAn−1B1

¢ = q

This is illustrated in the following example.

Example 2.7

i) We consider the case where n = 2, p = q = 1 and

A = µ 1 0 0 1 ¶ ; B1 = µ 1 1 ¶ ; C =¡ 1 0 ¢

The controllability matrix is given by

¡ B1 AB1 ¢ = µ 1 1 1 1 ¶

its rank is then 1 < 2. Consequently, the corresponding system is not controllable on [0, T ]. On the other hand

¡

CB1 CAB1

¢

=¡ 1 1 ¢

Its rank is 1 = q, then B1 dominates any operator B2 on [0, T ] with respect

to C .

ii) Now, for m = n = 2, p = 1, q = 2 and

A = µ 1 0 0 1 ¶ ; B2 = µ 1 0 0 1 ¶ ; B1 = µ 1 1 ¶ ; C = µ 1 1 1 1 ¶ ; θ = µ θ1 θ2 ¶ we have

(8)

eA∗(T −.s) C∗θ = e(T −s) µ 1 0 0 1 ¶ µ 1 1 1 1 ¶ µ θ1 θ2 ¶ = e(T −s) µ θ1+ θ2 θ1+ θ2 ¶ and B∗ 1eA (T −s) C∗θ = e(T −s)2(θ 1+ θ2), then k B∗ 1eA (T −.) C∗θk2 L2(0,T ;R) = 4 Z T 0 e2(T −s)(θ1+ θ2)2ds

On the other hand

k B∗ 2eA (T −.) C∗θk2 L2(0,T ;R2) = Z T 0 e2(T −s)k µ θ1+ θ2 θ1+ θ2 ¶ k2 ds = 2 Z T 0 e2(T −s) 1+ θ2)2ds hence k B∗ 2eA (T −.) C∗θk L2(0,T ;R2) ≤ k B1∗eA (T −.) C∗θk L2(0,T ;R)

Consequently, B1 C-dominates B2 on [0, T ], even if

rank¡ CB1 CAB1 ¢ = rank µ 2 2 2 2 ¶ = 1 6= 2 ¤ In the following result, we give a necessary and sufficient condition for such a domination.

Proposition 2.8

B1 C-dominates B2 on [0, T ], if and only if

Im¡ CB2 CAB2 ... CAn−1B2

¢

⊂ Im¡ CB1 CAB1 ... CAn−1B1

¢ Proof : Using proposition 2.2, B1 C-dominates B2 on [0, T ], if and only if

Ker(H∗

1C∗) ⊂ Ker(H2∗C∗)

(9)

y ∈ Ker[(Hi)∗C∗] ⇐⇒      B∗ iC∗ B∗ iA∗C∗ ... B∗ i(A∗)n−1C∗      (np,q) y = 0 hence Ker      B∗ iC∗ B∗ iA∗C∗ ... B∗ i(A∗)n−1C∗     = Ker(H iC∗)

Consequently, B1 C-dominates B2 on [0, T ], if and only if

Im¡ CB2 CAB2 ... CAn−1B2 ¢ ⊂ Im¡ CB1 CAB1 ... CAn−1B1 ¢ ¤ Remark 2.9

1. This necessary and sufficient condition is not depending on the time pa-rameter T .

2. In the particular case where B2 is invertible, B1 C-dominates B2 on [0, T ]

if and only if

rank¡ CB1 CAB1 ... CAn−1B1

¢

= rank¡ C ¢

2.2

Minimum energy problem

In this part, we assume that B1 C-dominates B2 on [0, T ], then for any

v ∈ L2(0, T ; Rm), there exists a control u ∈ L2(0, T ; Rp) such that

CH1u + CH2v = 0 (10)

For v ∈ L2(0, T ; Rm), we examine the existence and the uniqueness of the

optimal control u ∈ L2(0, T ; Rp) satisfying (10), i.e. ensuring the compensation

of the opposing term B2v.

For this, we use an extension of the Hilbert Uniqueness Method. Indeed, for θ ∈ Rq, let us note :

(10)

k θk∗ = ( Z T 0 k(H1)∗C∗θk2Rpds) 1 2 = ( Z T 0 kB∗ 1eA (T −s) C∗θk2 Rpds) 1 2 k θk is a semi-norm on Rq.

We assume that k .k is a norm on Rq. If Ker [(H

1)∗C∗] = {0}, this is

equivalent to the asymptotic remediability [1,2,3] of the system (1)+(2) on [0, T ]. The corresponding inner product is given by :

< θ, σ > = Z T 0 < B∗ 1eA (T −s) C∗θ, B 1eA (T −s) C∗σ >ds

and the operator ΛC : Rq −→ Rq defined by

ΛCθ = CH1(H1)∗C∗θ = Z T 0 Ce(T −s)B 1B1∗eA (T −s) C∗θds

is symmetric and positive definite, and then invertible. We give hereafter the expression of the optimal control ensuring the compensation of the effect of the term B2v, at the final time T .

Proposition 2.10

For v ∈ L2(0, T ; Rm), there exists a unique θ

v ∈ Rq such that

ΛCθv = −CH2v

and the control

uθv(.) = B 1eA (T −.) C∗θ v verifies CH1uθv+ CH2v = 0

Moreover, it is optimal and

kuθvkL2(0,T ;Rp)= kθvk∗

Let us note that one can also consider a general optimal control problem with a cost function defined on L2(0, T ; Rp) by

(11)

J(u) = < P (CH1u + CH2v), CH1u + CH2v > + Z T 0 < Q(CH1(t)tu + CH2(t)v), CH1(t)u + CH2(t)v > dt + Z T 0 < Ru(t), u(t) > dt (11)

where P , Q and R are symmetric matrixes with Q positive, P and R are positive definite.

In the next section, we present an extension to the asymptotic case.

3

Extension to the asymptotic case

In this part, we consider a class of linear dynamical systems described by the following state equation

(S∞ 1 ) ½ ˙z(t) = Az(t) + B1u1(t) + B2u2(t) ; t > 0 z(0) = z0 ∈ Rn (12) with A ∈ Mn(R), B1 ∈ Mn,p(R), B2 ∈ Mm,n(R), u1 ∈ L2(0, +∞; Rp) and u2 ∈ L2(0, +∞; Rm)

The system (12) is augmented by the output equation :

y(t) = Cz(t); t > 0 (13) with C ∈ Mq,n(R). We have z(t) = eAtz 0+ H1(t)u1 + H2(t)u2 Let z = µ z+ z−

where z+ and z− are respectively the projections of the state z on the

unstable and the stable subspaces :

E+ =

M

R(e)(λ)≥0

Ker(A − λIn)m(λ) (14)

(12)

E− =

M

R(e)(λ)<0

Ker(A − λIn)m(λ) (15)

where m(λ) is the multiplicity of the eigenvalue λ. E+and E− are invariant

with respect to the operator A. We have    (S+) ˙z+(t) = A +z+(t) + P Bu1(t) + P Bu2(t) (S−) ˙z(t) = A −z−(t) + (I − P )Bu1(t) + (I − P )Bu2(t) (16)

P is the projection operator on the unstable part and A+, respectively A−,

is the matrix induced by A on E+, respectively E−.

In the case where we observe only the stable part, i.e. if

E+ ⊂ Ker(C)

the following operators K∞(C) and L(C) respectively given by

K∞(C) : L2(0, +∞; Rp) −→ Rq u −→ Z 0 CeAtB 1u(t)dt and L∞(C) : L2(0, +∞; Rm) −→ Rq v −→ Z 0 CeAtB 2v(t)dt

are well defined. We have the same result if the considered system is expo-nentially stable, i.e. the matrix A is such that Re(λi) < 0 for i = 1, n ; where

λ1, ..., λn are the eigenvalues of A. But as it will be shown later, this is not

necessary.

We assume that operators K∞(C) and L(C) are well defined. By the

same, we say that B1C-dominates B2asymptotically, if for every u2 ∈ L2(0, +∞; Rm),

there exists u1 ∈ L2(0, +∞; Rp) such that :

K∞(C)u1+ L∞(C)u2 = 0

With a similar approach, it is easy to show the following characterization result of the asymptotic domination.

(13)

Proposition 3.1 The following properties are equivalent :

i) B1 C-dominates B2 asymptotically.

ii) Im [L∞(C)] ⊂ Im [K(C)]

iii) Ker [K∞(C)] ⊂ Ker [L(C)]

iv) ∃γ > 0 such that ∀θ ∈ Rq, we have

k B∗ 2eA . C∗θk L2(0,+∞;Rm) ≤ γkB1∗eA . C∗θk L2(0,+∞;Rp) v) Im¡ CB2 CAB2 ... CAn−1B2 ¢ ⊂ Im¡ CB1 CAB1 ... CAn−1B1 ¢ Let us note that if the eigenvalues λ1, ..., λn of A are such that : Re(λi) < 0

for i = 1, n, the proposition 2.4 remain true in the asymptotic case.

One can also consider the asymptotic optimal control problem. The approach and the results are similar.

We give hereafter illustrative examples showing particularly that the no-tions of stability (or even the stabilizability) and also the controllability are not necessary for considering the asymptotic domination.

Example 3.2

Let us consider the case of an unstable system with m = n = 2, p = q = 1 and A = µ 2 0 1 −1; B2 = µ 1 0 1 2 ¶ ; B1 = µ 1 0 ¶ ; C = ¡ 1 −3 ¢

Obviously, the system is not stable. We have

etA = P et∆P−1 where ∆ = µ 2 0 0 −1; P = µ 3 0 1 1 ¶ then CetA =¡ e−t −3e−t ¢

(14)

In this case K∞(C) and L(C) are well defined and

¡

CB1 CAB1

¢

1 −1 ¢

and rank¡ C ¢= 1. Consequently, B1 C-dominates B2 asymptotically.

¤ Example 3.3 We consider an unstable system with m = n = 2, p = q = 1

and B2 is invertible. i) For A = µ 1 0 0 2 ¶ ; B1 = µ 1 0 ¶ ; C = ¡ 1 1 ¢; F = ¡ a b ¢ we have A + B1F = µ 1 + a b 0 2 ¶

(A, B1) is not stabilizable because for any F =

¡

a b ¢, A + B1F is not

stable. However, B1 C-dominates B2 asymptotically.

ii) Let A = µ −1 0 1 2 ¶ ; B1 = µ 0 1 ¶ ; C =¡ 1 1 ¢

For F = ¡ a b ¢, the matrix A + B1F =

µ

−1 0

a + 1 b + 2

is stable for b < −2, then (A, B1) is stabilizable.

On the other hand, we have AB1 =

µ 0 2

, then rank(B1 AB1) = 1 6= 2

and consequently (A, B1) is not controllable (in fact, the asymptotic

control-lability is not well defined in the considered case). But B1 C-dominates B2

asymptotically, because

rank¡ CB1 CAB1

¢

= rank¡ C ¢ (17)

Let us remark that in the general case, if C is an invertible matrix (for example if C is the identity matrix), then the relation (9) (the relation (17) in the considered example) is equivalent to the controllability rank condition. But this hypothesis is strong and is not very useful.

(15)

¤ Finally let us note that concerning the asymptotic minimum energy pro-blem, and with an extension of H.U.M., it is easy to show the existence and the uniqueness of the optimal control and also how to find it.

With convenient hypothesis, one can also consider the asymptotic version of the cost function given by (11).

Acknowledgment : The authors wish to thank the Academy Hassan II of Sciences and Technics for its support to the Systems Theory Network.

ef´

erences

[1] L. Afifi, A. Chafiai and A. El Jai (2001)

Spatial Compensation of boundary disturbances by boundary actuators the

International Journal of Applied Mathematics and Computer Science, Vol. 11, N˚4.

[2] L. Afifi, A. El Jai and E. M. Magri (2008)

Compensation problem in finite dimension linear dynamical systems.

In-ternational Journal of Applied Mathematical Sciences. Vol.2, N.45, pp 2219 - 2228.

[3] L. Afifi, M. Bahadi, A. El Jai et A. El Mizane (2009) Asymptotic Analysis,

Approximtions and Simulations of the Compensation Problem in Hyper-bolic systems. Applied Mathematical Sciences, volume 3, N˚15, 737-765.

[4] L. Afifi, E. M. Magri and A. El Jai (2010)

Weak and exact domination in distributed systems. To appear in the

In-ternational Journal of Applied Mathematics and Computer Science. Vol. 20, No. 3.

[5] R.F. Curtain and A.J. Pritchard (1978)

Infinite Dimensional Linear Systems Theory. Lecture Notes in Control

and Information Sciences, vol. 8, Berlin.

[6] Curtain, R.F. and Zwart, H.J. (1995). An Introduction to

Infinite-Dimensional Linear Systems Theory. Texts in Applied Mathematics,

Springer-Verlag, New York. [7] J.-L. Lions (1980)

On the foundation of optimal control of distributed systems. Lecture notes

in control and inf. sc. 22, Springer. [8] J.-L. Lions (1988)

Contrˆolabilit´e exacte, perturbations et stabilisation des syst`emes dis-tribu´es. Paris, Masson.

(16)

Références

Documents relatifs

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

A detailed exposition of the compensation approach can be found in [1, 3, 4], in which it has been shown to work for two-dimensional random walks on the lattice of the first

A finite tunnel magnetoresistance is measured when the Sm 1−x Gd x Al 2 electrode is in a magnetic compensated state proving that Sm 1−x Gd x Al 2 with zero magnetization is able

To answer questions 1 and 2, we will not use the classical approach which consists in finding a general quenching criterion for initial data and in studying the quenching behavior

In this work, we study the notion of enlarged exact compensation for a class of discrete linear distributed systems.. It’s an extension to the dis- crete and regional cases of

Keywords: Image processing, numerical analysis, total variation, finite differences, finite elements, error bounds.. MSC (2020): 49Q06 49Q20 49M29 26A45

We provide alternative conditions to guarantee unicity in the solution of the identification procedure for the class of switched linear systems.. Batch identification

In section 6 we construct a uniquely ergodic non weakly mixing finite rank Cantor minimal system to illustrate that eigenvalues do not always come from the stable space associated