H(infinity) filtering for rectangular discrete-time descriptor systems
Contribuinte(s) |
UNIVERSIDADE DE SÃO PAULO |
---|---|
Data(s) |
18/10/2012
18/10/2012
2009
|
Resumo |
This paper deals with the H(infinity) recursive estimation problem for general rectangular time-variant descriptor systems in discrete time. Riccati-equation based recursions for filtered and predicted estimates are developed based on a data fitting approach and game theory. In this approach, the nature determines a state sequence seeking to maximize the estimation cost, whereas the estimator tries to find an estimate that brings the estimation cost to a minimum. A solution exists for a specified gamma-level if the resulting cost is positive. In order to present some computational alternatives to the H(infinity) filters developed, they are rewritten in information form along with the respective array algorithms. (C) 2009 Elsevier Ltd. All rights reserved. Fundacao de Amparoa Pesquisa do Estado de sao Paulo (FAPESP)[04/03826-8] Fundacao de Amparoa Pesquisa do Estado de sao Paulo (FAPESP)[03/12574-0] Cnpq[310852/2006-4] |
Identificador |
AUTOMATICA, v.45, n.7, p.1743-1748, 2009 0005-1098 http://producao.usp.br/handle/BDPI/17741 10.1016/j.automatica.2009.03.012 |
Idioma(s) |
eng |
Publicador |
PERGAMON-ELSEVIER SCIENCE LTD |
Relação |
Automatica |
Direitos |
restrictedAccess Copyright PERGAMON-ELSEVIER SCIENCE LTD |
Palavras-Chave | #Descriptor systems #H(infinity) filtering #Estimation #SINGULAR SYSTEMS #ARRAY-ALGORITHMS #STATE ESTIMATION #LINEAR-SYSTEMS #Automation & Control Systems #Engineering, Electrical & Electronic |
Tipo |
article original article publishedVersion |