You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/9800
Title: 
LMI-based algorithm for strictly positive real systems with static output feedback
Author(s): 
Institution: 
  • Universidade Estadual de Londrina (UEL)
  • Universidade Estadual Paulista (UNESP)
ISSN: 
0167-6911
Sponsorship: 
  • Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
  • Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Abstract: 
An algorithm based on Linear Matrix Inequalities (LMIs) is proposed to find a constant output feedback matrix K-0 and a constant output tandem matrix F such that the controlled system {A - BK0C, B, FC} is Strictly Positive Real (SPR). The number of output variables of the plant {A, B, C} is greater than or equal to the number of its input variables. Considering that SPR systems with static output feedback are related to SPR systems with static state feedback, as shown in this manuscript, the first step of the algorithm is to find a matrix F such that all transmission zeros of the system {A, B. FC} have negative real parts. After finding this matrix F. an output feedback matrix K-0 such that the system {A - BK0C, B, FC} is SPR is found. Another algorithm is proposed to specify a decay rate. The results are applied to the simulation of electrical stimulation for paraplegic patients, to vary knee joint angle from 0 degrees to 60 degrees. (C) 2012 Elsevier B.V. All rights reserved.
Issue Date: 
1-Apr-2012
Citation: 
Systems & Control Letters. Amsterdam: Elsevier B.V., v. 61, n. 4, p. 521-527, 2012.
Time Duration: 
521-527
Publisher: 
Elsevier B.V.
Keywords: 
  • LMI
  • SPR
  • Output feedback
  • Algorithm
Source: 
http://dx.doi.org/10.1016/j.sysconle.2012.01.001
URI: 
Access Rights: 
Acesso restrito
Type: 
outro
Source:
http://repositorio.unesp.br/handle/11449/9800
Appears in Collections:Artigos, TCCs, Teses e Dissertações da Unesp

There are no files associated with this item.
 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.