scholarly journals Robust local stabilization of discrete time-varying delayed state systems under saturating actuators

Automatica ◽  
2020 ◽  
Vol 122 ◽  
pp. 109266
Author(s):  
Michelle F.F. Castro ◽  
Alexandre Seuret ◽  
Valter J.S. Leite ◽  
Luis F.P. Silva
2018 ◽  
Vol 51 (26) ◽  
pp. 143-148
Author(s):  
C. de Souza ◽  
V.J.S. Leite ◽  
E.B. Castelan ◽  
L.F.P. Silva

2020 ◽  
Vol 518 ◽  
pp. 272-285 ◽  
Author(s):  
Luís F.P. Silva ◽  
Valter J.S. Leite ◽  
Eugênio B. Castelan ◽  
Michael Klug ◽  
Kevin Guelton

2018 ◽  
Vol 2018 ◽  
pp. 1-9 ◽  
Author(s):  
J. V. V. Silva ◽  
L. F. P. Silva ◽  
I. Rubio Scola ◽  
V. J. S. Leite

The robust local stabilization of uncertain discrete-time systems with time-varying state delayed and subject to saturating actuators is investigated in this work. A convex optimization method is proposed to compute robust state feedback control law such that the uncertain closed-loop is locally asymptotically stable if the initial condition belongs to an estimate of the region of attraction for the origin. The proposed procedure allows computing estimates of the region of attraction through the intersection of ellipsoidal sets in an augmented space, reducing the conservatism of the estimates found in the literature. Also, the conditions can handle the amount of delay variation between two consecutive samples, which is new in the literature for the discrete-time case. Although the given synthesis conditions are delay dependent, the proposed control law is delay independent, yielding to easier real time implementations. A convex procedure is proposed to maximize the size of the set of safe initial conditions. Numerical examples are provided to illustrate the effectiveness of our approach and also to compare it with other conditions in the literature.


2009 ◽  
Vol 34 (12) ◽  
pp. 1529-1533 ◽  
Author(s):  
Mai-Ying ZHONG ◽  
Shuai LIU ◽  
Hui-Hong ZHAO

Eng ◽  
2021 ◽  
Vol 2 (1) ◽  
pp. 99-125
Author(s):  
Edward W. Kamen

A transform approach based on a variable initial time (VIT) formulation is developed for discrete-time signals and linear time-varying discrete-time systems or digital filters. The VIT transform is a formal power series in z−1, which converts functions given by linear time-varying difference equations into left polynomial fractions with variable coefficients, and with initial conditions incorporated into the framework. It is shown that the transform satisfies a number of properties that are analogous to those of the ordinary z-transform, and that it is possible to do scaling of z−i by time functions, which results in left-fraction forms for the transform of a large class of functions including sinusoids with general time-varying amplitudes and frequencies. Using the extended right Euclidean algorithm in a skew polynomial ring with time-varying coefficients, it is shown that a sum of left polynomial fractions can be written as a single fraction, which results in linear time-varying recursions for the inverse transform of the combined fraction. The extraction of a first-order term from a given polynomial fraction is carried out in terms of the evaluation of zi at time functions. In the application to linear time-varying systems, it is proved that the VIT transform of the system output is equal to the product of the VIT transform of the input and the VIT transform of the unit-pulse response function. For systems given by a time-varying moving average or an autoregressive model, the transform framework is used to determine the steady-state output response resulting from various signal inputs such as the step and cosine functions.


Sign in / Sign up

Export Citation Format

Share Document