975 resultados para Linear matrix inequalities (LMI)


Relevância:

100.00% 100.00%

Publicador:

Resumo:

This paper concerns with the problem of state-feedback H∞ control design for a class of linear systems with polytopic uncertainties and mixed time-varying delays in state and input. Our approach can be described as follows. We first construct a state-feedback controller based on the idea of parameter-dependent controller design. By constructing a new parameter-dependent Lyapunov-Krasovskii functional (LKF), we then derive new delay-dependent conditions in terms of linear matrix inequalities ensuring the exponential stability of the corresponding closed-loop system with a H∞ disturbance attenuation level. The effectiveness and applicability of the obtained results are demonstrated by practical examples.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Linear systems with interval time-varying delay and unknown-but-bounded disturbances are considered in this paper. We study the problem of finding outer bound of forwards reachable sets and inter bound of backwards reachable sets of the system. Firstly, two definitions on forwards and backwards reachable sets, where initial state vectors are not necessary to be equal to zero, are introduced. Then, by using the Lyapunov-Krasovskii method, two sufficient conditions for the existence of: (i) the smallest possible outer bound of forwards reachable sets; and (ii) the largest possible inter bound of backwards reachable sets, are derived. These conditions are presented in terms of linear matrix inequalities with two parameters need to tuned, which therefore can be efficiently solved by combining existing convex optimization algorithms with a two-dimensional search method to obtain optimal bounds. Lastly, the obtained results are illustrated by four numerical examples.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Abstract
This study examines the problem of synchronization for singular complex dynamical networks with Markovian jumping parameters and two additive time-varying delay components. The complex networks consist of m modes which switch from one mode to another according to a Markovian chain with known transition probability. Pinning control strategies are designed to make the singular complex networks synchronized. Based on the appropriate Lyapunov-Krasovskii functional, introducing some free weighting matrices and using convexity of matrix functions, a novel synchronization criterion is derived. The proposed sufficient conditions are established in the form of linear matrix inequalities. Finally, a numerical example is presented to illustrate the effectiveness of the obtained results.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Abstract
In this article, an exponential stability analysis of Markovian jumping stochastic bidirectional associative memory (BAM) neural networks with mode-dependent probabilistic time-varying delays and impulsive control is investigated. By establishment of a stochastic variable with Bernoulli distribution, the information of probabilistic time-varying delay is considered and transformed into one with deterministic time-varying delay and stochastic parameters. By fully taking the inherent characteristic of such kind of stochastic BAM neural networks into account, a novel Lyapunov-Krasovskii functional is constructed with as many as possible positive definite matrices which depends on the system mode and a triple-integral term is introduced for deriving the delay-dependent stability conditions. Furthermore, mode-dependent mean square exponential stability criteria are derived by constructing a new Lyapunov-Krasovskii functional with modes in the integral terms and using some stochastic analysis techniques. The criteria are formulated in terms of a set of linear matrix inequalities, which can be checked efficiently by use of some standard numerical packages. Finally, numerical examples and its simulations are given to demonstrate the usefulness and effectiveness of the proposed results.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Partial state estimation of dynamical systems provides significant advantages in practical applications. Likewise, pre-compensator design for multi variable systems invokes considerable increase in the order of the original system. Hence, applying functional observer to pre-compensated systems can result in lower computational costs and more practicability in some applications such as fault diagnosis and output feedback control of these systems. In this note, functional observer design is investigated for pre-compensated systems. A lower order pre-compensator is designed based on a H2 norm optimization that is designed as the solution of a set of linear matrix inequalities (LMIs). Next, a minimum order functional observer is designed for the pre-compensated system. An LTI model of an irreversible chemical reactor is used to demonstrate our design algorithm, and to highlight the benefits of the proposed schemes.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Neste trabalho é proposta uma metodologia de rastreamento de sinais e rejeição de distúrbios aplicada a sistemas não-lineares. Para o projeto do sistema de rastreamento, projeta-se os controladores fuzzy M(a) e N(a) que minimizam o limitante superior da norma H∞ entre o sinal de referência r(t) e o sinal de erro de rastreamento e(t), sendo e(t) a diferença entre a entrada de referência e a saída do sistema z(t). No método de rejeição de distúrbio utiliza-se a realimentação dinâmica da saída através de um controlador fuzzy Kc(a) que minimiza o limitante superior da norma H∞ entre o sinal de entrada exógena w(t) e o sinal de saída z(t). O procedimento de projeto proposto considera as não-linearidades da planta através dos modelos fuzzy Takagi-Sugeno. Os métodos são equacionados utilizando-se inequações matriciais lineares (LMIs), que quando factíveis, podem ser facilmente solucionados por algoritmos de convergência polinomial. Por fim, um exemplo ilustra a viabilidade da metodologia proposta.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Relevância:

100.00% 100.00%

Publicador:

Resumo:

This research presents a systematic procedure to obtain estimates, via extended Lyapunov functions, of attracting sets of a class of nonlinear systems, as well as an estimate of their stability regions. The considered class of nonlinear systems, called in this note the extended Lurie system, consists of nonlinear systems like those of the Lurie problem where one of the nonlinear functions can violate the sector conditions of the Lurie problem around the origin. In case of nonautonomous systems the concept of absolute stability is extended and uniform estimates of the attracting set are obtained. Two classical nonlinear systems, the forced duffing equation and the Van der Pol system, are analyzed with the proposed procedure.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

A branch and bound algorithm is proposed to solve the H2-norm model reduction problem for continuous-time linear systems, with conditions assuring convergence to the global optimum in finite time. The lower and upper bounds used in the optimization procedure are obtained through Linear Matrix Inequalities formulations. Examples illustrate the results.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

A branch and bound algorithm is proposed to solve the H2-norm model reduction problem and the H2-norm controller reduction problem, with conditions assuring convergence to the global optimum in finite time. The lower and upper bounds used in the optimization procedure are obtained through linear matrix inequalities formulations. Examples illustrate the results.