H(infinity) filtering for rectangular discrete-time descriptor systems

dc.creatorISHIHARA, Joao Y.
dc.creatorTERRA, Marco H.
dc.creatorESPINOZA, B. M.
dc.date.accessioned2012-10-19T01:06:04Z
dc.date.accessioned2018-07-04T14:47:43Z
dc.date.available2012-10-19T01:06:04Z
dc.date.available2018-07-04T14:47:43Z
dc.date.created2012-10-19T01:06:04Z
dc.date.issued2009
dc.identifierAUTOMATICA, v.45, n.7, p.1743-1748, 2009
dc.identifier0005-1098
dc.identifierhttp://producao.usp.br/handle/BDPI/17741
dc.identifier10.1016/j.automatica.2009.03.012
dc.identifierhttp://dx.doi.org/10.1016/j.automatica.2009.03.012
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1614539
dc.description.abstractThis 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.
dc.languageeng
dc.publisherPERGAMON-ELSEVIER SCIENCE LTD
dc.relationAutomatica
dc.rightsCopyright PERGAMON-ELSEVIER SCIENCE LTD
dc.rightsrestrictedAccess
dc.subjectDescriptor systems
dc.subjectH(infinity) filtering
dc.subjectEstimation
dc.titleH(infinity) filtering for rectangular discrete-time descriptor systems
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución