HAL Id: hal-00602338
https://hal.archives-ouvertes.fr/hal-00602338
Submitted on 22 Jun 2011
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.
A novel control scheme for teleoperation with guaranteed performance under time-varying delays
Bo Zhang, Alexandre Kruszewski, Jean-Pierre Richard
To cite this version:
Bo Zhang, Alexandre Kruszewski, Jean-Pierre Richard. A novel control scheme for teleoperation with
guaranteed performance under time-varying delays. 23th Chinese Control and Decision Conference
(CCDC), Jun 2011, Mianyang, China. �hal-00602338�
A Novel Control Scheme for Teleoperation with Guaranteed Performance under Time-Varying Delays
Bo Zhang, Alexandre Kruszewski and Jean-Pierre Richard
Abstract— This work deals with the stability and synchro- nization of systems with time-varying delays. We propose a novel control scheme with position/velocity information channel on the basis of Lyapunov-Krasovskii functional (LKF) and H
∞control theory by using Linear Matrix Inequality (LMI). The proposed solution is efficient for different working conditions, such as abrupt motion and wall contact, and this is illustrated by various simulations.
Index Terms— Teleoperation System, Time-Varying Delay, H
∞Control, Lyapunov-Krasovskii Functional, Linear Matrix Inequality
I. INTRODUCTION
The concept of teleoperation implies a dual system, in which a remote slave robot tracks the motion of a master ma- nipulator. It must include a communication medium, so that the position/velocity information of the master manipulator handled by the human operator is delivered to the slave robot, and the corresponding data of the slave is transmitted back to the master. It constitutes a Networked Control System in which the communication channels, especially the Internet, introduce additional dynamics represented by time-varying delays [11] [15]. In order to avoid a severe deterioration of the global performance, these delays must be considered at the control design stage [1] [2].
The passivity formalism represents the most popular ap- proach for Velocity-Force (VF) schemes in teleoperation.
Since the cornerstone papers of Anderson and Spong [1], Niemeyer and Slotine [10], the passivity, scattering and wave variables allow for including arbitrary time delays into systems in a passive and hence stable fashion. Besides, another formulation is the passivity-based structure without the transformation of wave variables. A recent approach is the energy based time domain passivity control (ET- DPC) [12]. Overall, passivity-based approaches can deal with stabilization and velocity tracking under any time-varying delays. But, as it was already noted in [12], passivity does not allow for optimizing the system performance, which keeps decreasing as the communication delays increase and does not guarantee the position tracking in general.
Thus, from the point of view of performance, it is desirable to design a controller ensuring the position tracking with prescribed convergence rate, which of course will be linked to the Quality of Service available from the network. Various control strategies have been proposed in this area. In the
{Bo Zhang, Alexandre Kruszewski and Jean-Pierre Richard} are with Universit´e Lille Nord de France, Ecole Centrale de Lille - 59651 Villeneuve d’Ascq, France and LAGIS, CNRS FRE3303, Laboratoire d’Automatique, G´enie Informatique et Signal. J.P.Richard is also with INRIA NON A.
case of a constant communication delay, Chopra et al. [3]
proposed a new system configuration for bilateral teleop- eration in order to guarantee the position tracking. Later on, Garcia-Valdovinos and Parra-Vega [6] designed a new observer-based higher-order sliding mode impedance control strategy.
The present paper aims at considering the case of variable delays. With this aim in mind, Lyapunov approaches for time-delay systems are helpful [11]. We will both ensure the stability of the teleoperation system and realize high H ∞
performance of the position tracking. In the case of time- varying delays, many stability conditions have been proposed in terms of Lyapunov-Krasovskii functionals (LKF), which can be solved by Linear Matrix Inequality (LMI). Valuable results can be found in the paper [4] by Fridman (see also the included references). For H ∞ performance consideration, we will also use results from [4] [5] on the H ∞ control of systems with delays (see also [14] [16] for H ∞ control with time-varying delays). These two approaches will be helpful to design a novel teleoperation system scheme, which makes use of LKF to ensure the stability, and further, realize the position tracking by H ∞ control.
This paper is organized as follows: Section 2 introduces and briefly explains the theorems to be used later. The problem under consideration is briefly presented in section 3. In section 4, the bilateral teleoperation system using the LKF and state-feedback H ∞ control is given. Results of simulation are presented in section 5. Finally we conclude and discuss the future work in section 6.
II. PRELIMINARIES
In the next section, the teleoperation system will be modeled as a linear time-varying delay system. This section is devoted to the stability and the performance analysis of this class of models, which is described by,
(Σ 1 )
½ x(t) = ˙ P n
i=0 A i x(t − τ i (t))
x(t 0 + θ) = φ(θ), x(t ˙ 0 + θ) = ˙ φ(θ), θ ∈ [−h 2 , 0]
(1)
where, x(t) ∈ R n is the state, τ 0 (t) ≡ 0, φ(θ) is the initial
condition, and the time-varying delays, τ i (t) ∈ [h 1 , h 2 ],
h 1 ≥ 0, i = 1, 2, ..., n. Considering the following Lyapunov-
Krasovskii functional [4],
V (t, x(t), x(t)) = ˙ x(t) T P x(t) +
Z t
t−h
2x(s) T S a x(s)ds + Z t
t−h
1x(s) T Sx(s)ds
+ h 1
Z 0
−h
1Z t
t+θ
˙
x(s) T R x(s)dsdθ ˙ +
X n
i=1
(h 2 − h 1 ) Z −h
1−h
2Z t
t+θ
˙
x(s) T R ai x(s)dsdθ ˙ (2)
Theorem 1: Suppose there exists n × n matrices P > 0, R > 0, S > 0, S a > 0, R ai > 0, P 2 , P 3 , Y 1 , Y 2 , i = 1, 2, ..., n, such that the condition (3) with notations (4) at the top of next page is feasible, the system (1) is asymptotically stable for time-varying delays τ i (t) ∈ [h 1 , h 2 ], i = 1, 2, ..., n.
Proof. The theorem is the extension of [9] and the proof is straightforward.
Based on Theorem 1, the Lyapunov-Krasovskii functional stability condition with several time-varying delays is used to derive LMI stability conditions, which can be solved efficiently. Further, this paper is not only concentrated in the guarantee of stability, but also in the improvement of the overall performances under time-varying delays, so we employ Bounded Real Lemma (BRL) based on Theorem 1 [5].
Generally, given the following system,
(Σ 2 )
½ x(t) = ˙ P n
i=0 A i x(t − τ i (t)) + Bw(t)
z(t) = Cx(t) (5)
where, new term w(t) ∈ R l is defined as the exogenous disturbance signal, and z(t) ∈ R q is seen as the objective control output, C is a constant matrice.
For a prescribed scalar γ, we define the performance index, J(w) =
Z ∞
0
(z(t) T z(t) − γ 2 w(t) T w(t))dt (6) Then, according to the theory of H ∞ control, we can en- sure the stability and optimize the performance of the system with time-varying delays by verifying the performance index,
J (w) < 0 (7)
So, we obtain the following Theorem as follow,
Theorem 2: Suppose there exists n × n matrices P > 0, R > 0, S > 0, S a > 0, R ai > 0, P 2 , P 3 , Y 1 , Y 2 , i = 1, 2, ..., n, and a positive scale γ, such that the condition (8) with notations (9) at the top of next page is feasible, the system (5) is asymptotically stable and J (w) < 0 for time- varying delays τ i (t) ∈ [h 1 , h 2 ], i = 1, 2, ..., n.
Proof. To ensure J (w) < 0, we consider the condition, V ˙ (t, x(t), x(t)) + ˙ z(t) T z(t) − γ 2 w(t) T w(t) < 0 (10) Integrating the resulting inequality in t from 0 to ∞,
Z ∞
0
( ˙ V (t, x(t), x(t)) + ˙ z(t) T z(t) − γ 2 w(t) T w(t))dt
= V (∞, x(∞), x(∞)) ˙ − V (0, x(0), x(0)) ˙ +
Z ∞
0
(z(t) T z(t) − γ 2 w(t) T w(t))dt
< 0
(11)
Because V (0, x(0), x(0)) = 0 ˙ and V (∞, x(∞), x(∞)) ˙ ≥ 0, we can assure J (w) < 0 by adding the term z(t) T z(t) − γ 2 w(t) T w(t) into V ˙ (t, x(t), x(t)). Considering the system ˙ of (14), we get,
V ˙ (t, x(t), x(t)) + ˙ z(t) T z(t) − γ 2 w(t) T w(t)
= x(t) T (S + S a )x(t) + ˙ x(t) T P x(t) + x(t) T P x(t) ˙
− x(t − h 1 ) T Sx(t − h 1 )
− x(t − h 2 ) T S a x(t − h 2 ) + ˙ x(t) T [h 2 1 R + (h 2 − h 1 ) 2
X n
i=1
R ai ] ˙ x(t)
− h 1
Z t
t−h
1˙
x(s) T R x(s)ds ˙
− (h 2 − h 1 ) Z t−h
1t−h
2˙ x(s) T
X n
i=1
R ai x(s)ds ˙ + z(t) T z(t) − γ 2 w(t) T w(t)
(12)
Then, substituting for z(t) and w(t), the derivation process is same as for Theorem 1. Applying the Jensen’s inequal- ity [7], then obtain,
V ˙ (t, x(t), x(t)) + ˙ z(t) T z(t) − γ 2 w(t) T w(t)
≤ x(t) T (S + S a + C T C)x(t) + ˙ x(t) T P x(t) + x(t) T P x(t) ˙
− x(t − h 1 ) T Sx(t − h 1 ) − x(t − h 2 ) T S a x(t − h 2 ) + ˙ x(t) T [h 2 1 R + (h 2 − h 1 ) 2
X n
i=1
R ai ] ˙ x(t)
− [x(t) T − x(t − h 1 ) T ]R[x(t) − x(t − h 1 )]
− X n
i=1
v T 1i R ai v 1i − X n
i=1
v 2i T R ai v 2i
− w(t) T γ 2 I l w(t)
(13) where,
v 1i = Z t−h
1t−τ
i(t)
˙ x(s)ds
v 2i =
Z t−τ
i(t)
t−h
2˙
x(s)ds, i = 1, 2, ..., n
(14)
By using the descriptor method and free weighting ma-
trices [4] [8], for some n × n matrices P 2 , P 3 , Y 1 , Y 2 ,
the expression as follows is added into V ˙ (t, x(t), x(t)) + ˙
z(t) T z(t) − γ 2 w(t) T w(t),
Γ
1=
Γ
111Γ
112R + P
ni=1
P
2TA
i− nY
1TnY
1T−P
2TA
1+ Y
1T... −P
2TA
n+ Y
1TY
1T... Y
1T> Γ
122P
ni=1
P
3TA
i− nY
2TnY
2T−P
3TA
1+ Y
2T... −P
3TA
n+ Y
2TY
2T... Y
2T> > −S − R 0 0 0 0 0 0 0
> > > −S
a0 0 0 0 0 0
> > > > −R
a10 0 0 0 0
> > > > > ... 0 0 0 0
> > > > > > −R
an0 0 0
> > > > > > > −R
a10 0
> > > > > > > > ... 0
> > > > > > > > > −R
an
< 0 (3)
Γ 1 11 = S + S a − R + A T 0 P 2 + P 2 T A 0 , Γ 1 12 = P − P 2 T + A T 0 P 3 , Γ 1 22 = −P 3 − P 3 T + h 2 1 R + (h 2 − h 1 ) 2 X n
i=1
R ai
(4)
Γ
2=
Γ
211Γ
212R + P
ni=1
P
2TA
i− nY
1TnY
1T−P
2TA
1+ Y
1T... −P
2TA
n+ Y
1TY
1T... Y
1TP
2TB
> Γ
222P
ni=1