dc.contributorUniversidade Estadual Paulista (Unesp)
dc.contributorParc Orsay Université
dc.contributorUniversidade Estadual de Campinas (UNICAMP)
dc.date.accessioned2014-05-27T11:25:19Z
dc.date.accessioned2022-10-05T18:23:47Z
dc.date.available2014-05-27T11:25:19Z
dc.date.available2022-10-05T18:23:47Z
dc.date.created2014-05-27T11:25:19Z
dc.date.issued2010-12-01
dc.identifierProceedings of the IEEE Conference on Decision and Control, p. 924-929.
dc.identifier0191-2216
dc.identifierhttp://hdl.handle.net/11449/72032
dc.identifier10.1109/CDC.2010.5717802
dc.identifierWOS:000295049101029
dc.identifier2-s2.0-79953136199
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/3921136
dc.description.abstractThis paper is concerned with ℋ 2 and ℋ ∞ filter design for discrete-time Markov jump systems. The usual assumption of mode-dependent design, where the current Markov mode is available to the filter at every instant of time is substituted by the case where that availability is subject to another Markov chain. In other words, the mode is transmitted to the filter through a network with given transmission failure probabilities. The problem is solved by modeling a system with N modes as another with 2N modes and cluster availability. We also treat the case where the transition probabilities are not exactly known and demonstrate our conditions for calculating an ℋ ∞ norm bound are less conservative than the available results in the current literature. Numerical examples show the applicability of the proposed results. ©2010 IEEE.
dc.languageeng
dc.relationProceedings of the IEEE Conference on Decision and Control
dc.relation0,591
dc.rightsAcesso aberto
dc.sourceScopus
dc.subjectDiscrete-time
dc.subjectFilter designs
dc.subjectMarkov Chain
dc.subjectMarkov jump system
dc.subjectNumerical example
dc.subjectTransition probabilities
dc.subjectTransmission failures
dc.subjectMarkov processes
dc.titleFiltering for discrete-time Markov jump systems with network transmitted mode
dc.typeTrabalho apresentado em evento


Este ítem pertenece a la siguiente institución