Non-minimal order low-frequency H-infinity filtering for uncertain discrete-time systems

Página do item simplificado
dc.creatorLício Bruno Rodrigues Ribeiro Romão
dc.creatorLuciano Antonio Frezzatto Santos
dc.creatorMauricio C. de Oliveira
dc.creatorRicardo C. L. F. Oliveira
dc.creatorPedro L. D. Peres
dc.date.accessioned2025-03-31T16:15:30Z
dc.date.accessioned2025-09-09T00:31:16Z
dc.date.available2025-03-31T16:15:30Z
dc.date.issued2017
dc.identifier.doihttps://doi.org/10.1016/j.ifacol.2017.08.1044
dc.identifier.issn2405-8963
dc.identifier.urihttps://hdl.handle.net/1843/81128
dc.languageeng
dc.publisherUniversidade Federal de Minas Gerais
dc.relation.ispartof20th IFAC World Congress
dc.rightsAcesso Aberto
dc.subjectSistemas lineares
dc.subjectLiapunov, Funções de
dc.subject.otherLinear matrix inequalities
dc.subject.otherFiltering
dc.subject.otherGeneralized Kalman-Yakubovich-Popov Lemma
dc.subject.otherLow-frequency specifications
dc.subject.otherLinear time-invariant systems
dc.titleNon-minimal order low-frequency H-infinity filtering for uncertain discrete-time systems
dc.typeArtigo de evento
local.citation.epage6482
local.citation.spage6477
local.description.resumoThis paper proposes a sufficient condition for the discrete-time robust H∞ filtering design problem with low-frequency specifications using an extension of the generalized Kalman-Yakubovich-Popov lemma. The matrices of the system are supposed to be uncertain, time-invariant and to belong to a polytopic domain. The proposed approach takes advantage of a non-minimal filter structure, that is, a filter with order greater than the order of the system being filtered, to provide improved H∞ bounds for low-frequency specifications. The condition can be solved by means of linear matrix inequality relaxations with slack variables and Lyapunov matrices which are considered as homogeneous polynomials of arbitrary degree. Numerical examples illustrate the improvements on the H∞ bounds provided by the non-minimal filter structure in combination with the more accurate polynomial approximations (higher degrees) for the optimization variables.
local.publisher.countryBrasil
local.publisher.departmentENG - DEPARTAMENTO DE ENGENHARIA ELETRÔNICA
local.publisher.initialsUFMG
local.url.externahttps://www.sciencedirect.com/science/article/pii/S2405896317315306

Arquivos

Licença do pacote

Agora exibindo 1 - 1 de 1
Imagem de Miniatura
Nome:
License.txt
Tamanho:
1.99 KB
Formato:
Plain Text
Descrição:
Baixar

Coleções

Artigo de Evento

Logo UFMG